DOI,IST REx ID,Research Group,Title of publication
10.1609/aaai.v40i43.40932,21722,KrCh,Revealing POMDPs: Qualitative and quantitative analysis for parity objectives
10.4230/LIPIcs.ICALP.2025.87,21320,KrCh,IID prophet inequality with random horizon: Going beyond increasing hazard rates
10.1007/s13235-025-00636-4,19508,"MaKw,KrCh",Random zero-sum dynamic games on infinite directed graphs
10.1609/aaai.v39i11.33212,19669,KrCh,Linear equations with min and max operators: Computational complexity
10.1007/978-3-031-90653-4_11,19740,KrCh,Value iteration with guessing for Markov chains and Markov decision processes
null,20297,"KrCh,GradSch",Limit-sure reachability for small memory policies in POMDPs is NP-complete
10.15479/AT-ISTA-20234,20234,"GradSch,KrCh","Robustness of solutions in game theory : Values and strategies in partially observable, perturbed, stochastic, and infinite games"
10.1287/moor.2023.0297,17037,"GradSch,KrCh",Marginal values of a stochastic game
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
10.48550/arXiv.2401.16252,17101,KrCh,Zero-sum random games on directed graphs
10.1287/moor.2022.0332,18266,"GradSch,KrCh",Value-positivity for matrix games
10.1137/1.9781611977554.ch173,12676,"GradSch,KrCh",Faster algorithm for turn-based stochastic games with bounded treewidth
10.48550/arXiv.2304.04024,17100,KrCh,Prophet inequalities: Separating random order from order selection
10.1007/s11538-022-01029-z,11447,"GradSch,NiBa,JaMa",Relation between the number of peaks and the number of reciprocal sign epistatic interactions
10.48550/ARXIV.2209.14368,12677,"GradSch,KrCh",Repeated prophet inequality with near-optimal bounds
10.1287/moor.2020.1116,9311,"GradSch,KrCh",Finite-memory strategies in POMDPs with long-run average objectives