Nothing Special   »   [go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/601.html
   My bibliography  Save this paper

'Big match' with lack of information on one side (part 1)

Author

Listed:
  • SORIN, Sylvain
Abstract
No abstract is available for this item.

Suggested Citation

  • SORIN, Sylvain, 1984. "'Big match' with lack of information on one side (part 1)," LIDAM Reprints CORE 601, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:601
    Note: In : International Journal of Game Theory, 13(4), 201-255, 1984
    as

    Download full text from publisher

    To 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:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sugaya, Takuo & Yamamoto, Yuichi, 2020. "Common learning and cooperation in repeated games," Theoretical Economics, Econometric Society, vol. 15(3), July.
    2. Vieille, Nicolas, 2002. "Stochastic games: Recent results," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 48, pages 1833-1850, Elsevier.
    3. Jérôme Renault, 2006. "The Value of Markov Chain Games with Lack of Information on One Side," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 490-512, August.
    4. VIEILLE, Nicolas & ROSENBERG, Dinah & SOLAN, Eilon, 2002. "Stochastic games with a single controller and incomplete information," HEC Research Papers Series 754, HEC Paris.
    5. Fudenberg, Drew & Yamamoto, Yuichi, 2011. "Learning from private information in noisy repeated games," Journal of Economic Theory, Elsevier, vol. 146(5), pages 1733-1769, September.
    6. Eilon Solan, 2005. "Subgame-Perfection in Quitting Games with Perfect Information and Differential Equations," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 51-72, February.
    7. Jérôme Renault, 2012. "The Value of Repeated Games with an Informed Controller," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 154-179, February.
    8. Yuichi Yamamoto, 2012. "Individual Learning and Cooperation in Noisy Repeated Games," PIER Working Paper Archive 12-044, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    9. Gonglin Yuan & Xiangrong Li, 2019. "A Numerical Algorithm for the Coupled PDEs Control Problem," Computational Economics, Springer;Society for Computational Economics, vol. 53(2), pages 697-707, February.
    10. Yuichi Yamamoto, 2013. "Individual Learning and Cooperation in Noisy Repeated Games," PIER Working Paper Archive 13-038, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    11. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," PSE-Ecole d'économie de Paris (Postprint) hal-01302553, HAL.
    12. Takuo Sugaya & Yuichi Yamamoto, 2019. "Common Learning and Cooperation in Repeated Games," PIER Working Paper Archive 19-008, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    13. Erim Kardeş & Fernando Ordóñez & Randolph W. Hall, 2011. "Discounted Robust Stochastic Games and an Application to Queueing Control," Operations Research, INFORMS, vol. 59(2), pages 365-382, April.
    14. M. K. Ghosh & D. McDonald & S. Sinha, 2004. "Zero-Sum Stochastic Games with Partial Information," Journal of Optimization Theory and Applications, Springer, vol. 121(1), pages 99-118, April.
    15. ,, 2015. "Unraveling in a repeated moral hazard model with multiple agents," Theoretical Economics, Econometric Society, vol. 10(1), January.
    16. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," Post-Print hal-01302553, HAL.
    17. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01302553, HAL.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:cor:louvrp:601. 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.

    We have no bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.