DOI,IST REx ID,Research Group,Title of publication
10.1609/aaai.v40i43.40931,21717,"KrCh,GradSch","Qualitative analysis of ω-regular objectives on robust MDPs"
10.1609/aaai.v40i43.40932,21722,KrCh,Revealing POMDPs: Qualitative and quantitative analysis for parity objectives
10.4230/LIPIcs.CONCUR.2026.13,22920,"GradSch,KrCh,ToHe",Generalized bidding games: Where bidding and stochastic games meet
10.4230/LIPIcs.CONCUR.2026.12,22919,"GradSch,KrCh,ToHe",PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance
10.15479/AT-ISTA-23079,23079,"GradSch,KrCh",Approximation of values and equilibria in stochastic games: Complexity and algorithms
null,20299,"KrCh,GradSch",Lower bound on Howard policy iteration for deterministic Markov Decision Processes
null,20297,"KrCh,GradSch",Limit-sure reachability for small memory policies in POMDPs is NP-complete
10.4230/lipics.fsttcs.2025.9,21281,"KrCh,GradSch",ε-stationary Nash equilibria in multi-player stochastic graph games
10.1145/3661814.3662080,17098,KrCh,Deterministic sub-exponential algorithm for discounted-sum games with unary weights
10.4230/LIPIcs.FSTTCS.2024.5,17099,KrCh,Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms