Premium
Equilibrium Selection and Stability for the Groves Ledyard Mechanism
Author(s) -
Page Scott E.,
Tassier Troy
Publication year - 2004
Publication title -
journal of public economic theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.809
H-Index - 32
eISSN - 1467-9779
pISSN - 1097-3923
DOI - 10.1111/j.1467-9779.2004.00168.x
Subject(s) - mathematical economics , stability (learning theory) , mechanism (biology) , boundary (topology) , economics , selection (genetic algorithm) , set (abstract data type) , mathematics , computer science , physics , mathematical analysis , quantum mechanics , machine learning , artificial intelligence , programming language
In their seminal paper Groves and Ledyard (1976) construct a balanced incentive compatible mechanism that solves the free rider problem. In subsequent research, Bergstrom, Simon, and Titus (1983) prove that there exist numerous asymmetric equilibria in addition to the symmetric equilibrium. In the present paper, we explicitly solve for the additional equilibria and use computational experiments to examine the structure and stability of the set of equilibria of the Groves Ledyard Mechanism. We find that all of the equilibria found by Berstrom, Simon, and Titus are unstable and that for a high level of the punishment parameter these equilibria do not exist. Further, we find that there exists an additional boundary equilibrium for each of the equilibria found by Bergstrom, Simon, and Titus. The boundary equilibria are all stable.