IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v15y2025i3d10.1007_s13235-024-00575-6.html
   My bibliography  Save this article

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games

Author

Listed:
  • Stefan Kiefer

    (University of Oxford)

  • Richard Mayr

    (University of Edinburgh)

  • Mahsa Shirmohammadi

    (Université Paris cité)

  • Patrick Totzke

    (University of Liverpool)

Abstract

We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of $$\varepsilon $$ ε -optimal (resp. optimal) strategies. These results depend on the size of the players’ action sets and on whether one requires strategies that are uniform (i.e., independent of the start state). Our main result is that $$\varepsilon $$ ε -optimal (resp. optimal) Maximizer strategies requires infinite memory if Minimizer is allowed infinite action sets. This lower bound holds even under very strong restrictions. Even in the special case of infinitely branching turn-based reachability games, even if all states allow an almost surely winning Maximizer strategy, strategies with a step counter plus finite private memory are still useless. Regarding uniformity, we show that for Maximizer there need not exist memoryless (i.e., positional) uniformly $$\varepsilon $$ ε -optimal strategies even in the special case of finite action sets or in finitely branching turn-based games. On the other hand, in games with finite action sets, there always exists a uniformly $$\varepsilon $$ ε -optimal Maximizer strategy that uses just one bit of public memory.

Suggested Citation

  • Stefan Kiefer & Richard Mayr & Mahsa Shirmohammadi & Patrick Totzke, 2025. "Strategy Complexity of Reachability in Countable Stochastic 2-Player Games," Dynamic Games and Applications, Springer, vol. 15(3), pages 980-1036, July.
  • Handle: RePEc:spr:dyngam:v:15:y:2025:i:3:d:10.1007_s13235-024-00575-6
    DOI: 10.1007/s13235-024-00575-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-024-00575-6
    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-024-00575-6?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.

    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:15:y:2025:i:3:d:10.1007_s13235-024-00575-6. 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: 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.