Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Sering, Leon"'
We consider a dynamic model of traffic that has received a lot of attention in the past few years. Infinitesimally small agents aim to travel from a source to a destination as quickly as possible. Flow patterns vary over time, and congestion effects
Externí odkaz:
http://arxiv.org/abs/2402.04935
We consider a dynamic model of traffic that has received a lot of attention in the past few years. Users control infinitesimal flow particles aiming to travel from an origin to a destination as quickly as possible. Flow patterns vary over time, and c
Externí odkaz:
http://arxiv.org/abs/2111.06877
The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite very vital research activities on models in both categories, the connect
Externí odkaz:
http://arxiv.org/abs/2105.13202
Autor:
Hertrich, Christoph, Sering, Leon
This paper studies the expressive power of artificial neural networks with rectified linear units. In order to study them as a model of real-valued computation, we introduce the concept of Max-Affine Arithmetic Programs and show equivalence between t
Externí odkaz:
http://arxiv.org/abs/2102.06635
Autor:
Sering, Leon
Motivated by the dynamic traffic assignment problem, we consider flows over time model with deterministic queuing. Dynamic equilibria, called Nash flows over time, have been studied intensively since their introduction by Koch and Skutella in 2009. U
Externí odkaz:
http://arxiv.org/abs/2010.02184
Autor:
Adamik, Antonia, Sering, Leon
In an atomic splittable flow over time game, finitely many players route flow dynamically through a network, in which edges are equipped with transit times, specifying the traversing time, and with capacities, restricting flow rates. Infinitesimally
Externí odkaz:
http://arxiv.org/abs/2010.02148
Autor:
Israel, Jonas, Sering, Leon
Flows over time enable a mathematical modeling of traffic that changes as time progresses. In order to evaluate these dynamic flows from a game theoretical perspective we consider the price of anarchy (PoA). In this paper we study the impact of spill
Externí odkaz:
http://arxiv.org/abs/2007.04218
Autor:
Pham, Hoang Minh, Sering, Leon
Predicting selfish behavior in public environments by considering Nash equilibria is a central concept of game theory. For the dynamic traffic assignment problem modeled by a flow over time game, in which every particle tries to reach its destination
Externí odkaz:
http://arxiv.org/abs/2007.01525
Publikováno v:
Math. Program. 183 (2020) 309-335
We study dynamic network flows and introduce a notion of instantaneous dynamic equilibrium (IDE) requiring that for any positive inflow into an edge, this edge must lie on a currently shortest path towards the respective sink. We measure current shor
Externí odkaz:
http://arxiv.org/abs/1811.07381
Autor:
Sering, Leon, Koch, Laura Vargas
Modeling traffic in road networks is a widely studied but challenging problem, especially under the assumption that drivers act selfishly. A common approach is the deterministic queuing model, for which the structure of dynamic equilibria has been st
Externí odkaz:
http://arxiv.org/abs/1807.05862