2 citations · 4 across the 17 of their papers we have counts for
4 papers · 1 filter
Games characterizing limsup functions and Baire class 1 functions
Márton Elekes, János Flesch, Viktor Kiss +3
We consider a real-valued function defined on the set of infinite branches of a countably branching pruned tree . The function is said to be a \textit{limsup functio…
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…
Search for a moving target in a competitive environment
Benoit Duvocelle, János Flesch, Hui Min Shi +1
We consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine…
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…