Rasmus Ibsen-Jensen

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 37

Top Topics

Nash Equilibria

Top Venues

Publications

Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove
The Power of Counting Steps in Quantitative Games. CONCUR (2024)
Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove
The Power of Counting Steps in Quantitative Games. CoRR (2024)
Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke
Bounded-Memory Strategies in Partial-Information Games. LICS (2024)
Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke
Bounded-Memory Strategies in Partial-Information Games. CoRR (2024)
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ý, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra
Games on Graphs. CoRR (2023)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman
The Big Match with a Clock and a Bit of Memory. Math. Oper. Res. 48 (1) (2023)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda
Complexity of Spatial Games. FSTTCS (2022)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods Syst. Des. 57 (3) (2021)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
Quantitative Verification on Product Graphs of Small Treewidth. FSTTCS (2021)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman
Absorbing games with a clock and two bits of memory. Games Econ. Behav. 128 (2021)
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. ESOP (2020)
John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani
One-Clock Priced Timed Games are PSPACE-hard. CoRR (2020)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda
Simplified Game of Life: Algorithms and Complexity. MFCS (2020)
Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec
All-Pay Bidding Games on Graphs. AAAI (2020)
John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani
One-Clock Priced Timed Games are PSPACE-hard. LICS (2020)
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis. CoRR (2020)
Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec
All-Pay Bidding Games on Graphs. CoRR (2019)
Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný
Bidding Games on Markov Decision Processes. RP (2019)
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. ACM Trans. Program. Lang. Syst. 41 (4) (2019)
Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen
Infinite-Duration Poorman-Bidding Games. WINE (2018)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Trans. Program. Lang. Syst. 40 (3) (2018)
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CONCUR (2018)
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CoRR (2018)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman
The Big Match with a Clock and a Bit of Memory. EC (2018)
Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen
Infinite-Duration Poorman-Bidding Games. CoRR (2018)
Hugo Gimbert, Rasmus Ibsen-Jensen
A short proof of correctness of the quasi-polynomial time algorithm for parity games. CoRR (2017)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. MFCS (2017)
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop
Edit Distance for Pushdown Automata. Log. Methods Comput. Sci. 13 (3) (2017)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. CoRR (2017)
Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen
Strategy Complexity of Concurrent Safety Games. MFCS (2017)
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL (2016)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec
Robust Draws in Balanced Knockout Tournaments. IJCAI (2016)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký
The Big Match in Small Space - (Extended Abstract). SAGT (2016)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký
The Big Match in Small Space. CoRR (2016)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. ESA (2016)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. ECAI (2016)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec
Robust Draws in Balanced Knockout Tournaments. CoRR (2016)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. POPL (2015)
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop
Edit Distance for Pushdown Automata. CoRR (2015)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
Qualitative analysis of concurrent mean-payoff games. Inf. Comput. 242 (2015)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. CAV (1) (2015)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games. SODA (2015)
Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen
Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives. CoRR (2015)
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. CoRR (2015)
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop
Edit Distance for Pushdown Automata. ICALP (2) (2015)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. CoRR (2015)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Rupak Majumdar
Edit distance for timed automata. HSCC (2014)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games. CoRR (2014)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory Comput. Syst. 55 (2) (2014)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal
Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. CoRR (2014)
Alexander Zimin, Rasmus Ibsen-Jensen, Krishnendu Chatterjee
Generalized Risk-Aversion in Stochastic Multi-Armed Bandits. CoRR (2014)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
The Complexity of Ergodic Mean-payoff Games. ICALP (2) (2014)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
Qualitative Analysis of Concurrent Mean-payoff Games. CoRR (2014)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
The Complexity of Ergodic Mean-payoff Games. CoRR (2014)
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games. CiE (2013)
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen
The complexity of interior point methods for solving discounted turn-based stochastic games CoRR (2013)
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
A Faster Algorithm for Solving One-Clock Priced Timed Games. CONCUR (2013)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas
Patience of matrix games. Discret. Appl. Math. 161 (16-17) (2013)
Rasmus Ibsen-Jensen, Peter Bro Miltersen
Solving Simple Stochastic Games with Few Coin Toss Positions. ESA (2012)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games. MEMICS (2012)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas
Patience of Matrix Games CoRR (2012)
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
A Faster Algorithm for Solving One-Clock Priced Timed Games CoRR (2012)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
Strategy complexity of finite-horizon Markov decision processes and simple stochastic games CoRR (2012)
Rasmus Ibsen-Jensen, Peter Bro Miltersen
Solving simple stochastic games with few coin toss positions CoRR (2011)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. CSR (2011)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
The complexity of solving reachability games using value and strategy iteration CoRR (2010)