Research outputs

Selected research outputs

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components (Journal article - 2018)
The Big Match with a Clock and a Bit of Memory (Conference Paper - 2018)
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components (Conference Paper - 2016)
The value 1 problem under finite-memory strategies for concurrent mean-payoff games (Conference Paper - 2015)
Computational complexity of ecological and evolutionary spatial dynamics (Journal article - 2015)

Filter research outputs

What type of research output do you want to show?

All

Chapter

Conference Paper

Journal

Preprint

2026

The Complexity of Games with Randomised Control

: Preprint

The Complexity of Games with Randomised Control

Bahmani, S., Ibsen-Jensen, R., Paul, S., Schewe, S., Slivovsky, F., Tang, Q., . . . Zhu, S. (2026). The Complexity of Games with Randomised Control. In Lecture Notes in Computer Science Vol. 16503 LNCS (pp. 43-64). doi:10.1007/978-3-032-22730-0_3

DOI: 10.1007/978-3-032-22730-0_3
: Conference Paper

2025

Stochastic Games with Limited Public Memory

DOI: 10.48550/arxiv.2505.02623
: Preprint

2024

The Power of Counting Steps in Quantitative Games

Bose, S., Ibsen-Jensen, R., Purser, D., Totzke, P., & Vandenhove, P. (2024). The Power of Counting Steps in Quantitative Games. In 35TH INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY, CONCUR 2024 Vol. 311. doi:10.4230/LIPIcs.CONCUR.2024.13

DOI: 10.4230/LIPIcs.CONCUR.2024.13
: Conference Paper

Bounded-Memory Strategies in Partial-Information Games

Bose, S., Ibsen-Jensen, R., & Totzke, P. (2024). Bounded-Memory Strategies in Partial-Information Games. In PROCEEDINGS OF THE 39TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS 2024. doi:10.1145/3661814.3662096

DOI: 10.1145/3661814.3662096
: Conference Paper

The Power of Counting Steps in Quantitative Games

: Preprint

Bounded-Memory Strategies in Partial-Information Games

: Preprint

2023

Games on Graphs: From Logic and Automata to Algorithms

: Preprint

The Big Match with a Clock and a Bit of Memory

Hansen, K. A., Ibsen-Jensen, R., & Neymanc, A. (2023). The Big Match with a Clock and a Bit of Memory. MATHEMATICS OF OPERATIONS RESEARCH, 48(1), 419-432. doi:10.1287/moor.2022.1267

DOI: 10.1287/moor.2022.1267
: Journal article

Games on Graphs.

Fijalkow, N., Bertrand, N., Bouyer-Decitre, P., Brenguier, R., Carayol, A., Fearnley, J., . . . Skomra, M. (2023). Games on Graphs.. CoRR, abs/2305.10546.

: Journal article

2022

Complexity of Spatial Games

Chatterjee, K., Ibsen-Jensen, R., Jecker, I., & Svoboda, J. (2022). Complexity of Spatial Games. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 250. doi:10.4230/LIPIcs.FSTTCS.2022.11

DOI: 10.4230/LIPIcs.FSTTCS.2022.11
: Conference Paper

2021

Quantitative Verification on Product Graphs of Small Treewidth

Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Quantitative Verification on Product Graphs of Small Treewidth. In Leibniz International Proceedings in Informatics Lipics Vol. 213. doi:10.4230/LIPIcs.FSTTCS.2021.42

DOI: 10.4230/LIPIcs.FSTTCS.2021.42
: Conference Paper

Faster algorithms for quantitative verification in bounded treewidth graphs

Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. doi:10.1007/s10703-021-00373-5

DOI: 10.1007/s10703-021-00373-5
: Journal article

Absorbing games with a clock and two bits of memory

Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2021). Absorbing games with a clock and two bits of memory. Games and Economic Behavior, 128, 213-230. doi:10.1016/j.geb.2021.04.008

