Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 1980 | Published
Journal Article Open

The existence of efficient and incentive compatible equilibria with public goods

Abstract

In our previous paper, "Optimal Allocation of Public Goods...," (1977) we presented a mechanism for determining efficient public goods allocations when preferences are unknown and consumers are free to misrepresent their demands for public goods. We proved the basic welfare theorem for this model: If consumers are competitive in markets for private goods and follow Nash behavior in their choice of demands to report to the mechanism, then equilibria will be Pareto optimal. In this paper we show this result is not vacuous by proving that an equilibria will be Pareto optimal. In this paper we show this result is not vacuous by proving that an equilibrium will exist for a wide class of economies. Our conditions are slightly stronger than those required to prove the existence of a Lindahl equilibrium. In order to rule out the possibility of bankruptcy, we assume additionally that at all Pareto optimal allocations, private goods consumption is bounded away from zero.

Additional Information

© 1980 The Econometric Society. This paper is a revision of reference [16] in our earlier paper, Groves and Ledyard (1977). We gratefully acknowledge support by National Science Foundation Grants SOC775-21820 and SOC76-20953 and a Fairchild Foundation Grant at California Institute of Technology where Ledyard was a Fairchild Scholar. We also would like to thank the referees and Michael Rothschild whose notes (1976) and comments prompted us to complete this work. All errors are, of course, our own. Formerly SSWP 203.

Attached Files

Published - sswp203_-_published.pdf

Files

sswp203_-_published.pdf
Files (585.5 kB)
Name Size Download all
md5:536439bd2805cc662d1f4e15ea8efe4a
585.5 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023