Related papers: Demand-Independent Optimal Tolls
With autonomous vehicles now sharing roads with human drivers, the era of mixed autonomy brings new challenges in dealing with congestion. One cause of congestion is when vehicle users choose their routes selfishly to minimize their…
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area with location and congestion dependent costs. We study both…
We consider team zero-sum network congestion games with $n$ agents playing against $k$ interceptors over a graph $G$. The agents aim to minimize their collective cost of sending traffic over paths in $G$, which is an aggregation of edge…
We consider a largely untapped potential for the improvement of traffic networks that is rooted in the inherent uncertainty of travel times. Travel times are subject to stochastic uncertainty resulting from various parameters such as…
We present an economics-based method for deciding the optimal rates at which vehicles are allowed to enter a highway. The method exploits the naturally occuring fluctuations of traffic flow and is flexible enough to adapt in real time to…
Are rewards or penalties more effective in influencing user behavior? This work compares the effectiveness of subsidies and tolls in incentivizing users in congestion games. The predominantly studied method of influencing user behavior in…
We develop an algorithm that computes for a given undirected or directed network with flow-dependent piece-wise linear edge cost functions all Wardrop equilibria as a function of the flow demand. Our algorithm is based on Katzenelson's…
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.…
Global infrastructure robustness and local transport efficiency are critical requirements for transportation networks. However, since passengers often travel greedily to maximize their own benefit and trigger traffic jams, overall…
This study investigates an adaptive pricing scheme aimed at achieving an efficient state in a traffic congestion game characterized by a diverse population of road users. While the planner possesses knowledge of players' preferences, their…
Navigation apps have become pervasive in providing real-time route recommendations to travelers willing to minimize their travel times. However, such technologies introduce new complexities, raising concerns about their overall impact on…
Congestion externalities are a well-known phenomenon in transportation and communication networks, healthcare etc. Optimization by self-interested agents in such settings typically results in equilibria which are sub-optimal for social…
We study a market mechanism that sets edge prices to incentivize strategic agents to efficiently share limited network capacity. In this market, agents form coalitions, with each coalition sharing a unit capacity of a selected route and…
We define a minimal model of traffic flows in complex networks containing the most relevant features of real routing schemes, i.e. a trade--off strategy between topological-based and traffic-based routing. The resulting collective behavior,…
When optimizing transportation systems, anticipating traffic flows is a central element. Yet, computing such traffic equilibria remains computationally expensive. Against this background, we introduce a novel combinatorial optimization…
Traffic congestion has dire economic and social impacts in modern metropolitan areas. To address this problem, in this paper we introduce a novel type of model-free transactive controllers to manage vehicle traffic in highway networks for…
Previously, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grid and supply chain…
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…
We have revealed general physical conditions for the {\it maximization} of the network throughput at which free flow conditions are ensured, i.e., traffic breakdown cannot occur in the whole traffic or transportation network. A physical…
How is efficiency affected when demand excesses over supply are signalled through waiting in queues? We consider a class of congestion games with a nonatomic set of players of a constant mass, based on a formulation of generic linear…