Modeling the Economic Interaction of Agents with Diverse Abilities to Recognize Equilibrium Patterns
Download full text from publisher
Other versions of this item:
- Michele Piccione & Ariel Rubinstein, 2003. "Modeling the Economic Interaction of Agents With Diverse Abilities to Recognize Equilibrium Patterns," Journal of the European Economic Association, MIT Press, vol. 1(1), pages 212-223, March.
- Piccione, Michele & Rubinstein, Ariel, 2002. "Modelling the economic interaction of agents with diverse abilities to recognise equilibrium patterns," LSE Research Online Documents on Economics 2061, London School of Economics and Political Science, LSE Library.
- Michele Piccione & Ariel Rubinstein, 2002. "Modelling the Economic Interaction of Agents with Diverse Abilities to Recognise Equilibrium Patterns," STICERD - Theoretical Economics Paper Series 440, Suntory and Toyota International Centres for Economics and Related Disciplines, LSE.
References listed on IDEAS
- Drew Fudenberg & Jean Tirole, 1991. "Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061414, January.
- Gilboa Itzhak & Schmeidler David, 1994.
"Infinite Histories and Steady Orbits in Repeated Games,"
Games and Economic Behavior,
Elsevier, vol. 6(3), pages 370-399, May.
- Itzhak Gilboa & David Schmeidler, 1989. "Infinite Histories and Steady Orbits in Repeated Games," Discussion Papers 846, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Itzhak Gilboa & David Schmeidler, 1994. "Infinite Histories and Steady Orbits in Repeated Games," Post-Print hal-00481357, HAL.
- Rubinstein, Ariel, 1991. "Comments on the Interpretation of Game Theory," Econometrica, Econometric Society, vol. 59(4), pages 909-924, July.
- Sabourian, Hamid, 1998. "Repeated games with M-period bounded memory (pure strategies)," Journal of Mathematical Economics, Elsevier, vol. 30(1), pages 1-35, August.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Lehrer Ehud, 1994. "Finitely Many Players with Bounded Recall in Infinitely Repeated Games," Games and Economic Behavior, Elsevier, vol. 7(3), pages 390-405, November.
- GOSSNER, Olivier & HERNANDEZ, Pénélope, 2001. "On the complexity of coordination," CORE Discussion Papers 2001047, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
- Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
- Rubinstein, Ariel, 1993.
"On Price Recognition and Computational Complexity in a Monopolistic Model,"
Journal of Political Economy,
University of Chicago Press, vol. 101(3), pages 473-484, June.
- Rubenstein, A., 1991. "On Price Recognition and Computational Complexity in a Monopolistic Model," Papers 35-91, Tel Aviv.
More about this item
- D4 - Microeconomics - - Market Structure, Pricing, and Design
- C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
NEP fieldsThis paper has been announced in the following NEP Reports:
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cla:levarc:506439000000000108. 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: (David K. Levine). General contact details of provider: http://www.dklevine.com/ .
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 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 RePEc Author Service 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.