DOI: 10.1016/j.geb.2021.04.008
: Journal article

2020

Simplified game of life: Algorithms and complexity

Chatterjee, K., Ibsen-Jensen, R., Jecker, I., & Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In Leibniz International Proceedings in Informatics Lipics Vol. 170. doi:10.4230/LIPIcs.MFCS.2020.22

DOI: 10.4230/LIPIcs.MFCS.2020.22
: Conference Paper

One-Clock Priced Timed Games are PSPACE-hard

Fearnley, J., Ibsen-Jensen, R., & Savani, R. (2020). One-Clock Priced Timed Games are PSPACE-hard. LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. Retrieved from http://arxiv.org/abs/2001.04458v2

: Journal article

All-Pay Bidding Games on Graphs

Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-Pay Bidding Games on Graphs. THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 34, 1798-1805. Retrieved from https://www.webofscience.com/

: Journal article

All-Pay Bidding Games on Graphs.

Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-Pay Bidding Games on Graphs.. In AAAI (pp. 1798-1805). AAAI Press. Retrieved from https://ojs.aaai.org/index.php/AAAI/issue/view/249

: Conference Paper

One-Clock Priced Timed Games are PSPACE-hard.

Fearnley, J., Ibsen-Jensen, R., & Savani, R. (2020). One-Clock Priced Timed Games are PSPACE-hard.. In H. Hermanns, L. Zhang, N. Kobayashi, & D. Miller (Eds.), LICS (pp. 397-409). ACM. Retrieved from https://doi.org/10.1145/3373718

: Conference Paper

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis.

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2020). Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis.. In P. Müller (Ed.), ESOP Vol. 12075 (pp. 112-140). Springer. Retrieved from https://doi.org/10.1007/978-3-030-44914-8

: Conference Paper

Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2020). Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis. PROGRAMMING LANGUAGES AND SYSTEMS ( ESOP 2020), 12075, 112-140. doi:10.1007/978-3-030-44914-8_5

DOI: 10.1007/978-3-030-44914-8_5
: Journal article

2019

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth

Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. ACM Transactions on Programming Languages and Systems, 41(4). doi:10.1145/3363525

DOI: 10.1145/3363525
: Journal article

All-Pay Bidding Games on Graphs

DOI: 10.48550/arxiv.1911.08360
: Preprint

Bidding Games on Markov Decision Processes

Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotný, P. (2019). Bidding Games on Markov Decision Processes. In Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics Vol. 11674 LNCS (pp. 1-12). doi:10.1007/978-3-030-30806-3_1

DOI: 10.1007/978-3-030-30806-3_1
: Conference Paper

2018

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components

Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Transactions on Programming Languages and Systems, 40(3). doi:10.1145/3210257

DOI: 10.1145/3210257
: Journal article

Ergodic mean-payo games for the analysis of attacks in crypto-currencies

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payo games for the analysis of attacks in crypto-currencies. Leibniz International Proceedings in Informatics Lipics, 118. doi:10.4230/LIPIcs.CONCUR.2018.11

DOI: 10.4230/LIPIcs.CONCUR.2018.11
: Journal article

The Big Match with a Clock and a Bit of Memory

Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a Clock and a Bit of Memory. In ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION (pp. 149-150). doi:10.1145/3219166.3219198

DOI: 10.1145/3219166.3219198
: Conference Paper

Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies

DOI: 10.48550/arxiv.1806.03108
: Preprint

Infinite-Duration Poorman-Bidding Games

Avni, G., Henzinger, T. A., & Ibsen-Jensen, R. (2018). Infinite-Duration Poorman-Bidding Games. WEB AND INTERNET ECONOMICS, WINE 2018, 11316, 21-36. doi:10.1007/978-3-030-04612-5_2

DOI: 10.1007/978-3-030-04612-5_2
: Journal article

Infinite-Duration Poorman-Bidding Games.

