Efficient Cost-Sharing Mechanisms for Price-Collecting Problems

A. Gupta, J. Könemann, S. Leonardi, R. Ravi, G. Schäfer

Research output: Contribution to JournalArticleAcademicpeer-review


We consider the problem of designing efficient mechanisms to share the cost of providing some service to a set of self-interested customers. In this paper, we mainly focus on cost functions that are induced by prize-collecting optimization problems. Such cost functions arise naturally whenever customers can be served in two different ways: either by being part of a common service solution or by being served individually. One of our main contributions is a general lifting technique that allows us to extend the social cost approximation guarantee of a Moulin mechanism for the respective non-prize-collecting problem to its prize-collecting counterpart. Our lifting technique also suggests a generic design template to derive Moulin mechanisms for prize-collecting problems. The approach is particularly suited for cost-sharing methods that are based on primal-dual algorithms. We illustrate the applicability of our approach by deriving Moulin mechanisms for prize-collecting variants of submodular cost-sharing, facility location and Steiner forest problems. All our mechanisms are essentially best possible with respect to budget balance and social cost approximation guarantees. Finally, we show that the Moulin mechanism by Könemann et al. (SIAM J Comput 37(5):1319–1341, 2008) for the Steiner forest problem is (Formula Presented.)-approximate. Our approach adds a novel methodological contribution to existing techniques by showing that such a result can be proved by embedding the graph distances into random hierarchically separated trees.
Original languageEnglish
Pages (from-to)147-188
JournalMathematical Programming
Issue number1-2
Early online date15 Jan 2015
Publication statusPublished - 2015


Dive into the research topics of 'Efficient Cost-Sharing Mechanisms for Price-Collecting Problems'. Together they form a unique fingerprint.

Cite this