Modeling the Economic Interaction of Agents with Diverse Abilities to Recognize Equilibrium Patterns
We model differences among agents in their ability to recognise temporal patterns of prices. Using the concept of DeBruijin sequences in two dynamic models of markets, we demonstrate the existence of equilibria in which prices fluctuate in a pattern that is independent of the fundamentals and that can be recognised only by the more competent agents.
(This abstract was borrowed from another version of this item.)
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.:
- 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.
- 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.
- 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.
- Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
- Ben-Porath, E., 1991. "Repeated games with Finite Automata," Papers 7-91, Tel Aviv - the Sackler Institute of Economic Studies.
- Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
- Drew Fudenberg & Jean Tirole, 1991. "Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061414, July.
- 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.
- O. Gossner & P. Hernandez, 2001. "On the complexity of coordination," THEMA Working Papers 2001-21, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
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)
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.