Minimizing Regret in Discounted-Sum Games

Computers and Intractability: A Guide to the Theory of NP-Completeness

Michael R. Garey and David S. Johnson · 1979

Earlier work this paper cites.

Alternation

Ashok K. Chandra, Dexter Kozen, and Larry J. Stockmeyer · 1981

Earlier work this paper cites.

Regret in decision making under uncertainty

David E. Bell · 1982

Earlier work this paper cites.

Amortized efficiency of list update rules

Daniel Dominic Sleator and Robert Endre Tarjan · 1984

Earlier work this paper cites.

The complexity of mean payoff games on graphs

Original

Uri Zwick and Mike Paterson · 1996

Earlier work this paper cites.

The disjoint shortest paths problem

Tali Eilam-Tzoreff · 1998

Cited alongside, same era.

Solving games without determinization

Thomas A. Henzinger and Nir Piterman · 2006

Cited alongside, same era.

Reasoning about online algorithms with weighted automata

Benjamin Aminof, Orna Kupferman, and Robby Lampert · 2010

Cited alongside, same era.

Quantitative languages

Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger · 2010

Cited alongside, same era.

Iterated regret minimization in game graphs

Emmanuel Filiot, Tristan Le Gall, and Jean-François Raskin · 2010

Cited alongside, same era.

Lectures in game theory for computer scientists

Krzysztof R. Apt and Erich Grädel · 2011

Later among the works it cites.

Does it pay to extend the perimeter of a world model?

Werner Damm and Bernd Finkbeiner · 2011

Later among the works it cites.

Exact and approximate determinization of discounted-sum automata

Udi Boker and Thomas A. Henzinger · 2014

Later among the works it cites.

Mean-payoff games with partial-observation - (extended abstract)

Paul Hunter, Guillermo A. Pérez, and Jean-François Raskin · 2014

Later among the works it cites.

Reactive synthesis without regret

Paul Hunter, Guillermo A. Pérez, and Jean-François Raskin · 2015

Closest in time.