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 -budget-balanced and -efficient, where 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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Bleischwitz, Y., & Schoppmann, F. (2008). Group-strategyproof cost sharing for metric fault tolerant facility location. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4997 LNCS, pp. 350–361). https://doi.org/10.1007/978-3-540-79309-0_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
