Some limitations of the groves-ledyard optimal mechanism

B-Tier
Journal: Public Choice
Year: 1977
Volume: 29
Issue: 2
Pages: 129-137

Authors (3)

Joseph Greenberg (McGill University) Robert Mackay (not in RePEc) Nicolaus Tideman (not in RePEc)

Score contribution per author:

0.670 = (α=2.01 / 3 authors) × 1.0x B-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

Abstract

The tax rule suggested by Groves and Ledyard is certainly an ingenious one, although there is no indication as to how one might fall upon that specific scheme. If offers Pareto optimal allocations, and in particular, budget balance,if each individual behaves competitively and faces the equilibrium messages of all other individuals. However, we question the relevance of Nash equilibrium to the Free-Rider Problem. When the Groves-Ledyard Optimal Mechanism is interpreted dynamically, so that it becomes a conceivable solution to the Free-Rider Problem, it has limitations that the demand-revealing process does not always share. On the other hand, the demand-revealing process does not achieve budget balance, so that, in general, neither mechanism dominates the other. Each has its limitations, and an ideal mechanism, by the Hurwicz Impossibility Theorem, is nonexistent. Copyright Center for Study of Public Choice Virginia Polytechnic Institute and State University 1977

Technical Details

RePEc Handle
repec:kap:pubcho:v:29:y:1977:i:2:p:129-137
Journal Field
Public
Author Count
3
Added to Database
2026-01-25