3 papers
cs.GT2020
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…
math.OC2020
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…
math.OC2019
Strong Convergence of Forward-Backward-Forward Methods for Pseudo-monotone Variational Inequalities with Applications to Dynamic User Equilibrium in Traffic Networks
Benoit Duvocelle, Dennis Meier, Mathias Staudigl +1
In infinite-dimensional Hilbert spaces we device a class of strongly convergent primal-dual schemes for solving variational inequalities defined by a Lipschitz continuous and pseud…