IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v9y2019i4d10.1007_s13235-018-00293-w.html
   My bibliography  Save this article

Zero-Sum Stochastic Games over the Field of Real Algebraic Numbers

Author

Listed:
  • K. Avrachenkov

    (Inria Sophia Antipolis)

  • V. Ejov

    (Flinders University of South Australia
    MSU)

  • J. A. Filar

    (The University of Queensland)

  • A. Moghaddam

    (The University of Queensland)

Abstract

We consider a finite state, finite action, zero-sum stochastic games with data defining the game lying in the ordered field of real algebraic numbers. In both the discounted and the limiting average versions of these games, we prove that the value vector also lies in the same field of real algebraic numbers. Our method supplies finite construction of univariate polynomials whose roots contain these value vectors. In the case where the data of the game are rational, the method also provides a way of checking whether the entries of the value vectors are also rational.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:dyngam:v:9:y:2019:i:4:d:10.1007_s13235-018-00293-w
    DOI: 10.1007/s13235-018-00293-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-018-00293-w
    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/s13235-018-00293-w?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. Jean-François Mertens & Shmuel Zamir, 1981. "Incomplete Information Games with Transcendental Values," Mathematics of Operations Research, INFORMS, vol. 6(2), pages 313-318, May.
    2. Truman Bewley & Elon Kohlberg, 1976. "The Asymptotic Theory of Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 1(3), pages 197-208, August.
    3. Raghavan, T.E.S. & Tijs, S.H. & Vrieze, O.J., 1985. "On stochastic games with additive reward and transition structure," Other publications TiSEM 28f85a14-9a6e-4ed8-9a4b-a, Tilburg University, School of Economics and Management.
    4. Matthew J. Sobel, 1981. "Myopic Solutions of Markov Decision Processes and Stochastic Games," Operations Research, INFORMS, vol. 29(5), pages 995-1009, October.
    5. 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)

    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. 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.
    2. Eilon Solan, 2003. "Continuity of the Value of Competitive Markov Decision Processes," Journal of Theoretical Probability, Springer, vol. 16(4), pages 831-845, October.
    3. Yan, Xiaoming & Chao, Xiuli & Lu, Ye, 2024. "Optimal control policies for dynamic inventory systems with service level dependent demand," European Journal of Operational Research, Elsevier, vol. 314(3), pages 935-949.
    4. Flesch, J. & Thuijsman, F. & Vrieze, O.J., 2007. "Stochastic games with additive transitions," European Journal of Operational Research, Elsevier, vol. 179(2), pages 483-497, June.
    5. Torpong Cheevaprawatdomrong & Robert L. Smith, 2004. "Infinite Horizon Production Scheduling in Time-Varying Systems Under Stochastic Demand," Operations Research, INFORMS, vol. 52(1), pages 105-115, February.
    6. Fabien Gensbittel & Marcin Peski & Jérôme Renault, 2021. "Value-Based Distance Between Information Structures," Working Papers hal-01869139, HAL.
    7. Jérôme Renault & Xavier Venel, 2017. "Long-Term Values in Markov Decision Processes and Repeated Games, and a New Distance for Probability Spaces," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 349-376, May.
    8. Eilon Solan, 2018. "The modified stochastic game," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(4), pages 1287-1327, November.
    9. Bruno Ziliotto, 2016. "A Tauberian Theorem for Nonexpansive Operators and Applications to Zero-Sum Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1522-1534, November.
    10. Boxiao Chen & Xiuli Chao & Cong Shi, 2021. "Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 726-756, May.
    11. Hörner, Johannes & Takahashi, Satoru, 2016. "How fast do equilibrium payoff sets converge in repeated games?," Journal of Economic Theory, Elsevier, vol. 165(C), pages 332-359.
    12. Aumann, Robert J., 2003. "Presidential address," Games and Economic Behavior, Elsevier, vol. 45(1), pages 2-14, October.
    13. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
    14. Laraki, Rida & Renault, Jérôme, 2017. "Acyclic Gambling Games," TSE Working Papers 17-768, Toulouse School of Economics (TSE).
    15. Levy, Yehuda John, 2022. "Uniformly supported approximate equilibria in families of games," Journal of Mathematical Economics, Elsevier, vol. 98(C).
    16. Levy, Yehuda, 2012. "Stochastic games with information lag," Games and Economic Behavior, Elsevier, vol. 74(1), pages 243-256.
    17. Panda, Saunak Kumar & Xiang, Yisha & Liu, Ruiqi, 2024. "Dynamic resource matching in manufacturing using deep reinforcement learning," European Journal of Operational Research, Elsevier, vol. 318(2), pages 408-423.
    18. Mabel M. TIDBALL & Eitan ALTMAN, 1994. "Approximations In Dynamic Zero-Sum Games," Game Theory and Information 9401001, University Library of Munich, Germany.
    19. Solan, Eilon & Vieille, Nicolas, 2002. "Correlated Equilibrium in Stochastic Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 362-399, February.
    20. Matthew J. Sobel & Wei Wei, 2010. "Myopic Solutions of Homogeneous Sequential Decision Processes," Operations Research, INFORMS, vol. 58(4-part-2), pages 1235-1246, August.

    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:dyngam:v:9:y:2019:i:4:d:10.1007_s13235-018-00293-w. 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.