Showing 2026Show all
3 papers · 1 filter
cs.GT2026
Generalized Bidding Games: Where Bidding and Stochastic Games Meet
Ali Asadi, Thomas A. Henzinger, Ehsan Kafshdar Goharshady +2
Two-player games on graphs are a classical framework for analyzing strategic decision making. In turn-based games, two players move a token along the edges of the graph, and the ri…
cs.AI2026
Strongly Polynomial Time Complexity of Policy Iteration for Robust MDPs
Ali Asadi, Krishnendu Chatterjee, Ehsan Goharshady +3
Markov decision processes (MDPs) are a fundamental model in sequential decision making. Robust MDPs (RMDPs) extend this framework by allowing uncertainty in transition probabilitie…
cs.AI2026
Automated Approach for Solving Infinite-state Polynomial Reachability Games
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi +2
Reachability games are two-player games played on a graph, where the objective of player is to reach the target set whereas the objective of player…