TY - JOUR
T1 - A new mechanism for the free-rider problem
AU - Sanghavi, Sujay
AU - Hajek, Bruce
N1 - Funding Information:
Manuscript received October 12, 2005; revised September 6, 2006. Published August 27, 2008 (projected). Recommended by Associate Editor I. Paschalidis. This work was done while both authors were at the University of Illinois at Urbana-Champaign (UIUC, and was supported by Grants NSF ANI 99-80544 and ECS-0621416.
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
KW - Convex optimization
KW - Free-riders
KW - Game theory
KW - Public goods
UR - http://www.scopus.com/inward/record.url?scp=51749119695&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51749119695&partnerID=8YFLogxK
U2 - 10.1109/TAC.2008.923662
DO - 10.1109/TAC.2008.923662
M3 - Article
AN - SCOPUS:51749119695
SN - 0018-9286
VL - 53
SP - 1176
EP - 1183
JO - IEEE Transactions on Automatic Control
JF - IEEE Transactions on Automatic Control
IS - 5
ER -