On the Existence of a Locally Stable Dynamic Process With a Statically Minimal Message Space

This file is part of IDEAS, which uses RePEc data

On the Existence of a Locally Stable Dynamic Process With a Statically Minimal Message Space

Author Info

Kenneth R. Mount
Stanley Reiter

Additional information is available for the following registered author(s):

Stanley Reiter

Abstract

No abstract is available for this item.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

Publisher Info
Paper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 550.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Feb 1983
Date of revision:
Handle: RePEc:nwu:cmsems:550

Contact details of provider:
Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014
Phone: 847/491-3527
Fax: 847/491-2530
Email:
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC

Order Information:
Email:

For technical questions regarding this item, or to correct its listing, contact: (Fran Walker).

Related research
Keywords:

Other versions of this item:

Cited by:
(explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)

J. Jordan, 2009. "Communication complexity and stability of equilibria in economies and games," Review of Economic Design, Springer, vol. 13(1), pages 115-135, April. [Downloadable!] (restricted)
Kenneth R. Mount & Stanley Reiter, 1994. "A Lower Bound on Computational Complexity Given by Revelation Mechanisms," Discussion Papers 1085, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
Other versions:
- Kenneth R. Mount & Stanley Reiter, 1996. "A lower bound on computational complexity given by revelation mechanisms (*)," Economic Theory, Springer, vol. 7(2), pages 237-266.
- Mount, Kenneth R & Reiter, Stanley, 1996. "A Lower Bound on Computational Complexity Given by Revelation Mechanisms," Economic Theory, Springer, vol. 7(2), pages 237-66, February.
Leonid Hurwicz, 1994. "Economic design, adjustment processes, mechanisms, and institutions," Review of Economic Design, Springer, vol. 1(1), pages 1-14, December. [Downloadable!] (restricted)

Statistics

Access and download statistics

Did you know? IDEAS also covers the most complete directory of Economics departments and institutes, EDIRC.

This page was last updated on 2009-11-25.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.