Related papers: Nash Flows Over Time with Tolls
In this paper, we are interested in the dynamics of charged particles interacting with the incompressible viscous flow. More precisely, we consider the Vlasov-Poisson or Vlasov-Poisson-Fokker-Planck equation coupled with the incompressible…
In this paper, we investigate a system coupled by nonhomogeneous incompressible Navier-Stokes equations and Allen-Cahn equations describing a diffuse interface for two-phase flow of viscous fluids with different densities in a bounded…
The dynamic pricing problem of a freeway corridor with high-occupancy toll (HOT) lanes was formulated and solved based on a point queue abstraction of the traffic system [Yin and Lou, 2009]. However, existing pricing strategies cannot…
Capacity drop at active bottlenecks is one of the most puzzling traffic phenomena, but a thorough understanding is practically important for designing variable speed limit and ramp metering strategies. In this study, we attempt to develop a…
In this paper we present a stable day-to-day dynamical system for drivers' departure time choice at a single bottleneck. We first define within-day traffic dynamics with the point queue model, costs, the departure time user equilibrium…
A simple algorithm for constructing an effective traffic model is presented. The algorithm uses statistically well-defined quantities extracted from the flow-density plot, and the resulting effective model naturally captures and predicts…
Traffic congestion continues to escalate with urbanization and socioeconomic development, necessitating advanced modeling to understand and mitigate its impacts. In large-scale networks, traffic congestion can be studied using cascade…
We prove that every finite two-person shortest path game, where the local cost of every move is positive for each player, has a Nash equilibrium (NE) in pure stationary strategies, which can be computed in polynomial time. We also extend…
The residual queue during a given study period (e.g., peak hour) is an important feature that should be considered when solving a traffic assignment problem under equilibrium for strategic traffic planning. Although studies have focused…
In this paper, we investigate the non-signalized intersection issue considering traffic flow and energy dissipation in terms of game theory based on the Nagel-Schreckenberg (NaSch) model. There are two types of driver agents at the…
We study a class of games in which a finite number of agents each controls a quantity of flow to be routed through a network, and are able to split their own flow between multiple paths through the network. Recent work on this model has…
We investigate the correspondence between a non-equilibrium ensemble defined via the distribution of phase-space paths of a Hamiltonian system, and a system driven into a steady-state by non-equilibrium boundary conditions. To discover…
We study phase transitions of a system of particles on the one-dimensional integer lattice moving with constant acceleration, with a collision law respecting slower particles. This simple deterministic ``particle-hopping'' traffic flow…
Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network, in…
Charge transport through a nanoscale junction coupled to two macroscopic electrodes is investigated for the situation when bound states are present. We provide numerical evidence that bound states give rise to persistent, non-decaying…
The present paper proposes a stochastic model of the traffic flow. This model has a discrete set of states and the continuous time. The model is a generalization of the discrete stochastis model that has been considered in a previous paper…
When considering a general system of equations describing the space-time evolution (flow) of one or several variables, the problem of the optimization over a finite period of time of a measure of the state variable at the final time is a…
We investigate traffic routing both from the perspective of theory as well as real world data. First, we introduce a new type of games: $\theta$-free flow games. Here, commuters only consider, in their strategy sets, paths whose free-flow…
Advanced measurement techniques and high performance computing have made large data sets available for a wide range of turbulent flows that arise in engineering applications. Drawing on this abundance of data, dynamical models can be…
We address a multi-class traffic model, for which we computationally assess the ability of mean-field games (MFGs) to yield approximate Nash equilibria for traffic flow games of intractable large finite-players. We introduce ad hoc…