Advanced Search
MyIDEAS: Login

Computer Testbeds: The Dynamics of Groves-Ledyard Mechanisms

Contents:

Author Info

  • John Ledyard
  • Jasmina Arifovic

Abstract

No abstract is available for this item.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. 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.
File URL: http://www.sfu.ca/~arifovic/jaled122302.pdf
Download Restriction: no

File URL: http://www.sfu.ca/~arifovic/jaledgrp.pdf
File Function: graphs
Download Restriction: no

Bibliographic Info

Paper provided by Society for Computational Economics in its series Computing in Economics and Finance 2003 with number 244.

as in new window
Length:
Date of creation: 01 Aug 2003
Date of revision:
Handle: RePEc:sce:scecf3:244

Contact details of provider:
Email:
Web page: http://comp-econ.org/
More information through EDIRC

Related research

Keywords: computer testbed; learning; experiments with human subjects; public goods;

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
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.:
as in new window
  1. Yan Chen & Fang-Fang Tang, 1998. "Learning and Incentive-Compatible Mechanisms for Public Goods Provision: An Experimental Study," Journal of Political Economy, University of Chicago Press, vol. 106(3), pages 633-662, June.
  2. McKelvey Richard D. & Palfrey Thomas R., 1995. "Quantal Response Equilibria for Normal Form Games," Games and Economic Behavior, Elsevier, vol. 10(1), pages 6-38, July.
  3. Theodore Groves & John Ledyard, 1976. "Optimal Allocation of Public Goods: A Solution to the 'Free Rider Problem'," Discussion Papers 144, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  4. Arifovic, Jasmina, 1994. "Genetic algorithm learning and the cobweb model," Journal of Economic Dynamics and Control, Elsevier, vol. 18(1), pages 3-28, January.
  5. Chen, Yan & Plott, Charles R., 1996. "The Groves-Ledyard mechanism: An experimental study of institutional design," Journal of Public Economics, Elsevier, vol. 59(3), pages 335-364, March.
  6. LeBaron, Blake, 2000. "Agent-based computational finance: Suggested readings and early research," Journal of Economic Dynamics and Control, Elsevier, vol. 24(5-7), pages 679-702, June.
  7. Marimon, Ramon & McGrattan, Ellen & Sargent, Thomas J., 1990. "Money as a medium of exchange in an economy with artificially intelligent agents," Journal of Economic Dynamics and Control, Elsevier, vol. 14(2), pages 329-373, May.
  8. Colin Camerer & Teck-Hua Ho, 1999. "Experience-weighted Attraction Learning in Normal Form Games," Econometrica, Econometric Society, vol. 67(4), pages 827-874, July.
  9. repec:cup:macdyn:v:4:y:2000:i:3:p:373-414 is not listed on IDEAS
  10. repec:fth:stanho:e-89-28 is not listed on IDEAS
  11. Arifovic, Jasmina, 2000. "Evolutionary Algorithms In Macroeconomic Models," Macroeconomic Dynamics, Cambridge University Press, vol. 4(03), pages 373-414, September.
  12. A. Roth & I. Er’ev, 2010. "Learning in Extensive Form Games: Experimental Data and Simple Dynamic Models in the Intermediate Run," Levine's Working Paper Archive 387, David K. Levine.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Marco Casari, 2004. "Can Genetic Algorithms Explain Experimental Anomalies?," Computational Economics, Society for Computational Economics, vol. 24(3), pages 257-275, March.
  2. Hailu, Atakelty & Schilizzi, Steven & Thoyer, Sophie, 2005. "Assessing the performance of auctions for the allocation of conservation contracts: Theoretical and computational approaches," 2005 Annual meeting, July 24-27, Providence, RI 19478, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).
  3. Michael Maschek, 2010. "Intelligent Mutation Rate Control in an Economic Application of Genetic Algorithms," Computational Economics, Society for Computational Economics, vol. 35(1), pages 25-49, January.
  4. Matt Van Essen, 2012. "Information complexity, punishment, and stability in two Nash efficient Lindahl mechanisms," Review of Economic Design, Springer, vol. 16(1), pages 15-40, March.
  5. Sylvie Geisendorf, 2011. "Internal selection and market selection in economic Genetic Algorithms," Journal of Evolutionary Economics, Springer, vol. 21(5), pages 817-841, December.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:sce:scecf3:244. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.