Avni, G., Henzinger, T. A., & Ibsen-Jensen, R. (2018). Infinite-Duration Poorman-Bidding Games.. In G. Christodoulou, & T. Harks (Eds.), WINE Vol. 11316 (pp. 21-36). Springer. Retrieved from https://doi.org/10.1007/978-3-030-04612-5

: Conference Paper

Language acquisition with communication between learners

Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Language acquisition with communication between learners. JOURNAL OF THE ROYAL SOCIETY INTERFACE, 15(140). doi:10.1098/rsif.2018.0073

DOI: 10.1098/rsif.2018.0073
: Journal article

2017

Faster Monte-Carlo algorithms for fixation probability of the moran process on undirected graphs

Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. A. (2017). Faster Monte-Carlo algorithms for fixation probability of the moran process on undirected graphs. In Leibniz International Proceedings in Informatics Lipics Vol. 83. doi:10.4230/LIPIcs.MFCS.2017.61

DOI: 10.4230/LIPIcs.MFCS.2017.61
: Conference Paper

Strategy complexity of concurrent safety games

Chatterjee, K., Hansen, K. A., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics Lipics Vol. 83. doi:10.4230/LIPIcs.MFCS.2017.55

DOI: 10.4230/LIPIcs.MFCS.2017.55
: Conference Paper

Edit Distance for Pushdown Automata

DOI: 10.48550/arxiv.1504.08259
: Preprint

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs

DOI: 10.48550/arxiv.1706.06931
: Preprint

A short proof of correctness of the quasi-polynomial time algorithm for parity games

DOI: 10.48550/arxiv.1702.01953
: Preprint

A short proof of correctness of the quasi-polynomial time algorithm for parity games.

Gimbert, H., & Ibsen-Jensen, R. (2017). A short proof of correctness of the quasi-polynomial time algorithm for parity games.. CoRR, abs/1702.01953.

: Journal article

2016

Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs

Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs. In Leibniz International Proceedings in Informatics Lipics Vol. 57. doi:10.4230/LIPIcs.ESA.2016.28

DOI: 10.4230/LIPIcs.ESA.2016.28
: Conference Paper

The Big Match in Small Space

DOI: 10.48550/arxiv.1604.07634
: Preprint

Robust Draws in Balanced Knockout Tournaments

DOI: 10.48550/arxiv.1604.05090
: Preprint

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. In ACM SIGPLAN NOTICES Vol. 51 (pp. 733-747). doi:10.1145/2914770.2837624

DOI: 10.1145/2914770.2837624
: Conference Paper

Algorithms for algebraic path properties in concurrent systems of constant treewidth components

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. In Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (pp. 733-747). Association for Computing Machinery (ACM). doi:10.1145/2837614.2837624

DOI: 10.1145/2837614.2837624
: Conference Paper

Robust draws in balanced knockout tournaments

Chatterjee, K., Ibsen-Jensen, R., & Tkadlec, J. (2016). Robust draws in balanced knockout tournaments. In Ijcai International Joint Conference on Artificial Intelligence Vol. 2016-January (pp. 172-179).

: Conference Paper

The Big Match in Small Space (Extended Abstract)

Hansen, K. A., Ibsen-Jensen, R., & Koucky, M. (2016). The Big Match in Small Space (Extended Abstract). In ALGORITHMIC GAME THEORY, SAGT 2016 Vol. 9928 (pp. 64-76). doi:10.1007/978-3-662-53354-3_6

DOI: 10.1007/978-3-662-53354-3_6
: Conference Paper

The Complexity of Deciding Legality of a Single Step of Magic: The Gathering

Chatterjee, K., & Ibsen-Jensen, R. (2016). The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. In ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE Vol. 285 (pp. 1432-1439). doi:10.3233/978-1-61499-672-9-1432

DOI: 10.3233/978-1-61499-672-9-1432
: Conference Paper

2015

