1 citations · 1 across the 4 of their papers we have counts for
4 papers
Stochastic Games with General Payoff Functions
János Flesch, Eilon Solan
We consider multiplayer stochastic games in which the payoff of each player is a bounded and Borel-measurable function of the infinite play. By using a generalization of the techni…
Absorbing Blackwell Games
Galit Ashkenazi-Golan, János Flesch, Eilon Solan
It was shown in Flesch and Solan (2022) with a rather involved proof that all two-player stochastic games with finite state and action spaces and shift-invariant payoffs admit an $…
Approachability of convex sets in generalized quitting games
János Flesch, Rida Laraki, Vianney Perchet
We consider Blackwell approachability, a very powerful and geometric tool in game theory, used for example to design strategies of the uninformed player in repeated games with inco…
Existence of Secure Equilibrium in Multi-Player Games with Perfect Information
Julie De Pril, János Flesch, Jeroen Kuipers +2
Secure equilibrium is a refinement of Nash equilibrium, which provides some security to the players against deviations when a player changes his strategy to another best response s…