New trade-offs in cost-sharing mechanisms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 79-88

  Roughgarden, Tim ^a   Sundararajan, Mukund ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Algorithms; Economics; Theory

Indexed keywords

ALGORITHMS; BUDGET CONTROL; COMPUTER SCIENCE; COSTS; ECONOMICS; GAME THEORY; NETWORK PROTOCOLS;

BUDGET-BALANCE; COST-SHARING MECHANISMS; PRICES; TRADE-OFFS;

COMPUTATION THEORY;

EID: 33748115782     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132528     Document Type: Conference Paper

References (21)

1. E. Anshelevich, A. Dasgupta, J. Kleinberg, É. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. In FOCS '04, pages 295-304.
2. A. Archer, J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker. Approximation and collusion in multicast cost sharing. Games and Economic Behavior, 47(1):36-71, 2004.
3. N. R. Devanur, M. Mihail, and V. V. Vazirani. Strategyproof cost-sharing mechanisms for set cover and facility location games. In EC '03, pages 108-114.
4. J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker. Hardness results for multicast cost sharing. Theoretical Computer Science, 304:215-236, 2003.
5. J. Feigenbaum, C. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. JCSS, 63(1):21-41, 2001.
6. J. Green, E. Kohlberg, and J. J. Laffont. Partial equilibrium approach to the free rider problem. Journal of Public Economics, 6:375-394, 1976.
7. A. Gupta, A. Srinivasan, and É. Tardos. Cost-sharing mechanisms for network design. In APPROX '04, pages 139-150.
8. S. Hart and A. Mas-Colell. Potential, value, and consistency. Econometrica, 57(3):589-614, 1989.
9. N. Immorlica, M. Mahdian, and V. S. Mirrokni. Limitations of cross-monotonic cost-sharing schemes. In SODA '05, pages 602-611.
10. K. Jain and V. Vazirani. Applications of approximation algorithms to cooperative games. In STOC '01, pages 364-372.
11. K. Jain and V. Vazirani. Equitable cost allocations via primal-dual-type algorithms. In STOC '02, pages 313-321.
12. K. Kent and D. Skorin-Kapov. Population monotonic cost allocation on mst's. In Operational Research Proceedings KOI, pages 43-48, 1996.
13. J. Könemann, S. Leonardi, and G. Schäfer. A group-strategyproof mechanism for Steiner forests. In SODA '05, pages 612-619.
14. J. Könemann, S. Leonard!, G. Schäfer, and S. van Zwam. From primal-dual to cost shares and back: A stronger LP relaxation for the steiner forest problem. In ICALP '05, pages 1051-1063.
15. S. Leonardi and G. Schäfer. Cross-monotonic cost-sharing methods for connected facility location. In EC '04, pages 242-243.
16. H. Moulin. Incremental cost sharing: Characterization by coalition strategy-proofness. Social Choice and Welfare, 16:279-320, 1999.
17. H. Moulin. Axiomatic cost and surplus sharing. In K. J. Arrow, A. K. Sen, and K. Suzumura, editors, Handbook of Social Choice and Welfare, volume 1, chapter 6, pages 289-357. North-Holland, 2002.
18. H. Moulin and S. Shenker. Strategyproof sharing of submodular costs: Budget balance versus efficiency. Economic Theory, 18:511-533, 2001.
19. M. Pál and É. Tardos. Group Strategyproof mechanisms via primal-dual algorithms. In FOCS '03, pages 584-593.
20. K. Roberts. The characterization of implementable choice rules. In J. J. Laffont, editor, Aggregation and Revelation of Preferences. North-Holland, 1979.
21. T. Roughgarden. Potential functions and the inefficiency of equilibria. In ICM '06. To appear.