The Power of Counting Steps in Quantitative Games - Sougata Bose; Rasmus Ibsen-Jensen; David Purser; Patrick Totzke; Pierre Vandenhove (35th International Conference on Concurrency Theory, CONCUR 2024, September 9-13, 2024, Calgary, Canada, 2024)

Bounded-Memory Strategies in Partial-Information Games - Sougata Bose; Rasmus Ibsen-Jensen; Patrick Totzke (Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024, 2024)

Bounded-Memory Strategies in Partial-Information Games - Sougata Bose; Rasmus Ibsen-Jensen; Patrick Totzke (CoRR, 2024)

The Power of Counting Steps in Quantitative Games - Sougata Bose; Rasmus Ibsen-Jensen; David Purser; Patrick Totzke; Pierre Vandenhove (CoRR, 2024)

The Big Match with a Clock and a Bit of Memory - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Abraham Neyman (Math. Oper. Res., 2023)

Games on Graphs - Nathanaël Fijalkow; Nathalie Bertrand; Patricia Bouyer-Decitre; Romain Brenguier; Arnaud Carayol; John Fearnley; Hugo Gimbert; Florian Horn; Rasmus Ibsen-Jensen; Nicolas Markey; Benjamin Monmege; Petr Novotný; et al. (CoRR, 2023)

Complexity of Spatial Games - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Ismaël Jecker; Jakub Svoboda (42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India, 2022)

Faster algorithms for quantitative verification in bounded treewidth graphs - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (Formal Methods Syst. Des., 2021)

Absorbing games with a clock and two bits of memory - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Abraham Neyman (Games Econ. Behav., 2021)

Quantitative Verification on Product Graphs of Small Treewidth - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference, 2021)

All-Pay Bidding Games on Graphs - Guy Avni; Rasmus Ibsen-Jensen; Josef Tkadlec (The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020, 2020)

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (Programming Languages and Systems - 29th European Symposium on Programming, ESOP 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, 2020)

One-Clock Priced Timed Games are PSPACE-hard - John Fearnley; Rasmus Ibsen-Jensen; Rahul Savani (LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020, 2020)

Simplified Game of Life: Algorithms and Complexity - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Ismaël Jecker; Jakub Svoboda (45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic, 2020)

One-Clock Priced Timed Games are PSPACE-hard - John Fearnley; Rasmus Ibsen-Jensen; Rahul Savani (CoRR, 2020)

Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (CoRR, 2020)

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Prateesh Goyal; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst., 2019)

Bidding Games on Markov Decision Processes - Guy Avni; Thomas A. Henzinger; Rasmus Ibsen-Jensen; Petr Novotný (Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings, 2019)

All-Pay Bidding Games on Graphs - Guy Avni; Rasmus Ibsen-Jensen; Josef Tkadlec (CoRR, 2019)

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Amir Kafshdar Goharshady; Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst., 2018)

Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Yaron Velner (29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China, 2018)

The Big Match with a Clock and a Bit of Memory - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Abraham Neyman (Proceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018, 2018)

Infinite-Duration Poorman-Bidding Games - Guy Avni; Thomas A. Henzinger; Rasmus Ibsen-Jensen (Web and Internet Economics - 14th International Conference, WINE 2018, Oxford, UK, December 15-17, 2018, Proceedings, 2018)

Infinite-Duration Poorman-Bidding Games - Guy Avni; Thomas A. Henzinger; Rasmus Ibsen-Jensen (CoRR, 2018)

Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Yaron Velner (CoRR, 2018)

Edit Distance for Pushdown Automata - Krishnendu Chatterjee; Thomas A. Henzinger; Rasmus Ibsen-Jensen; Jan Otop (Log. Methods Comput. Sci., 2017)

Strategy Complexity of Concurrent Safety Games - Krishnendu Chatterjee; Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen (42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, 2017)

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Martin A. Nowak (42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, 2017)

A short proof of correctness of the quasi-polynomial time algorithm for parity games - Hugo Gimbert; Rasmus Ibsen-Jensen (CoRR, 2017)

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Martin A. Nowak (CoRR, 2017)

