20 citations · 62 across the 23 of their papers we have counts for
5 papers · 1 filter
Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis +1
Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. Recursive state machines (RSMs) are s…
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a…
Qualitative Analysis of Concurrent Mean-payoff Games
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
We consider concurrent games played by two-players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the join…
Generalized Risk-Aversion in Stochastic Multi-Armed Bandits
Alexander Zimin, Rasmus Ibsen-Jensen, Krishnendu Chatterjee
We consider the problem of minimizing the regret in stochastic multi-armed bandit, when the measure of goodness of an arm is not the mean return, but some general function of the m…
The Complexity of Ergodic Mean-payoff Games
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infini…