Computational complexity of ecological and evolutionary spatial dynamics

Ibsen-Jensen, R., Chatterjee, K., & Nowak, M. A. (2015). Computational complexity of ecological and evolutionary spatial dynamics. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 112(51), 15636-15641. doi:10.1073/pnas.1511366112

DOI: 10.1073/pnas.1511366112
: Journal article

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components

DOI: 10.48550/arxiv.1510.07565
: Preprint

Qualitative analysis of concurrent mean-payoff games

Chatterjee, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean-payoff games. INFORMATION AND COMPUTATION, 242, 2-24. doi:10.1016/j.ic.2015.03.009

DOI: 10.1016/j.ic.2015.03.009
: Journal article

Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives

DOI: 10.48550/arxiv.1506.02434
: Preprint

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A., & Goyal, P. (2015). Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. ACM SIGPLAN Notices, 50(1), 97-109. doi:10.1145/2775051.2676979

DOI: 10.1145/2775051.2676979
: Journal article

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs

DOI: 10.48550/arxiv.1504.07384
: Preprint

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

DOI: 10.1145/2775051.2676979
: Journal article

Edit Distance for Pushdown Automata

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit Distance for Pushdown Automata. In Automata, Languages, and Programming (Vol. 9135, pp. 121-133). Springer Nature. doi:10.1007/978-3-662-47666-6_10

DOI: 10.1007/978-3-662-47666-6_10
: Chapter

Edit distance for pushdown automata

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit Distance for Pushdown Automata. Automata, Languages, and Programming, 9135, 121-133. doi:10.1007/978-3-662-47666-6_10

DOI: 10.23638/LMCS-13(3:23)2017
: Journal article

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs

Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. In COMPUTER AIDED VERIFICATION, PT I Vol. 9206 (pp. 140-157). doi:10.1007/978-3-319-21690-4_9

DOI: 10.1007/978-3-319-21690-4_9
: Conference Paper

Qualitative analysis of concurrent mean-payoff games.

Chatterjee, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean-payoff games.. Inf. Comput., 242, 2-24. doi:10.1016/j.ic.2015.03.009

DOI: 10.1016/j.ic.2015.03.009
: Journal article

The value 1 problem under finite-memory strategies for concurrent mean-payoff games

Chatterjee, K., & Ibsen-Jensen, R. (2015). The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms Vol. 2015-January (pp. 1018-1029). doi:10.1137/1.9781611973730.69

DOI: 10.1137/1.9781611973730.69
: Conference Paper

2014

The complexity of interior point methods for solving discounted turn-based stochastic games

DOI: 10.48550/arxiv.1304.1888
: Preprint

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth

DOI: 10.48550/arxiv.1410.7724
: Preprint

The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games

DOI: 10.48550/arxiv.1409.6690
: Preprint

Qualitative Analysis of Concurrent Mean-payoff Games

DOI: 10.48550/arxiv.1409.5306
: Preprint

Generalized Risk-Aversion in Stochastic Multi-Armed Bandits

DOI: 10.48550/arxiv.1405.0833
: Preprint

The Complexity of Ergodic Mean-payoff Games

DOI: 10.48550/arxiv.1404.5734
: Preprint

Edit distance for timed automata

Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance for timed automata. In Hscc 2014 Proceedings of the 17th International Conference on Hybrid Systems Computation and Control Part of Cps Week (pp. 303-312). doi:10.1145/2562059.2562141

DOI: 10.1145/2562059.2562141
: Conference Paper

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth.

Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A., & Goyal, P. (2014). Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth.. CoRR, abs/1410.7724.

: Journal article

Generalized Risk-Aversion in Stochastic Multi-Armed Bandits.

Zimin, A., Ibsen-Jensen, R., & Chatterjee, K. (2014). Generalized Risk-Aversion in Stochastic Multi-Armed Bandits.. CoRR, abs/1405.0833.

: Journal article