The Complexity of Deciding Legality of a Single Step of Magic: The Gathering - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016), 2016)

Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, 2016)

Robust Draws in Balanced Knockout Tournaments - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Josef Tkadlec (Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, 2016)

Algorithms for algebraic path properties in concurrent systems of constant treewidth components - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20 - 22, 2016, 2016)

The Big Match in Small Space - (Extended Abstract) - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Michal Koucký (Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Liverpool, UK, September 19-21, 2016. Proceedings, 2016)

Robust Draws in Balanced Knockout Tournaments - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Josef Tkadlec (CoRR, 2016)

The Big Match in Small Space - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Michal Koucký (CoRR, 2016)

Qualitative analysis of concurrent mean-payoff games - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (Inf. Comput., 2015)

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I, 2015)

Edit Distance for Pushdown Automata - Krishnendu Chatterjee; Thomas A. Henzinger; Rasmus Ibsen-Jensen; Jan Otop (Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, 2015)

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis; Prateesh Goyal (Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, January 15-17, 2015, 2015)

The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, 2015)

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (CoRR, 2015)

Edit Distance for Pushdown Automata - Krishnendu Chatterjee; Thomas A. Henzinger; Rasmus Ibsen-Jensen; Jan Otop (CoRR, 2015)

Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives - Krishnendu Chatterjee; Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen (CoRR, 2015)

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (CoRR, 2015)

The Complexity of Solving Reachability Games Using Value and Strategy Iteration - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Peter Bro Miltersen (Theory Comput. Syst., 2014)

Edit distance for timed automata - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Rupak Majumdar (17th International Conference on Hybrid Systems: Computation and Control (part of CPS Week), HSCC'14, Berlin, Germany, April 15-17, 2014, 2014)

The Complexity of Ergodic Mean-payoff Games - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, 2014)

The Complexity of Ergodic Mean-payoff Games - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (CoRR, 2014)

Generalized Risk-Aversion in Stochastic Multi-Armed Bandits - Alexander Zimin; Rasmus Ibsen-Jensen; Krishnendu Chatterjee (CoRR, 2014)

Qualitative Analysis of Concurrent Mean-payoff Games - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (CoRR, 2014)

The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (CoRR, 2014)

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis; Prateesh Goyal (CoRR, 2014)

Patience of matrix games - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Vladimir V. Podolskii; Elias P. Tsigaridas (Discret. Appl. Math., 2013)

The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games - Thomas Dueholm Hansen; Rasmus Ibsen-Jensen (The Nature of Computation. Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings, 2013)

A Faster Algorithm for Solving One-Clock Priced Timed Games - Thomas Dueholm Hansen; Rasmus Ibsen-Jensen; Peter Bro Miltersen (CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, 2013)

The complexity of interior point methods for solving discounted turn-based stochastic games - Thomas Dueholm Hansen; Rasmus Ibsen-Jensen (CoRR, 2013)

Solving Simple Stochastic Games with Few Coin Toss Positions - Rasmus Ibsen-Jensen; Peter Bro Miltersen (Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, 2012)

Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (Mathematical and Engineering Methods in Computer Science, 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers, 2012)

A Faster Algorithm for Solving One-Clock Priced Timed Games - Thomas Dueholm Hansen; Rasmus Ibsen-Jensen; Peter Bro Miltersen (CoRR, 2012)

Patience of Matrix Games - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Vladimir V. Podolskii; Elias P. Tsigaridas (CoRR, 2012)

Strategy complexity of finite-horizon Markov decision processes and simple stochastic games - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (CoRR, 2012)

The Complexity of Solving Reachability Games Using Value and Strategy Iteration - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Peter Bro Miltersen (Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings, 2011)

Solving simple stochastic games with few coin toss positions - Rasmus Ibsen-Jensen; Peter Bro Miltersen (CoRR, 2011)

The complexity of solving reachability games using value and strategy iteration - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Peter Bro Miltersen (CoRR, 2010)