36 citations · 98 across the 20 of their papers we have counts for
5 papers · 1 filter
Computing Dynamic User Equilibrium on Large-Scale Networks Without Knowing Global Parameters
Duong Viet Thong, Aviv Gibali, Mathias Staudigl +1
Dynamic user equilibrium (DUE) is a Nash-like solution concept describing an equilibrium in dynamic traffic systems over a fixed planning period. DUE is a challenging class of equi…
Generalized Self-Concordant Analysis of Frank-Wolfe algorithms
Pavel Dvurechensky, Kamil Safin, Shimrit Shtern +1
Projection-free optimization via different variants of the Frank-Wolfe (FW) method has become one of the cornerstones in large scale optimization for machine learning and computati…
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…
Self-Concordant Analysis of Frank-Wolfe Algorithms
Pavel Dvurechensky, Petr Ostroukhov, Kamil Safin +2
Projection-free optimization via different variants of the Frank-Wolfe (FW), a.k.a. Conditional Gradient method has become one of the cornerstones in optimization for machine learn…