Hardness results for multicast cost sharing

Authors:
Joan Feigenbaum;Arvind Krishnamurthy;Rahul Sami;Scott Shenker
Affiliations:
Yale University, Department of Computer Science, P.O. Box 2158, Yale Station, New Haven, CT;Yale University, Department of Computer Science, P.O. Box 2158, Yale Station, New Haven, CT;Yale University, Department of Computer Science, P.O. Box 2158, Yale Station, New Haven, CT;ICSI, 1947 Center Street, Berkeley, CA
Venue:
Theoretical Computer Science
Year:
2003

Citing 19
Cited 28

An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks

IEEE Transactions on Computers
A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems

IEEE Transactions on Computers
Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Making greed work in networks: a game-theoretic analysis of switch service disciplines

IEEE/ACM Transactions on Networking (TON)
The PIM architecture for wide-area multicast routing

IEEE/ACM Transactions on Networking (TON)
Communication complexity

Communication complexity
Sharing the “cost” of multicast trees: an axiomatic analysis

IEEE/ACM Transactions on Networking (TON)
Distributed games: from mechanisms to protocols

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
IP multicast channels: EXPRESS support for large-scale single-source applications

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Computationally feasible VCG mechanisms

Proceedings of the 2nd ACM conference on Electronic commerce
Applications of approximation algorithms to cooperative games

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Competitive generalized auctions

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pricing multicasting in more practical network models

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sharing the cost of multicast transmissions

Journal of Computer and System Sciences - Special issue on Internet algorithms
Distributed algorithmic mechanism design: recent results and future directions

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Hardness Results for Multicast Cost Sharing

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
A Game Theoretic Approach to Decentralized Flow Control of Markovian Queueing Networks

Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Efficient Network Allocations with Selfish Users

Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Architecting noncooperative networks

IEEE Journal on Selected Areas in Communications

Sharing the cost of multicast transmissions in wireless networks

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
New trade-offs in cost-sharing mechanisms

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A BGP-based mechanism for lowest-cost routing

Distributed Computing - Special issue: PODC 02
Sharing the cost of multicast transmissions in wireless networks

Theoretical Computer Science
On the convergence of multicast games in directed networks

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Beyond moulin mechanisms

Proceedings of the 8th ACM conference on Electronic commerce
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On Nash equilibria for multicast transmissions in ad-hoc wireless networks

Wireless Networks
New efficiency results for makespan cost sharing

Information Processing Letters
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems

Theoretical Computer Science
Optimal Efficiency Guarantees for Network Design Mechanisms

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Is Shapley Cost Sharing Optimal?

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Quantifying inefficiency in cost-sharing mechanisms

Journal of the ACM (JACM)
Fair cost-sharing methods for scheduling jobs on parallel machines

Journal of Discrete Algorithms
Mechanism design for set cover games with selfish element agents

Theoretical Computer Science
When ignorance helps: Graphical multicast cost sharing games

Theoretical Computer Science
Cost sharing methods for makespan and completion time scheduling

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Pricing tree access networks with connected backbones

ESA'07 Proceedings of the 15th annual European conference on Algorithms
The price of nash equilibria in multicast transmissions games

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Cost sharing and strategyproof mechanisms for set cover games

Journal of Combinatorial Optimization
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions

Artificial Intelligence
Computing α-efficient cost allocations for unbalanced games

SocInfo'10 Proceedings of the Second international conference on Social informatics
Optimal cost-sharing mechanisms for steiner forest problems

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Defending against distance cheating in link-weighted application-layer multicast

IEEE/ACM Transactions on Networking (TON)
Fair cost-sharing methods for scheduling jobs on parallel machines

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Multicast transmissions in non-cooperative networks with a limited number of selfish moves

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Cost sharing and strategyproof mechanisms for set cover games

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On nash equilibria for multicast transmissions in ad-hoc wireless networks

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of group-strategyproof, budget-balanced mechanisms. We also extend a classical impossibility result in game theory to show that no strategyproof mechanism can be both approximately efficient and approximately budget-balanced. Our results show that one important and natural case of multicast cost sharing is an example of a canonical hard problem in distributed, algorithmic mechanism design; in this sense, they represent progress toward the development of a complexity theory of Internet computation.