相关论文: Existence of optima and equilibria for traffic flo…

The first part of this paper contains a brief introduction to conservation law models of traffic flow on a network of roads. Globally optimal solutions and Nash equilibrium solutions are reviewed, with several groups of drivers sharing…

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 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…

The problem of a car following a lead car driven with constant velocity is considered. To derive the governing equations for the following car dynamics a cost functional that ranks the outcomes of different driving strategies is…

We study a class of games with a continuum of players for which Cournot-Nash equilibria can be obtained by the minimisation of some cost, related to optimal transport. This cost is not convex in the usual sense in general but it turns out…

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…

Nash`s classical bargaining solution suggests that n players in a non-cooperative bargaining situation should find a solution that maximizes the product of each player's utility functions. We consider a special case: Suppose that the…

We consider a queuing network that opens at a specified time, where customers are non-atomic and belong to different classes. Each class has its own route, and as is typical in the literature, the costs are a linear function of waiting and…

Given a network with a continuum of users at some origins, suppose that the users wish to reach specific destinations, but that they are not indifferent to the time needed to reach their destination. They may have several possibilities (of…

This paper is concerned with a fluidodynamic model for traffic flow. More precisely, we consider a single conservation law, deduced from conservation of the number of cars, defined on a road network that is a collection of roads with…

Flows over time are a natural way to incorporate flow dynamics that arise in various applications such as traffic networks. In this paper we introduce a natural variant of the deterministic fluid queuing model in which users aim to minimize…

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…

Flows over time have received substantial attention from both an optimization and (more recently) a game-theoretic perspective. In this model, each arc has an associated delay for traversing the arc, and a bound on the rate of flow entering…

We study optimal transport-based distributionally robust optimization problems where a fictitious adversary, often envisioned as nature, can choose the distribution of the uncertain problem parameters by reshaping a prescribed reference…

We consider the platoon matching problem for a set of trucks with the same origin, but different destinations. It is assumed that the vehicles benefit from traveling in a platoon for instance through reduced fuel consumption. The vehicles…

In this study, we analyse the global stability of the equilibrium in a departure time choice problem using a game-theoretic approach that deals with atomic users. We first formulate the departure time choice problem as a strategic game in…

We study a network congestion game of discrete-time dynamic traffic of atomic agents with a single origin-destination pair. Any agent freely makes a dynamic decision at each vertex (e.g., road crossing) and traffic is regulated with given…

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…

In this paper we propose a LWR-like model for traffic flow on networks which allows one to track several groups of drivers, each of them being characterized only by their destination in the network. The path actually followed to reach the…

Authors describe a two-stage traffic assignment model. It contains of two blocks. The first block consists of model for calculating correspondence (demand) matrix, whereas the second block is a traffic assignment model. The first model…