A Game of Pawns
Abstract: We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial vertex, and whoever controls the vertex on which the token is located, chooses its next location. This leads to a path in the graph, which determines the winner. Traditionally, the control of vertices is predetermined and fixed. The novelty of pawn games is that control of vertices changes dynamically throughout the game as follows. Each vertex of a pawn game is owned by a pawn. In each turn, the pawns are partitioned between the two players, and the player who controls the pawn that owns the vertex on which the token is located, chooses the next location of the token. Control of pawns changes dynamically throughout the game according to a fixed mechanism. Specifically, we define several grabbing-based mechanisms in which control of at most one pawn transfers at the end of each turn. We study the complexity of solving pawn games, where we focus on reachability objectives and parameterize the problem by the mechanism that is being used and by restrictions on pawn ownership of vertices. On the positive side, even though pawn games are exponentially-succinct turn-based games, we identify several natural classes that can be solved in PTIME. On the negative side, we identify several EXPTIME-complete classes, where our hardness proofs are based on a new class of games called Lock & Key games, which may be of independent interest.
- Determinacy in discrete-bidding infinite-duration games. Log. Methods Comput. Sci., 17(1), 2021.
- Formal methods with a touch of magic. In Proc. 20th FMCAD, 2020.
- Repairing multi-player games. In Proc. 26th CONCUR, pages 325–339, 2015.
- Alternating-time temporal logic. J. ACM, 49(5):672–713, 2002.
- K.R. Apt and E. Grädel. Lectures in Game Theory for Computer Scientists. Cambridge University Press, 2011.
- Run-time optimization for learned controllers through quantitative games. In Proc. 31st CAV, pages 630–649, 2019.
- Infinite-duration bidding games. J. ACM, 66(4):31:1–31:29, 2019.
- G. Avni and S. Sadhukhan. Computing threshold budgets in discrete-bidding games. In Proc. 42nd FSTTCS, volume 250 of LIPIcs, pages 30:1–30:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
- G. Bielous and O. Kupferman. Coverage and vacuity in network formation games. In Proc. 28th CSL, 2020.
- Non-zero sum games for reactive synthesis. In Proc. 10th LATA, pages 3–23, 2016.
- Subgame-perfect equilibria in mean-payoff games. In In Proc. 32nd CONCUR, volume 203 of LIPIcs, pages 8:1–8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
- Safe learning for near-optimal scheduling. In QEST, Proceedings, volume 12846 of Lecture Notes in Computer Science, pages 235–254. Springer, 2021.
- From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods Syst. Des., 50(2-3):97–139, 2017.
- Strategy logic. Inf. Comput., 208(6):677–693, 2010.
- M. Develin and S. Payne. Discrete bidding games. The Electronic Journal of Combinatorics, 17(1):R85, 2010.
- Rational synthesis. In Proc. 16th TACAS, pages 190–204, 2010.
- Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of Lecture Notes in Computer Science. Springer, 2002.
- Shield synthesis. Formal Methods in System Design, 51(2):332–361, 2017.
- Synthesis with rational environments. Ann. Math. Artif. Intell., 78(1):3–20, 2016.
- O. Kupferman and N. Shenwald. Games with trading of control. In Proc. 34th CONCUR, volume 279 of LIPIcs, pages 19:1–19:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
- The byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382–401, 1982.
- Combinatorial games under auction play. Games and Economic Behavior, 27(2):229–264, 1999.
- Reasoning about strategies: On the model-checking problem. ACM Trans. Comput. Log., 15(4):34:1–34:47, 2014.
- Reasoning about strategies. In Proc. 30th FSTTCS, pages 133–144, 2010.
- G. Perelli. Enforcing equilibria in multi-agent systems. In In Proc. 18th AAMAS, pages 188–196. International Foundation for Autonomous Agents and Multiagent Systems, 2019.
- A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th POPL, pages 179–190, 1989.
- M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1–35, 1969.
- Modeling for verification. In Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem, editors, Handbook of Model Checking, pages 75–105. Springer, 2018.
- Michael Sipser. Introduction to the Theory of Computation. Course Technology, Boston, MA, 2013.
- Reinforcement learning - an introduction. Adaptive computation and machine learning. MIT Press, 1998.
- M. Ummels. Stochastic multiplayer games: theory and algorithms. PhD thesis, RWTH Aachen University, 2011.
- J. van Benthem. An essay on sabotage and obstruction. In Mechanizing Mathematical Reasoning, Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday, pages 268–276, 2005.
- Rational verification: From model checking to equilibrium checking. In Proc. of the 30th AAAI, pages 4184–4191, 2016.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.