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

Acceptable strategy profiles in stochastic games

Author

Listed:
  • Solan, Eilon

Abstract

This paper presents a new solution concept for multiplayer stochastic games, namely, acceptable strategy profiles. For each player i and state s in a stochastic game, let wi(s) be a real number. A strategy profile is w-acceptable, where w=(wi(s)), if the discounted payoff to each player i at every initial state s is at least wi(s), provided the discount factor of the players is sufficiently close to 1. Our goal is to provide simple strategy profiles that are w-acceptable for payoff vectors w in which all coordinates are high.

Suggested Citation

  • Solan, Eilon, 2018. "Acceptable strategy profiles in stochastic games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 523-540.
  • Handle: RePEc:eee:gamebe:v:108:y:2018:i:c:p:523-540
    DOI: 10.1016/j.geb.2017.01.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825617300222
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.geb.2017.01.011?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. Krishnendu Chatterjee & Rupak Majumdar & Thomas Henzinger, 2008. "Stochastic limit-average games are in EXPTIME," International Journal of Game Theory, Springer;Game Theory Society, vol. 37(2), pages 219-234, June.
    2. VIEILLE, Nicolas & ROSENBERG, Dinah & SOLAN, Eilon, 2002. "Approximating a sequence of observations by a simple process," HEC Research Papers Series 756, HEC Paris.
    3. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    4. Solan, Eilon & Vieille, Nicolas, 2002. "Correlated Equilibrium in Stochastic Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 362-399, February.
    5. Neyman, Abraham, 2017. "Continuous-time stochastic games," Games and Economic Behavior, Elsevier, vol. 104(C), pages 92-130.
    6. Eilon Solan, 2001. "Characterization of correlated equilibria in stochastic games," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(2), pages 259-277.
    7. Flesch, J. & Schoenmakers, G.M. & Vrieze, K., 2008. "Stochastic games on a product state space: the periodic case," Research Memorandum 016, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    8. Shie Mannor & John N. Tsitsiklis, 2005. "On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies," Mathematics of Operations Research, INFORMS, vol. 30(3), pages 545-561, August.
    9. János Flesch & Gijs Schoenmakers & Koos Vrieze, 2009. "Stochastic games on a product state space: the periodic case," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(2), pages 263-289, June.
    10. repec:dau:papers:123456789/6019 is not listed on IDEAS
    11. János Flesch & Gijs Schoenmakers & Koos Vrieze, 2008. "Stochastic Games on a Product State Space," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 403-420, May.
    12. Eilon Solan, 1999. "Three-Player Absorbing Games," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 669-698, August.
    13. Keith W. Ross & Ravi Varadarajan, 1991. "Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 195-207, February.
    14. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
    15. Nicolas Vieille, 2000. "Two-player stochastic games I: A reduction," Post-Print hal-00481401, HAL.
    16. Robert Samuel Simon, 2012. "A Topological Approach to Quitting Games," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 180-195, February.
    17. Nicolas Vieille, 2000. "Two-player stochastic games II: The case of recursive games," Post-Print hal-00481416, 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. Eilon Solan, 2018. "The modified stochastic game," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(4), pages 1287-1327, 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, 2018. "The modified stochastic game," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(4), pages 1287-1327, November.
    2. Solan, Eilon & Solan, Omri N. & Solan, Ron, 2020. "Jointly controlled lotteries with biased coins," Games and Economic Behavior, Elsevier, vol. 119(C), pages 383-391.
    3. Xavier Venel, 2015. "Commutative Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 403-428, February.
    4. Robert Samuel Simon, 2012. "A Topological Approach to Quitting Games," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 180-195, February.
    5. Heller, Yuval & Solan, Eilon & Tomala, Tristan, 2012. "Communication, correlation and cheap-talk in games with public information," Games and Economic Behavior, Elsevier, vol. 74(1), pages 222-234.
    6. Eilon Solan & Nicolas Vieille, 2010. "Computing uniformly optimal strategies in two-player stochastic games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 237-253, January.
    7. J. Flesch & J. Kuipers & G. Schoenmakers & K. Vrieze, 2010. "Subgame Perfection in Positive Recursive Games with Perfect Information," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 193-207, February.
    8. János Flesch & Gijs Schoenmakers & Koos Vrieze, 2009. "Stochastic games on a product state space: the periodic case," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(2), pages 263-289, June.
    9. Eilon Solan & Nicholas Vieille, 2001. "Quitting Games - An Example," Discussion Papers 1314, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    10. Flesch, J. & Kuipers, J. & Schoenmakers, G. & Vrieze, K., 2008. "Subgame-perfection in stochastic games with perfect information and recursive payoffs," Research Memorandum 041, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    11. Ayala Mashiah-Yaakovi, 2015. "Correlated Equilibria in Stochastic Games with Borel Measurable Payoffs," Dynamic Games and Applications, Springer, vol. 5(1), pages 120-135, March.
    12. Eilon Solan & Omri N. Solan, 2021. "Sunspot equilibrium in positive recursive general quitting games," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(4), pages 891-909, December.
    13. Piotr Więcek & Eitan Altman, 2015. "Stationary Anonymous Sequential Games with Undiscounted Rewards," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 686-710, August.
    14. János Flesch & Gijs Schoenmakers & Koos Vrieze, 2008. "Stochastic Games on a Product State Space," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 403-420, May.
    15. Cheng, Jianqiang & Leung, Janny & Lisser, Abdel, 2016. "Random-payoff two-person zero-sum game with joint chance constraints," European Journal of Operational Research, Elsevier, vol. 252(1), pages 213-219.
    16. Jérôme Renault & Bruno Ziliotto, 2020. "Limit Equilibrium Payoffs in Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 889-895, August.
    17. David Baron & Ehud Kalai, 1990. "Dividing a Cake by Majority: The Simplest Equilibria," Discussion Papers 919, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    18. Siegfried Berninghaus & Hans Haller & Alexander Outkin, 2006. "Neural networks and contagion," Revue d'économie industrielle, De Boeck Université, vol. 0(2), pages 11-11.
    19. Gilboa Itzhak & Schmeidler David, 1994. "Infinite Histories and Steady Orbits in Repeated Games," Games and Economic Behavior, Elsevier, vol. 6(3), pages 370-399, May.
    20. Joshua M. Epstein, 2007. "Agent-Based Computational Models and Generative Social Science," Introductory Chapters, in: Generative Social Science Studies in Agent-Based Computational Modeling, Princeton University Press.

    More about this item

    Keywords

    Stochastic games; Acceptable strategy profiles; Automata;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games

    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:108:y:2018:i:c:p:523-540. 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.