Nash equilibria and the price of anarchy for flows over time
From MaRDI portal
Publication:647485
DOI10.1007/s00224-010-9299-yzbMath1278.91027MaRDI 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
91A10: Noncooperative games
68M10: Network design and communication in computer systems
91A43: Games involving graphs
90B22: Queues and service in operations research
Related Items
Unnamed Item, Unnamed Item, Dynamic Atomic Congestion Games with Seasonal Flows, Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks, Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents, Algorithms for Flows over Time with Scheduling Costs, Computation of Dynamic Equilibria in Series-Parallel Networks, On the Price of Anarchy for Flows over Time, A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows, Dynamic flows with adaptive route choice, Bounding Residence Times for Atomic Dynamic Routings, The complexity of routing with collision avoidance, FIFO and randomized competitive packet routing games, Non-blind strategies in timed network congestion games, Timed network games, Algorithms for flows over time with scheduling costs, Equilibria in routing games with edge priorities, A Stackelberg strategy for routing flow over time, Decentralized utilitarian mechanisms for scheduling games, Dynamic Equilibria in Fluid Queueing 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.
