The Power of Small Coalitions in Cost Sharing

  • Florian Schoppmann
Conference paper

DOI: 10.1007/978-3-540-92185-1_72

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5385)
Cite this paper as:
Schoppmann F. (2008) The Power of Small Coalitions in Cost Sharing. In: Papadimitriou C., Zhang S. (eds) Internet and Network Economics. WINE 2008. Lecture Notes in Computer Science, vol 5385. Springer, Berlin, Heidelberg

Abstract

In a cost-sharing problem, finitely many players have an unknown preference for some public excludable good (service), and the task is to determine which players to serve and how to distribute the incurred cost. Therefore, incentive-compatible mechanisms are sought that elicit truthful bids, charge prices that recover the cost, and are economically efficient in that they reasonably balance cost and valuations. A commonplace notion of incentive-compatibility in cost sharing is group-strategyproofness (GSP), meaning that not even coordinated deceit is profitable. However, GSP makes strong implications on players’ coordination abilities and is known to impose severe limitations on other goals in cost sharing. There is hence good reason to seek for a weaker axiom: In this work, we study the following question: Does relaxing GSP to resilience only against coalitions of bounded size yield a richer set of possible mechanisms? Surprisingly, the answer is essentially “no”: We prove that already a mechanism resilient to coalitions of size only two (“2-GSP”) is GSP, once we require that cost shares must only depend on the service allocation (and not directly on the bids). Moreover, we show that even without additional requirements, 2-GSP implies weak group-strategyproofness (WGSP). Consequently, our results give some justification that GSP may, after all, still be desirable in various scenarios. As another benefit, we believe that our characterizations will facilitate devising and understanding new GSP cost-sharing mechanisms. Finally, we relate our findings to other concepts of non-manipulability such as (outcome) non-bossiness [19] and weak utility non-bossiness [13].

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

  • 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