IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00481891.html
   My bibliography  Save this paper

Weak Approachability

Author

Listed:
  • Nicolas Vieille

Abstract

In this paper, we study repeated games with vector payoffs. Following Blackwell [2], we define weak approachability and its dual property, weak excludability. We use results from differential games with fixed duration to prove that every set is either weakly approachable or weakly excludable.

Suggested Citation

  • Nicolas Vieille, 1992. "Weak Approachability," Post-Print hal-00481891, HAL.
    • Handle: RePEc:hal:journl:hal-00481891
    DOI: 10.1287/moor.17.4.781
    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.

    Citations

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


    Cited by:

    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Dario Bauso & Hamidou Tembine & Tamer Başar, 2016. "Robust Mean Field Games," Dynamic Games and Applications, Springer, vol. 6(3), pages 277-303, September.
    7. 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.
    8. Ehud Lehrer & Eilon Solan, 2006. "Excludability and Bounded Computational Capacity," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 637-648, August.
    9. 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.
    10. 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.
    11. 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.

    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:hal:journl:hal-00481891. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.