Related papers: Nash Flows Over Time with Tolls
As an example for the optimization of unstable flows, we present an economics-based method for deciding the optimal rates at which vehicles are allowed to enter a highway. It exploits the naturally occuring fluctuations of traffic flow and…
The transition to turbulence in many shear flows proceeds along two competing routes, one linked with finite-amplitude disturbances and the other one originating from a linear instability, as in e.g. boundary layer flows. The dynamical…
Different populations of vehicles travel along a network. Each population has its origin, destination and travel costs - which may well be unbounded. Under the only requirement of the continuity of the travel costs, we prove the existence…
We consider dynamic equilibria for flows over time under the fluid queuing model. In this model, queues on the links of a network take care of flow propagation. Flow enters the network at a single source and leaves at a single sink. In a…
This paper develops a strategic model of trade between two regions in which, depending on the relation among output, financial resources and transportation costs, the adjustment of prices towards an equilibrium is studied. We derive…
We study a game-theoretic variant of the maximum circulation problem. In a flow allocation game, we are given a directed flow network. Each node is a rational agent and can strategically allocate any incoming flow to the outgoing edges.…
How can we design mechanisms to promote efficient use of shared resources? Here, we answer this question in relation to the well-studied class of atomic congestion games, used to model a variety of problems, including traffic routing.…
Routing games are amongst the most studied classes of games. Their two most well-known properties are that learning dynamics converge to equilibria and that all equilibria are approximately optimal. In this work, we perform a stress test…
Suppose customers need to choose when to arrive to a congested queue with some desired service at the end, provided by a single server that operates only during a certain time interval. We study a model where the customers incur not only…
We consider a model of priced resource sharing that combines both queueing behavior and strategic behavior. We study a priority service model where a single server allocates its capacity to agents in proportion to their payment to the…
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. In particular, we assume agents optimize a linear combination…
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…
A multiclass queue with many servers is considered, where customers make a join-or-leave decision upon arrival based on queue length information, without knowing the scheduling policy or the state of other queues. A game theoretic…
A mathematical model describing the flow of two-phase fluids in a bounded container $\Omega$ is considered under the assumption that the phase transition process is influenced by inertial effects. The model couples a variant of the…
Traffic congestion is usually observed at the upper streams of bottlenecks such as tunnels. Congestion appears as stop-and-go waves and high density uniform flow. We perform simulations of traffic flow with a bottleneck using the coupled…
We introduce a diffuse interface model describing the evolution of a mixture of two different viscous incompressible fluids of equal density. The main novelty of the present contribution consists in the fact that the effects of temperature…
How to design tolls that induce socially optimal traffic loads with dynamically arriving travelers who make selfish routing decisions? We propose a two-timescale discrete-time stochastic dynamics that adaptively adjusts the toll prices on a…
We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a…
The increasing global spread of electric vehicles (EVs) has introduced significant interdependence between transportation and power networks. Most of the previous studies on coupled networks focus on the formation of equilibrium states…
Westudy how a planner can design dynamic interventions to overcome status-quo inertia in living temporal games, where strategic agents control their state (active, sleep, partially dead) on a temporal network. Building on the…