2 citations · 4 across the 14 of their papers we have counts for
4 papers · 1 filter
Random perfect information games
János Flesch, Arkadi Predtetchinski, Ville Suomala
The paper proposes a natural measure space of zero-sum perfect information games with upper semicontinuous payoffs. Each game is specified by the game tree, and by the assignment o…
A competitive search game with a moving target
Benoit Duvocelle, János Flesch, Mathias Staudigl +1
We introduce a discrete-time search game, in which two players compete to find an object first. The object moves according to a time-varying Markov chain on finitely many states. T…
Incentive compatibility in sender-receiver stopping games
Aditya Aradhye, János Flesch, Mathias Staudigl +1
We introduce a model of sender-receiver stopping games, where the state of the world follows an iid--process throughout the game. At each period, the sender observes the current st…
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…