Group strategyproof mechanisms via primal-dual algorithms

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 584-593

  Pál, Martin ^a   Tardos, Éva ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GAME THEORY; SET THEORY; THEOREM PROVING; ALGORITHMS; BUDGET CONTROL; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COST EFFECTIVENESS; DESIGN; ELECTRONIC TRADING; TURNING;

GROUP STRATEGYPROOF MECHANISM; PRIMAL DUAL ALGORITHMS;

ALGORITHMS; COSTS;

COST SHARING MECHANISM; COST-SHARING METHODS; DESIGN METHODOLOGY; FACILITY LOCATION GAMES; FACILITY LOCATIONS; IP NETWORKS; PRIMAL DUAL ALGORITHMS; STRATEGY PROOFS;

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

References (33)

1. E. Anshelevich, A. Dasgupta, É. Tardos, and T. Wexler. Near-Optimal Network Design with Selfish Agents. 35th ACM STOC, 2003.
2. A. Archer, R. Rajagopalan, D.B. Shmoys. Lagrangian relaxation for the k-median problem: new insights and continuity properties. 11th European Symposium on Algorithms, 2003.
3. A. Agrawal, P. Klein, R. Ravi. When Trees Collide: An approximation algorithm for the generalized Steiner Tree problem on networks. SIAM Journal on Computing, 24(3):440-456, 1995.
4. V. Bala and S. Goyal. A Non-Cooperative Model of Network Formation. In Econometrica 68 (2000), 1181-1229.
5. M.L. Balinski. On finding integer solutions to linear programs. Proc. IBM Scientific Computing Symp. on Combinatorial Problems, 225-248. IBM, 1966.
6. O. N. Bondareva. Some applications of linear programming to cooperative games. Problemy Kibernetiki, 10:119-139, 1963.
7. P. Chardaire. On the core of facility location games. Unpublished manuscript available from http://www.sys.uea.ac.uk/people/pc/.
8. N. Devanur, M. Mihail and V.V. Vazirani. Strategy proof cost-sharing Mechanisms for Set Cover and Facility Location Games. ACM Conference on Electronic Commerce, 2003.
9. N. Devanur, C. Papadimitriou, A. Saberi, V. Vazirani. Market Equilibrium via a Primal-Dual-Type Algorithm. 43rd IEEE FOCS, 2002.
10. J. Feigenbaum, C. H. Papadimitriou, S. Shenker. Sharing the cost of multicast transactions 32nd ACM STOC, 2000, pp. 218-227.
11. A. Fabrikant, A. Luthra, E. Maneva, C. Papadimitriou, and S. Shenker. On a Network Creation Game. Unpublished manuscript.
12. U. Faigle, S.P. Fekete, W. Hochstättler, W. Kern. On approximately fair cost allocation for the Euclidean Traveling Salesman Problem. OR Spektrum 20, 1998, pp. 29-37.
13. N. Garg, R. Khandekar, G. Konjevod, R. Ravi, F.S. Salman, A. Sinha. On the Integrality Gap of a Natural Formulation of the Single-Source Buy-at-Bulk Network Design Problem. Lecture Notes in Computer Science, vol. 2081, 2000.
14. Michel X. Goemans and Martin Skutella. Cooperative Facility Location Games. 11th Symposium on Discrete Algorithms, 2000, pp 76-85.
15. Michel X. Goemans and David Williamson. A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing, 24, 1995, pp 296-317.
16. S. Guha, A. Meyerson, K. Munagala. Hierarchical Placement and Network Design Problems 41st IEEE FOCS, 2000.
17. S. Guha, A. Meyerson, K. Munagala. A Constant Factor Approximation for the Single Source Edge Installation Problem. 33rd ACM STOC, 2001, pp 383-388.
18. Anupam Gupta, Amit Kumar, Tim Roughgarden. Simpler and Better Approximation Algorithms for Network Design. 35th ACM STOC, 2003.
19. Anupam Gupta, Aravind Srinivasan, E. Tardos. Cost-Sharing Mechanisms. Unpublished manuscript, June 2003.
20. H. Heller and S. Sarangi. Nash Networks with Heterogeneous Agents. Working Paper Series 2001, E-2001-1, Virginia Tech.
21. Kamal Jain, Vijay V. Vazirani. Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. Journal of the ACM, 48:274-296, 2001.
22. Kamal Jain, Vijay V. Vazirani. Applications of Approximation Algorithms to Cooperative Games. 33rd ACM STOC, 2001, pp 364-372.
23. Kamal Jain, Vijay V. Vazirani. Equitable Cost Allocation via Primal-Dual Type Algorithms. 34th ACM STOC, 2002.
24. D. Karger and M. Minkoff. Building Steiner trees with incomplete global knowledge. 41st IEEE FOCS, 2000.
25. K. Kent, D. Skorin-Kapov. Population monotonic cost allocation on mst's. Operational Research Proceedings KOI, 1996, pp 43-48.
26. Amit Kumar, Anupam Gupta, Tim Roughgarden. A Constant Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. 43rd IEEE FOCS, 2002.
27. M. Mahdian, Y. Ye, J. Zhang Improved Approximation Algorithms for Metric Facility Location Problems. APPROX 2002.
28. R. R. Mettu, C. G. Plaxton. The online median problem. 41st IEEE FOCS, pp 339-348, 2000.
29. H. Moulin. Cooperative Microeconomics: A Game-Theoretic Introduction. Princeton University Press, 1995.
30. H. Moulin, S. Shenker. Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theory 18, pp. 511-533, 2001.
31. R. Ravi, F.S. Salman. Approximation Algorithms for the Traveling Purchaser Problem and its variants in network design. European Symposium on Algorithms, 1999.
32. L.S. Shapley. On balanced sets and cores. Naval Research Logistics Quaterly, 14:453-460.
33. Chaitanya Swamy, Amit Kumar. Primal-dual Algorithms for Connected Facility Location Problems. APPROX 2002.