IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v56y2006i1p135-147.html
   My bibliography  Save this article

Approachable sets of vector payoffs in stochastic games

Author

Listed:
  • Milman, Emanuel

Abstract

No abstract is available for this item.

Suggested Citation

  • Milman, Emanuel, 2006. "Approachable sets of vector payoffs in stochastic games," Games and Economic Behavior, Elsevier, vol. 56(1), pages 135-147, July.
    • Handle: RePEc:eee:gamebe:v:56:y:2006:i:1:p:135-147
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899-8256(05)00078-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Emanuel Milman, 2002. "The Semi-Algebraic Theory of Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 27(2), pages 401-418, May.
    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. 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. 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. 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. Dileep Kalathil & Vivek S. Borkar & Rahul Jain, 2017. "Approachability in Stackelberg Stochastic Games with Vector Costs," Dynamic Games and Applications, Springer, vol. 7(3), pages 422-442, September.
    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.

    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. Eilon Solan, 2003. "Continuity of the Value of Competitive Markov Decision Processes," Journal of Theoretical Probability, Springer, vol. 16(4), pages 831-845, October.
    2. Jérôme Bolte & Stéphane Gaubert & Guillaume Vigeral, 2015. "Definable Zero-Sum Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 171-191, February.
    3. K. Avrachenkov & V. Ejov & J. A. Filar & A. Moghaddam, 2019. "Zero-Sum Stochastic Games over the Field of Real Algebraic Numbers," Dynamic Games and Applications, Springer, vol. 9(4), pages 1026-1041, December.

    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:eee:gamebe:v:56:y:2006:i:1:p:135-147. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.