Nash equilibria and the price of anarchy for flows over time
From MaRDI portal
Publication:647485
DOI10.1007/s00224-010-9299-yzbMath1278.91027OpenAlexW2106700782MaRDI QIDQ647485
Publication date: 23 November 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9299-y
Noncooperative games (91A10) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Queues and service in operations research (90B22)
Related Items (23)
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents ⋮ Algorithms for Flows over Time with Scheduling Costs ⋮ Dynamic Equilibria in Fluid Queueing Networks ⋮ Computation of Dynamic Equilibria in Series-Parallel Networks ⋮ On the Price of Anarchy for Flows over Time ⋮ Equilibria in bottleneck games ⋮ Equilibria in routing games with edge priorities ⋮ Unnamed Item ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ The complexity of routing with collision avoidance ⋮ A Stackelberg strategy for routing flow over time ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ Unnamed Item ⋮ Dynamic flows with adaptive route choice ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ FIFO and randomized competitive packet routing games ⋮ Bounding Residence Times for Atomic Dynamic Routings ⋮ Non-blind strategies in timed network congestion games ⋮ Timed network games ⋮ Algorithms for flows over time with scheduling costs ⋮ Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive routing over time
- A survey of dynamic network flows
- Efficient continuous-time dynamic network flow algorithms
- Link travel times. I: Desirable properties
- System optimal and user equilibrium time-dependent traffic assignment in congested networks
- Link travel times. II: Properties derived from traffic-flow models
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Queue Spillovers in Transportation Networks with a Route Choice
- An Introduction to Network Flows over Time
- Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
- How bad is selfish routing?
- Equilibria in Dynamic Selfish Routing
- Nash Equilibria and the Price of Anarchy for Flows over Time
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
- Advances in the Continuous Dynamic Network Loading Problem
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models
- Flows over Time with Load-Dependent Transit Times
- Algorithmic Game Theory
- Über ein Paradoxon aus der Verkehrsplanung
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Nash equilibria and the price of anarchy for flows over time
