Nash equilibria and the price of anarchy for flows over time
From MaRDI portal
(Redirected from Publication:647485)
Recommendations
Cites work
- scientific article; zbMATH DE number 1714716 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 1024734 (Why is no real title available?)
- scientific article; zbMATH DE number 2096636 (Why is no real title available?)
- scientific article; zbMATH DE number 6469241 (Why is no real title available?)
- scientific article; zbMATH DE number 956788 (Why is no real title available?)
- A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- A suggested computation for maximal multi-commodity network flows
- A survey of dynamic network flows
- Advances in the Continuous Dynamic Network Loading Problem
- Algorithmic Game Theory
- An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
- An introduction to network flows over time
- Combinatorial optimization. Theory and algorithms.
- Competitive routing over time
- Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
- Efficient continuous-time dynamic network flow algorithms
- Equilibria in dynamic selfish routing
- Flows over Time with Load-Dependent Transit Times
- How bad is selfish routing?
- Link travel times. I: Desirable properties
- Link travel times. II: Properties derived from traffic-flow models
- Nash equilibria and the price of anarchy for flows over time
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- Queue spillovers in transportation networks with a route choice
- System optimal and user equilibrium time-dependent traffic assignment in congested networks
- Über ein Paradoxon aus der Verkehrsplanung
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
- A Stackelberg strategy for routing flow over time
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- 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
- Nash equilibria and the price of anarchy for flows over time
- On the price of anarchy for flows over time
- FIFO and randomized competitive packet routing games
- Computing the price of anarchy in atomic network congestion games (invited talk)
- Computation of Dynamic Equilibria in Series-Parallel Networks
- Equilibria in dynamic selfish routing
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)
