Dynamic Atomic Congestion Games with Seasonal Flows
From MaRDI portal
Publication:4969328
DOI10.1287/opre.2017.1683zbMath1455.91034arXiv1606.05691OpenAlexW3101642740MaRDI QIDQ4969328
Tristan Tomala, Marc Schröder, Marco Scarsini
Publication date: 5 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.05691
Related Items (7)
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents ⋮ On the Price of Anarchy for Flows over Time ⋮ Equilibria in bottleneck games ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ FIFO and randomized competitive packet routing games ⋮ Bounding Residence Times for Atomic Dynamic Routings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Braess's paradox for flows over time
- Continuous and discrete flows over time
- Nash equilibria and the price of anarchy for flows over time
- Competitive routing over time
- Competitive online multicommodity routing
- Network topology and the efficiency of equilibrium
- Transient flows in networks
- Efficient continuous-time dynamic network flow algorithms
- Potential games
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Equilibrium routing under uncertainty
- Long term behavior of dynamic equilibria in fluid queuing networks
- On the severity of Braess's paradox: designing networks for selfish users is hard
- A Stackelberg strategy for routing flow over time
- A geometric approach to the price of anarchy in nonatomic congestion games
- A class of games possessing pure-strategy Nash equilibria
- The Quickest Transshipment Problem
- Queue Spillovers in Transportation Networks with a Route Choice
- An Introduction to Network Flows over Time
- Dynamic Equilibria in Fluid Queueing Networks
- How bad is selfish routing?
- Fast, Fair, and Efficient Flows in Networks
- The Price of Stability for Network Design with Fair Cost Allocation
- On the Uniqueness of Equilibrium in Atomic Splittable Routing Games
- The Price of Collusion in Series-Parallel Networks
- Equilibria in Dynamic Selfish Routing
- On the relationship between Nash—Cournot and Wardrop equilibria
- Multiple Equilibrium Behaviors on Networks
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- Maximal, Lexicographic, and Dynamic Network Flows
- An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
- Algorithms, games, and the internet
- Constructing Maximal Dynamic Flows from Static Flows
- Nonadaptive Selfish Routing with Online Demands
- Über ein Paradoxon aus der Verkehrsplanung
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- Selfish Routing in Capacitated Networks
- Continuous-Time Flows in Networks
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Dynamic Atomic Congestion Games with Seasonal Flows
