Nash equilibria and the price of anarchy for flows over time
From MaRDI portal
Publication:647485
DOI10.1007/S00224-010-9299-YzbMATH Open1278.91027OpenAlexW2106700782MaRDI QIDQ647485FDOQ647485
Authors: Ronald Koch, Martin Skutella 
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
Recommendations
Queues and service in operations research (90B22) Noncooperative games (91A10) Games involving graphs (91A43) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Algorithmic Game Theory
- Title not available (Why is that?)
- How bad is selfish routing?
- Title not available (Why is that?)
- Über ein Paradoxon aus der Verkehrsplanung
- A suggested computation for maximal multi-commodity network flows
- Queue spillovers in transportation networks with a route choice
- Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
- 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
- Combinatorial optimization. Theory and algorithms.
- Efficient continuous-time dynamic network flow algorithms
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- Link travel times. I: Desirable properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- System optimal and user equilibrium time-dependent traffic assignment in congested networks
- An introduction to network flows over time
- A survey of dynamic network flows
- Title not available (Why is that?)
- Nash equilibria and the price of anarchy for flows over time
- Link travel times. II: Properties derived from traffic-flow models
- Equilibria in dynamic selfish routing
- An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
- Flows over Time with Load-Dependent Transit Times
- Competitive routing over time
Cited In (33)
- Nash flows over time with spillback
- Timed network games with clocks
- Decentralized utilitarian mechanisms for scheduling games
- The impact of spillback on the price of anarchy for flows over time
- Non-blind strategies in timed network congestion games
- Timed network games
- Algorithms for flows over time with scheduling costs
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- A Stackelberg strategy for routing flow over time
- Bounding Residence Times for Atomic Dynamic Routings
- Multi-source multi-sink Nash flows over time
- Dynamic flows with adaptive route choice
- Timed network games
- Equilibria in routing games with edge priorities
- Dynamic Atomic Congestion Games with Seasonal Flows
- Long-term behavior of dynamic equilibria in fluid queuing networks
- Nash flows over time
- Bicriteria Nash flows over time
- Algorithms for Flows over Time with Scheduling Costs
- Dynamic equilibria in fluid queueing networks
- The complexity of routing with collision avoidance
- Atomic dynamic flow games: adaptive vs. nonadaptive agents
- A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
- A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
- Equilibria in bottleneck games
- AN INDIVIDUAL AND SOCIALLY OPTIMAL POLICY MINIMIZING EXPECTED FLOW TIMES
- Routing games over time with FIFO policy
- On the price of anarchy for flows over time
- Nash equilibria and the price of anarchy for flows over time
- Computing the price of anarchy in atomic network congestion games (invited talk)
- Computation of Dynamic Equilibria in Series-Parallel Networks
- FIFO and randomized competitive packet routing games
- Equilibria in dynamic selfish routing
Uses Software
This page was built for publication: Nash equilibria and the price of anarchy for flows over time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647485)
