Author

Krishnendu Chatterjee

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Algorithms with Smoothed Polynomial-Time Complexity for Deterministic Discounted-sum and Mean-payoff Games

Turn-based deterministic games on graphs are two-player zero-sum games played on finite directed graphs, where the vertex set is partitioned between the Max and the adversarial Min Player. The respective player chooses outgoing edges from their vertices. We consider these games with the classical discounted-sum and mea...

Ali Asadi, Krishnendu Chatterjee, Rui-Chen Luo · 0 citations

Preprint Sep 2026

Values of Absorbing Recursive Games Express All Real Algebraic Numbers

Many classes of two-player zero-sum stochastic games have the orderfield property: if all payoffs and transition probabilities lie in a subfield of $\mathbb{R}$, so does the undiscounted value. Absorbing games fail this property, and Oliu-Barton and Vigeral [Absorbing games with irrational values, Oper. Res. Lett. 51 (...

Ali Asadi, Krishnendu Chatterjee · 0 citations