The k-level facility location game

Operations Research Letters

Volumn 34, Issue 4, 2006, Pages 421-426

  Xu, Dachuan ^a   Du, Donglei ^b  

^a BEIJING UNIVERSITY OF TECHNOLOGY   (China)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

Approximate cost recovery; Competitive; Cross monotonic; k level facility location game

Indexed keywords

APPROXIMATION THEORY; COST ACCOUNTING;

APPROXIMATE COST RECOVERY; COMPETITIVE; CROSS-MONOTONIC; K-LEVEL FACILITY LOCATION GAME;

GAME THEORY;

EID: 33646529843     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.06.002     Document Type: Article

References (11)

1. Aardal K.I., Chudak F.A., and Shmoys D.B. A 3-approximation algorithm for the k-level uncapacitated facility location problem. Inf. Process. Lett. 72 (1999) 161-167
2. A. Bumb, W. Kern, A simple dual ascent algorithm for the multilevel facility location problem, Proceedings of the Fourth International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Lecture Notes in Computer Science, vol. 2129, 2001, pp. 55-63.
3. A. Gupta, M. Pál, R. Ravi, A. Sinha, Boosted sampling: approximation algorithms for stochastic optimization, Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), 2004.
4. N. Immorlica, M. Mahdian, V.S. Mirrokni, Limitations of cross-moonotonic cost sharing schemes, Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 602-611.
5. Jain K., and Vazirani V.V. Primal-dual approximation algorithms for metric facility location and k-median problems. J. ACM 48 (2001) 274-296
6. M. Mahdian, Y. Ye, J. Zhang, Improved approximation algorithms for metric facility location problems, Fifth International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), Lecture Notes in Computer Science, vol. 2462, 2002, pp. 229-242.
7. R.R. Mettu, C.G. Plaxton, The online median problem, Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2000, pp. 339-348.
8. Moulin H., and Shenker S. Strategyproof sharing of submodular costs: budget balance versus efficiency. Econ. Theory 18 (2001) 511-533
9. M. Pál, E. Tardos, Group strategyproof mechanisms via primal-dual algorithms, Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2003, pp. 584-593.
10. Shmoys D.B., Tardos E., and Aardal K.I. Approximation algorithms for facility location problems. Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC) (1997) 265-274
11. Zhang J. Approximating the two-level facility location problem via a quasi-greedy approach. Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2004) 801-810