Secret Correlation in Repeated Games with Imperfect Monitoring
Download full text from publisherTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Other versions of this item:
- Olivier Gossner & Tristan Tomala, 2007. "Secret Correlation in Repeated Games with Imperfect Monitoring," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 413-424, May.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Deb, Joyee & González-Díaz, Julio & Renault, Jérôme, 2016. "Uniform folk theorems in repeated anonymous random matching games," Games and Economic Behavior, Elsevier, vol. 100(C), pages 1-23.
- Gossner, Olivier & Hörner, Johannes, 2010.
"When is the lowest equilibrium payoff in a repeated game equal to the minmax payoff?,"
Journal of Economic Theory,
Elsevier, vol. 145(1), pages 63-84, January.
- Olivier Gossner & Johannes Hörner, 2010. "When is the lowest equilibrium payoff in a repeated game equal to the minmax payoff?," Post-Print halshs-00754488, HAL.
- Jérôme Renault & Tristan Tomala, 2011. "General Properties of Long-Run Supergames," Dynamic Games and Applications, Springer, vol. 1(2), pages 319-350, June.
- repec:spr:jogath:v:46:y:2017:i:4:d:10.1007_s00182-017-0569-7 is not listed on IDEAS
- Cingiz, Kutay & Flesch, Janos & Herings, P. Jean-Jacques & Predtetchinski, Arkadi, 2016. "Perfect Information Games where Each Player Acts Only Once," Research Memorandum 036, Maastricht University, Graduate School of Business and Economics (GSBE).
- Ron Peretz, 2011. "Correlation through Bounded Recall Strategies," Discussion Paper Series dp579, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Joyee Deb & Julio González Díaz & Jérôme Renault, 2013. "Uniform Folk Theorems in Repeated Anonymous Random Matching Games," Working Papers 13-16, New York University, Leonard N. Stern School of Business, Department of Economics.
- Olivier Gossner & Penélope Hernández & Ron Peretz, 2016. "The complexity of interacting automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(1), pages 461-496, March.
- Ron Peretz, 2013. "Correlation through bounded recall strategies," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 867-890, November.
- Bavly, Gilad & Neyman, Abraham, 2014.
"Online concealed correlation and bounded rationality,"
Games and Economic Behavior,
Elsevier, vol. 88(C), pages 71-89.
- Gilad Bavly & Abraham Neyman, 2014. "Online Concealed Correlation and Bounded Rationality," Discussion Paper Series dp659, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
More about this item
Keywordsstochastic process; min-max values; signals; entropy; repeated games; secret correlation;
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:hal:journl:hal-00487954. 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: (CCSD). General contact details of provider: https://hal.archives-ouvertes.fr/ .
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.
We have no references for this item. You can help adding them by using 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.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.