Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location

  • Yvonne Bleischwitz
  • Florian Schoppmann
Conference paper

DOI: 10.1007/978-3-540-79309-0_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4997)
Cite this paper as:
Bleischwitz Y., Schoppmann F. (2008) Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location. In: Monien B., Schroeder UP. (eds) Algorithmic Game Theory. SAGT 2008. Lecture Notes in Computer Science, vol 4997. Springer, Berlin, Heidelberg

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.

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 Systems 

Personalised recommendations