IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v149y2011i3d10.1007_s10957-011-9797-3.html
   My bibliography  Save this article

Approachability of Convex Sets in Games with Partial Monitoring

Author

Listed:
  • Vianney Perchet

    (Université Pierre et Marie Curie
    École Normale Supérieure Cachan)

Abstract

We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ moves but receive random signals. This condition is an extension of Blackwell’s Criterion in the full monitoring framework, where players observe at least their payoffs. When our condition is fulfilled, we construct explicitly an approachability strategy, derived from a strategy satisfying some internal consistency property in an auxiliary game. We also provide an example of a convex set, that is neither (weakly)-approachable nor (weakly)-excludable, a situation that cannot occur in the full monitoring case. We finally apply our result to describe an ε-optimal strategy of the uninformed player in a zero-sum repeated game with incomplete information on one side.

Suggested Citation

  • Vianney Perchet, 2011. "Approachability of Convex Sets in Games with Partial Monitoring," Journal of Optimization Theory and Applications, Springer, vol. 149(3), pages 665-677, June.
  • Handle: RePEc:spr:joptap:v:149:y:2011:i:3:d:10.1007_s10957-011-9797-3
    DOI: 10.1007/s10957-011-9797-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-011-9797-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-011-9797-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. N. Vieille, 1992. "Weak Approachability," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 781-791, November.
    2. Ehud Lehrer & Eilon Solan, 2007. "Learning to play partially-specified equilibrium," Levine's Working Paper Archive 122247000000001436, David K. Levine.
    3. Foster, Dean P. & Vohra, Rakesh V., 1997. "Calibrated Learning and Correlated Equilibrium," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 40-55, October.
    4. Nicolas Vieille, 1992. "Weak Approachability," Post-Print hal-00481891, HAL.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
    2. Lagziel, David & Lehrer, Ehud, 2015. "Approachability with delayed information," Journal of Economic Theory, Elsevier, vol. 157(C), pages 425-444.
    3. Flesch, János & Laraki, Rida & Perchet, Vianney, 2018. "Approachability of convex sets in generalized quitting games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 411-431.
    4. Vianney Perchet & Marc Quincampoix, 2015. "On a Unified Framework for Approachability with Full or Partial Monitoring," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 596-610, March.
    5. Tristan Tomala, 2013. "Belief-Free Communication Equilibria in Repeated Games," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 617-637, November.

    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.
    1. Flesch, János & Laraki, Rida & Perchet, Vianney, 2018. "Approachability of convex sets in generalized quitting games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 411-431.
    2. Fournier, Gaëtan & Kuperwasser, Eden & Munk, Orin & Solan, Eilon & Weinbaum, Avishay, 2021. "Approachability with constraints," European Journal of Operational Research, Elsevier, vol. 292(2), pages 687-695.
    3. Joseph M. Abdou & Nikolaos Pnevmatikos, 2019. "Asymptotic Value in Frequency-Dependent Games with Separable Payoffs: A Differential Approach," Dynamic Games and Applications, Springer, vol. 9(2), pages 295-313, June.
    4. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    5. Pierre Cardaliaguet & Catherine Rainer & Dinah Rosenberg & Nicolas Vieille, 2016. "Markov Games with Frequent Actions and Incomplete Information—The Limit Case," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 49-71, February.
    6. Andrey Bernstein & Shie Mannor & Nahum Shimkin, 2014. "Opportunistic Approachability and Generalized No-Regret Problems," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1057-1083, November.
    7. Ehud Lehrer & Eilon Solan, 2016. "A General Internal Regret-Free Strategy," Dynamic Games and Applications, Springer, vol. 6(1), pages 112-138, March.
    8. 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.
    9. Rida Laraki, 2002. "Repeated Games with Lack of Information on One Side: The Dual Differential Approach," Mathematics of Operations Research, INFORMS, vol. 27(2), pages 419-440, May.
    10. Sylvain Sorin, 2018. "Limit Value of Dynamic Zero-Sum Games with Vanishing Stage Duration," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 51-63, February.
    11. Ehud Lehrer & Eilon Solan, 2006. "Excludability and Bounded Computational Capacity," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 637-648, August.
    12. Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October.
    13. Sergiu Hart & Andreu Mas-Colell, 2013. "Stochastic Uncoupled Dynamics And Nash Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 8, pages 165-189, World Scientific Publishing Co. Pte. Ltd..
    14. Fudenberg, Drew & Levine, David K., 1999. "Conditional Universal Consistency," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 104-130, October.
    15. Tom Johnston & Michael Savery & Alex Scott & Bassel Tarbush, 2023. "Game Connectivity and Adaptive Dynamics," Papers 2309.10609, arXiv.org, revised Oct 2024.
    16. Chiara Scarampi & Richard Fairchild & Luca Fumarco & Alberto Palermo & Neal Hinvest, 2021. "Social Metacognition: A Correlational Device for Strategic Interactions," Working Papers 2111, Tulane University, Department of Economics.
    17. Ehud Lehrer & Eilon Solan, 2007. "Learning to play partially-specified equilibrium," Levine's Working Paper Archive 122247000000001436, David K. Levine.
    18. Kalai, Ehud & Lehrer, Ehud & Smorodinsky, Rann, 1999. "Calibrated Forecasting and Merging," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 151-169, October.
    19. Michael Foley & Rory Smead & Patrick Forber & Christoph Riedl, 2021. "Avoiding the bullies: The resilience of cooperation among unequals," PLOS Computational Biology, Public Library of Science, vol. 17(4), pages 1-18, April.
    20. Karl Schlag & Andriy Zapechelnyuk, 2009. "Decision Making in Uncertain and Changing Environments," Discussion Papers 19, Kyiv School of Economics.

    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:spr:joptap:v:149:y:2011:i:3:d:10.1007_s10957-011-9797-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.