Unpredictability of complex (pure) strategies
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Tai-Wei Hu, 2013. "Expected utility theory from the frequentist perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(1), pages 9-25, May.
- Prasad, Kislaya, 2009. "The rationality/computability trade-off in finite games," Journal of Economic Behavior & Organization, Elsevier, vol. 69(1), pages 17-26, January.
- Anderlini, Luca & Sabourian, Hamid, 1995. "Cooperation and Effective Computability," Econometrica, Econometric Society, vol. 63(6), pages 1337-1369, November.
- Aumann, Robert J., 1997. "Rationality and Bounded Rationality," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 2-14, October.
- Hu, Tai Wei & Shmaya, Eran, 2013. "Expressible inspections," Theoretical Economics, Econometric Society, vol. 8(2), May.
- Gossner, Olivier & Vieille, Nicolas, 2002.
"How to play with a biased coin?,"
Games and Economic Behavior,
Elsevier, vol. 41(2), pages 206-226, November.
- Gossner, O. & Vieille, N., 1999. "How to play with a biased coin?," Papers 99-31, Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor..
- O. Gossner & N. Vieille, 1999. "How to play with a biased coin ?," THEMA Working Papers 99-31, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- Olivier Gossner & Nicolas Vieille, 2002. "How to play with a biased coin?," Post-Print hal-00464984, HAL.
- Ignacio Palacios-Huerta, 2003. "Professionals Play Minimax," Review of Economic Studies, Oxford University Press, vol. 70(2), pages 395-415.
- Mark Walker & John Wooders, 2001. "Minimax Play at Wimbledon," American Economic Review, American Economic Association, vol. 91(5), pages 1521-1538, December.
- Neyman, Abraham & Okada, Daijiro, 1999. "Strategic Entropy and Complexity in Repeated Games," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 191-223, October.
- Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
- Neyman, Abraham & Okada, Daijiro, 2000. "Repeated Games with Bounded Entropy," Games and Economic Behavior, Elsevier, vol. 30(2), pages 228-247, February.
- Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
More about this item
KeywordsKolmogorov complexity; Objective probability; Frequency theory of probability; Mixed strategy; Zero-sum game; Algorithmic randomness;
- D01 - Microeconomics - - General - - - Microeconomic Behavior: Underlying Principles
- D80 - Microeconomics - - Information, Knowledge, and Uncertainty - - - General
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:eee:gamebe:v:88:y:2014:i:c:p:1-15. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .
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.