Cross-monotonic cost sharing methods for connected facility location games

Theoretical Computer Science

Volumn 326, Issue 1-3, 2004, Pages 431-442

  Leonardi, Stefano ^a   Schäfer, Guido ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Approximation algorithms; Connected facility location; Cost sharing mechanisms; Mechanism design

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COSTS; GAME THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHMS; CONNECTED FACILITY LOCATION; MECHANISM DESIGN;

COMPUTER SCIENCE;

EID: 5144219599     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.07.033     Document Type: Article

References (9)

1. N.R. Devanur, M. Mihail, V.V. Vazirani, Strategyproof cost-sharing mechanisms for set cover and facility location games, Proc. Fourth ACM Conf. on Electronic Commerce, 2003, pp. 108-114.
2. J. Edmonds, Optimum branchings, J. Res. Nat. Bur. Standards 71B (4) (1967) 233-240.
3. A. Gupta, A. Kumar, T. Roughgarden, Simpler and better approximation algorithms for network design, Proc. 35th Annual ACM Symp. on Theory of Computing, 2003, pp. 365-372.
4. A. Gupta, A. Srinivasan, É. Tardos, Cost-sharing mechanisms for network design, Proc. Seventh Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2004, to appear.
5. K. Jain, V.V. Vazirani, Applications of approximation algorithms to cooperative games, Proc. 33rd Annual ACM Symp. on Theory of Computing, 2001, 364-372.
6. H. Moulin, S. Shenker, Strategyproof sharing of submodular costs: budget balance versus efficiency, http://www.aciri.org/shenker/cost.ps, 1997.
7. M. Pál, É. Tardos, Group Strategyproof mechanisms via primal-dual algorithms, Proc. 44th Annual IEEE Symp. on Foundations of Computer Science, 2003, pp. 584-593.
8. C. Swamy, A. Kumar, Primal-dual algorithms for connected facility location problems, Proc. Fifth Internat. Workshop on Approximation Algorithms for Combinatorial Optimization, 2002, pp. 256-270.
9. V.V. Vazirani, Approximation Algorithms, Springer, Berlin, 2001.