Beyond moulin mechanisms

EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce

Volumn , Issue , 2007, Pages 1-10

  Mehta, Aranyak ^a   Roughgarden, Tim ^b   Sundararajan, Mukund ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b Stanford University   (United States)

Author keywords

Cost sharing; Mechanism

Indexed keywords

BINARY DEMAND GAMES; COST SHARING; MOULIN MECHANISMS; PRIMAL DUAL ALGORITHMS;

ALGORITHMS; ECONOMIC ANALYSIS; PARAMETER ESTIMATION; PROBLEM SOLVING;

COST ACCOUNTING;

EID: 36448974550     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250910.1250912     Document Type: Conference Paper

References (28)

1. A. Agrawal, P. Klein, and R. Ravi, When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing, 24(3):440-456, 1995.
2. F. Chudak and D. B. Shmoys. Improved algorithms for the uncapacitated facilty location problem. SIAM Journal on Computing, 33(1):1-25, 25, 2003.
3. V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233-235, 1979.
4. V. Chvátal. Linear Programming. Freeman, 1983.
5. N. R. Devanur, M. Mihail, and V. V. Vazirani. Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Support Systems, pages 11-22, 2005.
6. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
7. J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker. Hardness results for multicast cost sharing. Theoretical Computer Science, 304:215-236, 2003.
8. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, 1995.
9. S. Guha, and S. Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31(1):228-248, 1999.
10. A. Gupta, J. Könemann, S. Leonardi, R. Ravi, and G. Schäfer. An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007.
11. A. Gupta, A. Kumar, M. Pal, and T. Roughgarden, Approximation via cost-sharing: A simple approximation algorithm for the multiconimodity rent-or-buy problem. In Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS), pages 606-615, 2003.
12. A. Gupta, A. Srinivasan, and É. Tardos. Cost-sharing mechanisms for network design. In Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 3122 of Lecture Notes in Computer Science, pages 139-150, 2004.
13. D. S. Hochbaum. Heuristics for the fixed cost median problem. Mathematical Programming, 22(2): 148-162, 1982.
14. N. Immorlica, M. Mahdian, and V. S. Mirrokni. Limitations of cross-monotonic cost-sharing schemes. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 602-611, 2005.
15. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM, 60(6):795-824, 2003.
16. K. Jain and V. Vazirani. Applications of approximation algorithms to cooperative games. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pages 364-372, 2001.
17. K. Jain and V. Vazirani. Equitable cost allocations via primal-dual-type algorithms. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing (STOC), pages 313-321, 2002.
18. 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(2):274-296, 2001.
19. J. Könemann, S. Leonardi, and G. Schäfer. A group-strategyproof mechanism for Steiner forests. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 612-619, 2005.
20. S. Leonardi and G. Schäfer. Cross-monotonic cost-sharing methods for connected facility location. Theoretical Computer Science, 326(1-3):431-442, 2004.
21. H. Moulin. Incremental cost sharing: Characterization by coalition strategy-proofness. Social Choice and Welfare, 16:279-320, 1999.
22. H. Moulin and S. Shenker. Strategyproof sharing of submodular costs: Budget balance versus efficiency. Economic Theory, 18:511-533, 2001.
23. M. Pal and E. Tardos. Group strategyproof mechanisms via primal-dual algorithms. In Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS), pages 584-593, 2003.
24. D. C. Parkes and L. H. Ungar. Iterative combinatorial auctions: Theory and practice. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI), pages 74-81, 2000.
25. T. Roughgarden and M. Sundararajan. New trade-offs in cost-sharing mechanisms. In Proceedings of the 38th Annual ACM Symposium on the Theory of Computing (STOC), pages 79-88, 2006.
26. T. Roughgarden and M. Sundararajan. Optimal efficiency guarantees for network design. In Proceedings of the 12th Conference on Integer Programming and Combinatorial, Optimization (IPCO), 2007.
27. D. B. Shmoys, É. Tardos, and K. Aardal. Approximation algorithm for facility location problems. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC), pages 265-274, 1997.
28. V. V. Vazirani. Approximation Algorithms. Springer, 2001.