This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Strategic Entropy and Complexity in Repeated Games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Neyman, Abraham
Okada, Daijiro

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

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.

File URL: http://www.sciencedirect.com/science/article/B6WFW-45GMDYD-C/2/ec6bbf565d5705695e178c1784a345ed
File Format:
File Function:
Download Restriction: Full text for ScienceDirect subscribers only

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Publisher Info
Article provided by Elsevier in its journal Games and Economic Behavior.

Volume (Year): 29 (1999)
Issue (Month): 1-2 (October)
Pages: 191-223
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:eee:gamebe:v:29:y:1999:i:1-2:p:191-223

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836

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

Related research
Keywords:

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.)

  1. Amparo Urbano & Penélope Hernández, 2007. "Codification Schemes And Finite Automata," Working Papers. Serie AD 2006-28, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie). [Downloadable!]
  2. Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000002427, David K. Levine. [Downloadable!]
    Other versions:
  3. Olivier Gossner & Rida Laraki & Tristan Tomala, 2004. "Maxmin computation and optimal correlation in repeated games with signals," Working Papers hal-00242940_v1, HAL. [Downloadable!]
  4. Marco Battaglini & Stephen Coate, 2007. "A Dynamic Theory of Public Spending, Taxation and Debt," Discussion Papers 1441, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
    Other versions:
  5. Barlo, Mehmet & Carmona, Guilherme, 2007. "One - Memory in Repeated Games," FEUNL Working Paper Series wp500, Universidade Nova de Lisboa, Faculdade de Economia. [Downloadable!]
  6. Olivier Gossner & Jöhannes Horner, 2006. "When is the individually rational payoff in a repeated game equal to the minmax payoff?," Discussion Papers 1440, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
Statistics
Access and download statistics

Did you know? The RePEc project started in 1997. Its precursor, NetEc, dates back to 1993.

This page was last updated on 2009-12-30.


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.