The Complexity of Ergodic Mean-payoff Games

Chatterjee, K., & Ibsen-Jensen, R. (2014). The Complexity of Ergodic Mean-payoff Games. In AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT II Vol. 8573 (pp. 122-133). Retrieved from https://www.webofscience.com/

: Conference Paper

The Complexity of Ergodic Mean-payoff Games.

Chatterjee, K., & Ibsen-Jensen, R. (2014). The Complexity of Ergodic Mean-payoff Games.. CoRR, abs/1404.5734.

: Journal article

The Complexity of Solving Reachability Games Using Value and Strategy Iteration

Hansen, K. A., Ibsen-Jensen, R., & Miltersen, P. B. (2014). The Complexity of Solving Reachability Games Using Value and Strategy Iteration. THEORY OF COMPUTING SYSTEMS, 55(2), 380-403. doi:10.1007/s00224-013-9524-6

DOI: 10.1007/s00224-013-9524-6
: Journal article

2013

Patience of matrix games

Hansen, K. A., Ibsen-Jensen, R., Podolskii, V. V., & Tsigaridas, E. (2013). Patience of matrix games. Discrete Applied Mathematics, 161(16-17), 2440-2459. doi:10.1016/j.dam.2013.05.008

DOI: 10.1016/j.dam.2013.05.008
: Journal article

A faster algorithm for solving one-clock priced timed games

Hansen, T. D., Ibsen-Jensen, R., & Miltersen, P. B. (2013). A faster algorithm for solving one-clock priced timed games. In Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics Vol. 8052 LNCS (pp. 531-545). doi:10.1007/978-3-642-40184-8_37

DOI: 10.1007/978-3-642-40184-8_37
: Conference Paper

The complexity of interior point methods for solving discounted turn-based stochastic games

Hansen, T. D., & Ibsen-Jensen, R. (2013). The complexity of interior point methods for solving discounted turn-based stochastic games. In Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics Vol. 7921 LNCS (pp. 252-262). doi:10.1007/978-3-642-39053-1_29

DOI: 10.1007/978-3-642-39053-1_29
: Conference Paper

Strategy complexity of finite-horizon markov decision processes and simple stochastic games

Chatterjee, K., & Ibsen-Jensen, R. (2013). Strategy complexity of finite-horizon markov decision processes and simple stochastic games. In Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics Vol. 7721 LNCS (pp. 106-117). doi:10.1007/978-3-642-36046-6_11

DOI: 10.1007/978-3-642-36046-6_11
: Conference Paper

A Faster Algorithm for Solving One-Clock Priced Timed Games

DOI: 10.48550/arxiv.1201.3498
: Preprint

2012

Solving Simple Stochastic Games with Few Coin Toss Positions

Ibsen-Jensen, R., & Miltersen, P. B. (2012). Solving Simple Stochastic Games with Few Coin Toss Positions. In ALGORITHMS - ESA 2012 Vol. 7501 (pp. 636-647). Retrieved from https://www.webofscience.com/

: Conference Paper

Strategy complexity of finite-horizon Markov decision processes and simple stochastic games

DOI: 10.48550/arxiv.1209.3617
: Preprint

Patience of Matrix Games

DOI: 10.48550/arxiv.1206.1751
: Preprint

Solving simple stochastic games with few coin toss positions

DOI: 10.48550/arxiv.1112.5255
: Preprint

The complexity of solving reachability games using value and strategy iteration

DOI: 10.48550/arxiv.1007.1812
: Preprint

2011

The complexity of solving reachability games using value and strategy iteration

Hansen, K. A., Ibsen-Jensen, R., & Miltersen, P. B. (2011). The complexity of solving reachability games using value and strategy iteration. In Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics Vol. 6651 LNCS (pp. 77-90). doi:10.1007/978-3-642-20712-9_7

DOI: 10.1007/978-3-642-20712-9_7
: Conference Paper