20 citations · 62 across the 23 of their papers we have counts for
3 papers · 1 filter
Strategy complexity of finite-horizon Markov decision processes and simple stochastic games
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
Markov decision processes (MDPs) and simple stochastic games (SSGs) provide a rich mathematical framework to study many important problems related to probabilistic systems. MDPs an…
Patience of Matrix Games
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii +1
For matrix games we study how small nonzero probability must be used in optimal strategies. We show that for nxn win-lose-draw games (i.e. (-1,0,1) matrix games) nonzero probabilit…
A Faster Algorithm for Solving One-Clock Priced Timed Games
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that one-clock priced time…