Sharing the cost of multicast transmissions
From MaRDI portal
Publication:5952450
DOI10.1006/jcss.2001.1754zbMath0996.68026OpenAlexW2123442845MaRDI QIDQ5952450
Joan Feigenbaum, Christos H. Papadimitriou, Scott J. Shenker
Publication date: 27 February 2002
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.2001.1754
Related Items (42)
Approximation and collusion in multicast cost sharing ⋮ Worst-case optimal redistribution of VCG payments in multi-unit auctions ⋮ Stackelberg thresholds in network routing games or the value of altruism ⋮ Mechanism design for policy routing ⋮ When ignorance helps: graphical multicast cost sharing games ⋮ Sharing the cost of multicast transmissions in wireless networks ⋮ Fair Attribution of Functional Contribution in Artificial and Biological Networks ⋮ Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems ⋮ Cost sharing and strategyproof mechanisms for set cover games ⋮ Diffusion auction design ⋮ On Groves mechanisms for costly inclusion ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Hardness results for multicast cost sharing. ⋮ Collusive dominant-strategy truthfulness ⋮ Distributed algorithmic mechanism design for scheduling on unrelated machines ⋮ An incentive-based distributed mechanism for scheduling divisible loads in tree networks ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems ⋮ A BGP-based mechanism for lowest-cost routing ⋮ Designing fast converging cost sharing methods for multicast transmissions ⋮ Price of stability in survivable network design ⋮ Some results of Christos Papadimitriou on internet structure, network routing, and web information ⋮ Better redistribution with inefficient allocation in multi-unit auctions ⋮ Polyhedral study of the connected subgraph problem ⋮ Computationally-feasible truthful auctions for convex bundles ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ Black-box reductions for cost-sharing mechanism design ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Optimal-in-expectation redistribution mechanisms ⋮ Computer science and decision theory ⋮ Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements ⋮ Leveraging possibilistic beliefs in unrestricted combinatorial auctions ⋮ Feature Selection via Coalitional Game Theory ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity ⋮ The Parallel Complexity of Coloring Games ⋮ A cross-layer optimization framework for joint channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks ⋮ Fair cost-sharing methods for scheduling jobs on parallel machines ⋮ Prize-Collecting TSP with a Budget Constraint ⋮ A survey on networking games in telecommunications ⋮ Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games ⋮ Unnamed Item
Cites Work
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Incentives, Decentralized Control, the Assignment of Joint Costs and Internal Pricing
- The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility
- Incentives in Teams
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Communication Complexity
- Algorithmic mechanism design
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sharing the cost of multicast transmissions
