Skip to main content

Implementation with unknown endowments in a two-trader pure exchange economy

  • Chapter
Advances in Mathematical Economics

Part of the book series: Advances in Mathematical Economics ((MATHECON,volume 8))

  • 874 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dutta, B., Sen, A.: A necessary and sufficient condition for two-person Nash implementation. Review of Economic Studies 58, 121–128 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Hong, L., Page, S.: Reducing informational costs in endowment mechanisms. Economic Design 1, 103–117 (1994)

    Google Scholar 

  3. Hurwicz, L.: Balanced outcome functions yielding Walrasian and Lindahl allocations at Nash equilibrium points for two or more agents. In: General Equilibrium, Growth, and Trade, Essays in Honor of Lionel McKenzie (J.R. Green, J.A. Scheinkman eds.). pp. 125–137 Academic Press, New York 1979

    Google Scholar 

  4. Hurwicz, L.: Feasible balanced outcome functions yielding Walrasian and Lindahl allocations at Nash equilibrium points in economies with two agents when the designer knows the feasible set. mimeo, presented at the 1997 Penn State NSF/NBER Decentralization Conference (1996)

    Google Scholar 

  5. Hurwicz, L., Maskin, E., Postlewaite, A.: (abbr. HMP) Feasible Nash implementation of social choice rules when the designer does not know the endowments or production sets. In: The Economics of Informational Decentralization: Complexity, Efficiency, and Stability; Essays in Honor of Stanley Reiter (J. Ledyard ed.). Ch.14, pp.367–433 Kluwer Academic Publishers, Boston 1995

    Google Scholar 

  6. Maskin, E.: Implementation of two-person SCR’s: Pure exchange, known endowments unknown preferences. mimeo. (1979), Cited in Moore and Repullo (1990)

    Google Scholar 

  7. Mookherji, D., Reichelstein, S.: The revelation approach to Nash implementation. Economics Letters 39, 309–313 (1992)

    Article  MathSciNet  Google Scholar 

  8. Moore, J.: Implementation in environments with complete information. London School of Economics, Suntory-Toyota International Centre for Economics and Related Disciplines, Discussion Paper No.TE/91/235 (1991)

    Google Scholar 

  9. Moore, J., Repullo, R.: Nash implementation: Full characterization. Econometrica 58, 1083–1099 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Postlewaite, A.: Manipulation via endowments. Review of Economic Studies 46, 255–262 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  11. Sjöström, T.: On the necessary and sufficient conditions for Nash implementation. Social Choice and Welfare 8, 333–340 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag

About this chapter

Cite this chapter

Hurwicz, L. (2006). Implementation with unknown endowments in a two-trader pure exchange economy. In: Kusuoka, S., Yamazaki, A. (eds) Advances in Mathematical Economics. Advances in Mathematical Economics, vol 8. Springer, Tokyo. https://doi.org/10.1007/4-431-30899-7_10

Download citation

Publish with us

Policies and ethics