Related papers: Demand-Independent Optimal Tolls
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applications, each edge in a network is associated with a certain…
The unreal high flows may appear on the actually congested links in the result when a monotonically increasing link travel time function of flow volume is adopted in traffic assignment. The fixed link flow results of a static traffic…
We introduce an atomic congestion game with two types of agents, cars and trucks, to model the traffic flow on a road over various time intervals of the day. Cars maximize their utility by finding a trade-off between the time they choose to…
In this article, we consider transport networks with uncertain demands. Network dynamics are given by linear hyperbolic partial differential equations and suitable coupling conditions, while demands are incorporated as solutions to…
In this paper, we propose a multi-player extension of the minimum cost flow problem inspired by a transportation problem that arises in modern transportation industry. We associate one player with each arc of a directed network, each trying…
We propose a macroscopic traffic network flow model suitable for analysis as a dynamical system, and we qualitatively analyze equilibrium flows as well as convergence. Flows at a junction are determined by downstream supply of capacity as…
We study an information design problem in transportation networks, in the presence of a random state that affects the travel times on the links. An omniscient system planner -- aiming at reducing congestion -- observes the network state…
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to…
Traffic navigation services have gained widespread adoption in recent years. The route recommendations generated by these services often leads to severe congestion on urban streets, raising concerns from neighboring residents and city…
Existing work has tackled the problem of estimating Origin-Destination (OD) demands and recovering travel latency functions in transportation networks under the Wardropian assumption. The ultimate objective is to derive an accurate…
We revisit a classic coordination problem from the perspective of mechanism design: how can we coordinate a social welfare maximizing flow in a network congestion game with selfish players? The classical approach, which computes tolls as a…
A central question in routing games has been to establish conditions for the uniqueness of the equilibrium, either in terms of network topology or in terms of costs. This question is well understood in two classes of routing games. The…
In this paper, we address the existence and computation of competitive equilibrium in the transportation market for autonomous carpooling first proposed by [Ostrovsky and Schwarz, 2019]. At equilibrium, the market organizes carpooled trips…
In a traffic network, vehicles normally select their routes selfishly. Consequently, traffic networks normally operate at an equilibrium characterized by Wardrop conditions. However, it is well known that equilibria are inefficient in…
Optimality principles in nonequilibrium transport networks are linked to a thermodynamic formalism based on generalized transport potentials endowed with Legendre duality and related contact structure. This allows quantifying the distance…
We address the problem of optimal transport with a quadratic cost functional and a constraint on the flux through a constriction along the path. The constriction, conceptually represented by a toll station, limits the flow rate across. We…
Equilibrium modeling is common in a variety of fields such as game theory and transportation science. The inputs for these models, however, are often difficult to estimate, while their outputs, i.e., the equilibria they are meant to…
Markovian network equilibrium generalizes the classical Wardrop equilibrium in network games. At a Markovian network equilibrium, each player of the game solves a Markov decision process instead of a shortest path problem. We propose two…
Modeling traffic distribution and extracting optimal flows in multilayer networks is of utmost importance to design efficient multi-modal network infrastructures. Recent results based on optimal transport theory provide powerful and…
This paper studies the optimal spatial pricing for a ride-sourcing platform subject to a congestion charge. The platform determines the ride prices over the transportation network to maximize its profit, while the regulatory agency imposes…