A New Mechanism for the Free-Rider Problem

The free-rider problem arises in the provisioning of public resources, when users of the resource have to contribute towards the cost of production. Selfish users may have a tendency to misrepresent preferences-so as to reduce individual contributions-leading to inefficient levels of production of the resource. Groves and Loeb formulated a classic model capturing this problem, and proposed (what later came to be known as) the VCG mechanism as a solution. However, in the presence of heterogeneous users and communication constraints, or in decentralized settings, implementing this mechanism places an unrealistic communication burden. In this paper, we propose a class of alternative mechanisms for the same problem as considered by Groves and Loeb, but with the added constraint of severely limited communication between users and the provisioning authority. When these mechanisms are used, efficient production is ensured as a Nash equilibrium outcome, for a broad class of users. Furthermore, a natural bid update strategy is shown to globally converge to efficient Nash equilibria. Also, upper bounds are provided for the revenue that can be generated by any individually rational mechanism that ensures efficient production at any Nash equilibrium. It is shown that there exist mechanisms in our class that achieve each of the bounds. An extension to multiple public goods with interrelated valuations is also presented.

[1]  R.T. Maheswaran,et al.  Social welfare of selfish agents: motivating efficiency for divisible resources , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[2]  B. Hajek,et al.  Optimal allocation of a divisible good to strategic buyers , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[3]  T. Groves,et al.  Optimal Allocation of Public Goods: A Solution to the 'Free Rider Problem' , 1977 .

[4]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[5]  Jerry R. Green,et al.  Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods , 1977 .

[6]  Lawrence M. Ausubel,et al.  The Clock-Proxy Auction: A Practical Combinatorial Auction Design , 2004 .

[7]  J. Goodman Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

[8]  Mark A Walker,et al.  A Simple Incentive Compatible Scheme for Attaining Lindahl Allocations , 1981 .

[9]  Noam Nisan,et al.  Auctions with severely bounded communication , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[10]  John N. Tsitsiklis,et al.  Efficiency loss in a network resource allocation game: the case of elastic supply , 2004, IEEE Transactions on Automatic Control.

[11]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[12]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[13]  David C. Parkes,et al.  iBundle: an efficient ascending price bundle auction , 1999, EC '99.

[14]  Martin P. Loeb,et al.  INCENTIVES AND PUBLIC INPUTS , 1975 .