Rasmus Ibsen-Jensen

Abraham Neyman

Math. Oper. Res., February, 2023

Games on Graphs.

[BibT_eX]

[DOI]

Nathanaël Fijalkow

Nathalie Bertrand

Patricia Bouyer-Decitre

CoRR, 2023

2022

Complexity of Spatial Games.

[BibT_eX]

[DOI]

Ismaël Jecker

Jakub Svoboda

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Absorbing games with a clock and two bits of memory.

[BibT_eX]

[DOI]

Abraham Neyman

Games Econ. Behav., 2021

Faster algorithms for quantitative verification in bounded treewidth graphs.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2021

Quantitative Verification on Product Graphs of Small Treewidth.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Simplified Game of Life: Algorithms and Complexity.

[BibT_eX]

[DOI]

Ismaël Jecker

Jakub Svoboda

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

One-Clock Priced Timed Games are PSPACE-hard.

[BibT_eX]

[DOI]

John Fearnley

Rahul Savani

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

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

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2020

All-Pay Bidding Games on Graphs.

[BibT_eX]

[DOI]

Guy Avni

Josef Tkadlec

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

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

[BibT_eX]

[DOI]

Prateesh Goyal

ACM Trans. Program. Lang. Syst., 2019

Bidding Games on Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 13th International Conference, 2019

2018

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

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2018

Infinite-Duration Poorman-Bidding Games.

[BibT_eX]

[DOI]

Guy Avni

Thomas A. Henzinger

Proceedings of the Web and Internet Economics - 14th International Conference, 2018

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

[BibT_eX]

[DOI]

Yaron Velner

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

Edit Distance for Pushdown Automata.

[BibT_eX]

[DOI]

Thomas A. Henzinger

Jan Otop

Log. Methods Comput. Sci., 2017

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

[BibT_eX]

[DOI]

Hugo Gimbert

CoRR, 2017

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

[BibT_eX]

[DOI]

Martin A. Nowak

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Strategy Complexity of Concurrent Safety Games.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

The Big Match in Small Space.

[BibT_eX]

[DOI]

Michal Koucký

CoRR, 2016

The Big Match in Small Space - (Extended Abstract).

[BibT_eX]

[DOI]

Michal Koucký

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Robust Draws in Balanced Knockout Tournaments.

[BibT_eX]

[DOI]

Josef Tkadlec

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

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

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

Qualitative analysis of concurrent mean-payoff games.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

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

[BibT_eX]

[DOI]

Prateesh Goyal

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014

The Complexity of Solving Reachability Games Using Value and Strategy Iteration.

[BibT_eX]

[DOI]

Peter Bro Miltersen

Theory Comput. Syst., 2014

Generalized Risk-Aversion in Stochastic Multi-Armed Bandits.

[BibT_eX]

[DOI]

Alexander Zimin

CoRR, 2014

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

[BibT_eX]

[DOI]

Prateesh Goyal

CoRR, 2014

The Complexity of Ergodic Mean-payoff Games.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Edit distance for timed automata.

[BibT_eX]

[DOI]

Rupak Majumdar

Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control (part of CPS Week), 2014

2013

Patience of matrix games.

[BibT_eX]

[DOI]

Vladimir V. Podolskii

Elias P. Tsigaridas

Discret. Appl. Math., 2013

A Faster Algorithm for Solving One-Clock Priced Timed Games.

[BibT_eX]

[DOI]

Thomas Dueholm Hansen

Peter Bro Miltersen

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games.

[BibT_eX]

[DOI]

Thomas Dueholm Hansen

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games.

[BibT_eX]

[DOI]

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Solving Simple Stochastic Games with Few Coin Toss Positions.

[BibT_eX]

[DOI]