What automaton model captures decision making? A call for finding a behavioral taxonomy of complexity
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Ben-porath, Elchanan, 1990. "The complexity of computing a best response automaton in repeated games with mixed strategies," Games and Economic Behavior, Elsevier, vol. 2(1), pages 1-12, March.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Abraham Neyman, 1998. "Finitely Repeated Games with Finite Automata," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 513-552, August.
- Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
- Yuval Salant, 2011. "Procedural Analysis of Choice Rules with Applications to Bounded Rationality," American Economic Review, American Economic Association, vol. 101(2), pages 724-748, April.
- Gilboa, Itzhak, 1988.
"The complexity of computing best-response automata in repeated games,"
Journal of Economic Theory, Elsevier, vol. 45(2), pages 342-352, August.
- Itzhak Gilboa, 1988. "The Complexity of Computing Best-Response Automata in Repeated Games," Post-Print hal-00756286, HAL.
- Koller, Daphne & Megiddo, Nimrod, 1992. "The complexity of two-person zero-sum games in extensive form," Games and Economic Behavior, Elsevier, vol. 4(4), pages 528-552, October.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Compte, Olivier & Postlewaite, Andrew, 2015.
"Plausible cooperation,"
Games and Economic Behavior, Elsevier, vol. 91(C), pages 45-59.
- Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," Post-Print halshs-01204780, HAL.
- Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," PSE-Ecole d'économie de Paris (Postprint) halshs-01204780, HAL.
- Oliver Compte & Andrew Postlewaite, 2010. "Plausible Cooperation, Fourth Version," PIER Working Paper Archive 15-006, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 23 Jan 2015.
- Olivier Compte & Andrew Postlewaite, 2007.
"Effecting Cooperation,"
PIER Working Paper Archive
09-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 29 May 2009.
- Olivier Compte & Andrew Postlewaite, 2010. "Plausible Cooperation,Third Version," PIER Working Paper Archive 13-008, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 01 Dec 2012.
- Andrew Postlewaite & Olivier Compte, 2009. "Plausible Cooperation, Second Version," PIER Working Paper Archive 10-039, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 16 Dec 2010.
- Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
- Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Renault, Jérôme & Scarsini, Marco & Tomala, Tristan, 2008. "Playing off-line games with bounded rationality," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 207-223, September.
- Sung, Shao-Chin & Dimitrov, Dinko, 2010.
"Computational complexity in additive hedonic games,"
European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
- Sung, Shao Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Coalition Theory Network Working Papers 46655, Fondazione Eni Enrico Mattei (FEEM).
- Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
- Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
- Ho, Teck-Hua, 1996. "Finite automata play repeated prisoner's dilemma with information processing costs," Journal of Economic Dynamics and Control, Elsevier, vol. 20(1-3), pages 173-207.
- Beal, Sylvain & Querou, Nicolas, 2007.
"Bounded rationality and repeated network formation,"
Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
- Beal, Sylvain & Querou, Nicolas, 2006. "Bounded Rationality and Repeated Network Formation," Coalition Theory Network Working Papers 12169, Fondazione Eni Enrico Mattei (FEEM).
- Sylvain Béal & Nicolas Quérou, 2007. "Bounded rationality and repeated network formation," Post-Print ujm-00162449, HAL.
- Nicolas Querou & Sylvain Beal, 2006. "Bounded Rationality and Repeated Network Formation," Working Papers 2006.74, Fondazione Eni Enrico Mattei.
- Yuval Salant & Jörg L. Spenkuch, 2021. "Complexity and Choice," CESifo Working Paper Series 9239, CESifo.
- Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.
- Hernández, Penélope & Solan, Eilon, 2016.
"Bounded computational capacity equilibrium,"
Journal of Economic Theory, Elsevier, vol. 163(C), pages 342-364.
- Eilon Solan & Penélope Hernández, 2014. "Bounded Computational Capacity Equilibrium," Discussion Papers in Economic Behaviour 0314, University of Valencia, ERI-CES.
- Hernández, Penélope & Urbano, Amparo, 2008.
"Codification schemes and finite automata,"
Mathematical Social Sciences, Elsevier, vol. 56(3), pages 395-409, November.
- Amparo Urbano Salvador & Penélope Hernández Rojas, 2000. "Codification schemes and finite automata," Working Papers. Serie AD 2006-28, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Coralio Ballester & Penélope Hernández, 2010.
"Bounded Rationality,"
ThE Papers
10/10, Department of Economic Theory and Economic History of the University of Granada..
- Penelope Hernandez & Coralio Ballester, 2011. "Bounded Rationality," Discussion Papers in Economic Behaviour 0111, University of Valencia, ERI-CES.
- Wichardt, Philipp C., 2010. "Modelling equilibrium play as governed by analogy and limited foresight," Games and Economic Behavior, Elsevier, vol. 70(2), pages 472-487, November.
- Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).
- Aumann, Robert J., 1997. "Rationality and Bounded Rationality," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 2-14, October.
- Westhoff, Frank H. & Yarbrough, Beth V. & Yarbrough, Robert M., 1996. "Complexity, organization, and Stuart Kauffman's The Origins of Order," Journal of Economic Behavior & Organization, Elsevier, vol. 29(1), pages 1-25, January.
- Ignacio Palacios-Huerta & David C. Parkes & Richard Steinberg, 2024.
"Combinatorial Auctions in Practice,"
Journal of Economic Literature, American Economic Association, vol. 62(2), pages 517-553, June.
- Palacios-Huerta, Ignacio & Parkes, David C. & Steinberg, Richard, 2024. "Combinatorial auctions in practice," LSE Research Online Documents on Economics 124108, London School of Economics and Political Science, LSE Library.
- Muto, Nozomu, 2014. "Strategic complexity in repeated extensive games," Games and Economic Behavior, Elsevier, vol. 83(C), pages 45-52.
More about this item
NEP fields
This paper has been announced in the following NEP Reports:- NEP-CBE-2015-09-26 (Cognitive and Behavioural Economics)
- NEP-EVO-2015-09-26 (Evolutionary Economics)
- NEP-HME-2015-09-26 (Heterodox Microeconomics)
Statistics
Access and download statisticsCorrections
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:mag:wpaper:150010. See general information about how to correct material in RePEc.
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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Guido Henkel (email available below). General contact details of provider: https://edirc.repec.org/data/fwmagde.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.