2 citations · 2 across the 4 of their papers we have counts for
3 papers · 1 filter
Regularity of the minmax value and equilibria in multiplayer Blackwell games
Galit Ashkenazi-Golan, János Flesch, Arkadi Predtetchinski +1
A real-valued function that is defined over all Borel sets of a topological space is \emph{regular} if for every Borel set , is the supremum of , over all close…
Equilibria in Repeated Games with Countably Many Players and Tail-Measurable Payoffs
Galit Ashkenazi-Golan, Janos Flesch, Arkadi Predtetchinski +1
We prove that every repeated game with countably many players, finite action sets, and tail-measurable payoffs admits an -equilibrium, for every .
Reachability and safety objectives in Markov decision processes on long but finite horizons
Galit Ashkenazi-Golan, János Flesch, Arkadi Predtetchinski +1
We consider discrete-time Markov decision processes in which the decision maker is interested in long but finite horizons. First we consider reachability objective: the decision ma…