Limitations of cross-monotonie cost sharing schemes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 602-611

  Immorlica, Nicole ^a   Mahdian, Mohammad ^a   Mirrokni, Vahab S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BUDGET CONTROL; COSTS; GAME THEORY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

BLACK BOX; COMBINATORIAL OPTIMIZATION GAMES; COST-SHARING SCHEMES; STEINER TREE GAMES;

COMBINATORIAL MATHEMATICS;

EID: 20744438644     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. O.N. Bondareva. Some applications of linear programming to cooperative games. Problemy Kibernetiki, 1963.
2. X. Deng, T. Ibaraki, and H. Nagamochi. Algorithms and complexity in combinatorial optimization games. In SODA, 1997.
3. N. Devanur, M. Mihail, and V. Vazirani. Strategyproof cost sharing mechanisms for set cover and facility location problems. Proceedings of ACM Conference on Electronic Commerce, 2003.
4. J. Feigenbaum, C. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmission. Journal of Computer and System Sciences, 63:21-41, 2001.
5. M. Goemans. Personal communication.
6. M.X. Goemans and M. Skutella. Cooperative facility location games. SODA, 2000.
7. J. Green, E. Kohlberg, and J. J. Laffont. Partial equilibrium approach to the free rider problem. Journal of Public Economics, 6:375-394, 1976.
8. K. Jain and V.V. Vazirani. Applications of approximation algorithms to cooperative games. Proceedings STOC, 2001.
9. K. Jain and V.V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM, 48:274-296, 2001.
10. K. Jain and V.V. Vazirani. Equitable cost allocations via primal-dual-type algorithms. Proceedings of STOC, 2002.
11. K. Kent and D. Skorin-Kapov. Population monotonic cost allocation on MST's. In Operational Reearch Proceedings KOI, pages 43-48, 1996.
12. J. Koenemann, S. Leonardi, and G. Schaefer. A group-strategyproof mechanism for steiner forests. In Proceedings of SODA, 2005.
13. H. Moulin. Axioms of cooperative decision making, volume 1, chapter Cost sharing games and the core. Cambridge University Press, 1988.
14. H. Moulin and S. Shenker. Strategyproof sharing of submodular costs: budget balance versus efficiency, to appear in Economic Theory, 1997.
15. Hervé Moulin. Incremental cost sharing: Characterization by coalition strategy-proofness. Social Choice and Welfare, 16:279-320, 1999.
16. M. Pál and E. Tardos. Strategy proof mechanisms via primal-dual algorithms. FOCS'03, 2003.
17. K. Roberts. The characterization of implementable choice rules. In J.J. Laffont, editor, Aggregation and Revelation of Preferences. Studies in Public Economics, Amsterdam, North Holland, 1979.
18. Lloyd S.Shapley. On balanced sets and cores. Naval Research Logistics Quarterly, 14:453-460, 1967.