Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location

  • Yvonne Bleischwitz
  • Florian Schoppmann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4997)

Abstract

In the context of general demand cost sharing, we present the first group-strategyproof mechanisms for the metric fault tolerant uncapacitated facility location problem. They are \((3 \ensuremath{L})\)-budget-balanced and \((3 \ensuremath{L} \cdot (1 + \mathcal H_n))\)-efficient, where \(\ensuremath{L}\) is the maximum service level and n is the number of agents. These mechanisms generalize the seminal Moulin mechanisms for binary demand. We also apply this approach to the generalized Steiner problem in networks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AKR95]
    Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized steiner problem in networks. SIAM Journal on Computing 24(3), 445–456 (1995)CrossRefMATHGoogle Scholar
  2. [CRS06]
    Chawla, S., Roughgarden, T., Sundararajan, M.: Optimal cost-sharing mechanisms for Steiner forest problems. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 112–123. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. [DMV05]
    Devanur, N.R., Mihail, M., Vazirani, V.V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Support Systems 39(1), 11–22 (2005)CrossRefGoogle Scholar
  4. [GB93]
    Goemans, M., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Mathematical Programming 60, 145–166 (1993)MathSciNetCrossRefMATHGoogle Scholar
  5. [IMM05]
    Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of cross-monotonic cost sharing schemes. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 602–611 (2005)Google Scholar
  6. [Jai01]
    Jain, K.: A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica 21(1), 39–60 (2001)MathSciNetCrossRefMATHGoogle Scholar
  7. [JV01]
    Jain, K., Vazirani, V.: Applications of approximate algorithms to cooperative games. In: Proceedings of the 33th Annual ACM Symposium on Theory of Computing, pp. 364–372 (2001)Google Scholar
  8. [KLS05]
    Könemann, J., Leonardi, S., Schäfer, G.: A group-strategyproof mechanism for Steiner forests. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 612–619 (2005)Google Scholar
  9. [Mou99]
    Moulin, H.: Incremental cost sharing: Characterization by coalition strategy-proofness. Social Choice and Welfare 16(2), 279–320 (1999)MathSciNetCrossRefMATHGoogle Scholar
  10. [MRS07]
    Mehta, A., Roughgarden, T., Sundararajan, M.: Beyond Moulin mechanisms. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 1–10 (2007), http://theory.stanford.edu/~tim/papers/bmm.pdf
  11. [MS01]
    Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theory 18, 511–533 (2001)MathSciNetCrossRefMATHGoogle Scholar
  12. [PT03]
    Pál, M., Tardos, É.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 584–593 (2003)Google Scholar
  13. [RS06]
    Roughgarden, T., Sundararajan, M.: New trade-offs in cost-sharing mechanisms. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 79–88 (2006)Google Scholar
  14. [RS07]
    Roughgarden, T., Sundararajan, M.: Optimal efficiency guarantees for network design mechanisms. In: Proceedings of the 12th Conference on Integer Programming and Combinatorial Optimization, pp. 469–483 (2007)Google Scholar
  15. [SSL03]
    Shmoys, D.B., Swamy, C., Levi, R.: Fault-tolerant facility location. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 735–736 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Yvonne Bleischwitz
    • 1
  • Florian Schoppmann
    • 1
    • 2
  1. 1.Faculty of Computer Science, Electrical Engineering and MathematicsUniversity of PaderbornPaderbornGermany
  2. 2.International Graduate School of Dynamic Intelligent SystemsGermany

Personalised recommendations