On Nash Implementation of the Walrasian or Lindahl Correspondence in the Two-Agent Economy

Loading...
Thumbnail Image

View/Download File

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

On Nash Implementation of the Walrasian or Lindahl Correspondence in the Two-Agent Economy

Alternative title

Published Date

1987-09

Publisher

Center for Economic Research, Department of Economics, University of Minnesota

Type

Working Paper

Abstract

Various possibility and impossibility theorems are obtained concerning Nash implementation of the Walrasian or Lindahl correspondence in two-agent economies. The result is drastically different from the case with more than two agents. There is neither a continuous and balanced, nor a smooth and weakly balanced mechanism which implements either of these two correspondences. For both the Walrasian and Lindahl cases, however, there are mechanisms which implement the correspondence with properties which are either continuous and weakly balanced, or smooth but not weakly balanced.

Keywords

Description

Related to

Replaces

License

Series/Report Number

Discussion Paper
243

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Kwan, Y. and Nakamura, S., (1987), "On Nash Implementation of the Walrasian or Lindahl Correspondence in the Two-Agent Economy", Discussion Paper No. 243, Center for Economic Research, Department of Economics, University of Minnesota.

Other identifiers

Suggested citation

Kwan, Yum-Keung; Nakamura, Shinsuke. (1987). On Nash Implementation of the Walrasian or Lindahl Correspondence in the Two-Agent Economy. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/55521.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.