Pages that link to "Item:Q5952450"
From MaRDI portal
The following pages link to Sharing the cost of multicast transmissions (Q5952450):
Displayed 42 items.
- Collusive dominant-strategy truthfulness (Q417640) (← links)
- An incentive-based distributed mechanism for scheduling divisible loads in tree networks (Q433420) (← links)
- Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
- Better redistribution with inefficient allocation in multi-unit auctions (Q460636) (← links)
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- Cost sharing and strategyproof mechanisms for set cover games (Q604756) (← links)
- Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
- Price of stability in survivable network design (Q647493) (← links)
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions (Q725051) (← links)
- Worst-case optimal redistribution of VCG payments in multi-unit auctions (Q834856) (← links)
- Stackelberg thresholds in network routing games or the value of altruism (Q834861) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
- Optimal-in-expectation redistribution mechanisms (Q969531) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- Hardness results for multicast cost sharing. (Q1401398) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- Approximation and collusion in multicast cost sharing (Q1885423) (← links)
- A BGP-based mechanism for lowest-cost routing (Q1953638) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- Trouble comes in threes: core stability in minimum cost connection networks (Q2242222) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Mechanism design for policy routing (Q2375297) (← links)
- Efficiency analysis of load balancing games with and without activation costs (Q2434275) (← links)
- A survey on networking games in telecommunications (Q2567161) (← links)
- Diffusion auction design (Q2667812) (← links)
- The Parallel Complexity of Coloring Games (Q2819445) (← links)
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
- Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems (Q4571047) (← links)
- Fair Attribution of Functional Contribution in Artificial and Biological Networks (Q4823709) (← links)
- A cross-layer optimization framework for joint channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks (Q4976345) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620) (← links)
- Feature Selection via Coalitional Game Theory (Q5457592) (← links)
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity (Q5459985) (← links)
- (Q5743446) (← links)
- On Groves mechanisms for costly inclusion (Q6076923) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)