Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents
From MaRDI portal
Publication:5031653
DOI10.1287/opre.2021.2105zbMath1484.91077OpenAlexW3158427330MaRDI QIDQ5031653
Changjun Wang, Zhigang Cao, Bo Chen, Xu-jin Chen
Publication date: 16 February 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/143835/7/WRAP-Atomic-dynamic-flow-games-adaptive-nonadaptive-agents-Chen-2020.pdf
Nash equilibriumadaptive routingsubgame perfect equilibriumdeterministic queuingselfish atomic routing
Games involving graphs (91A43) Games with infinitely many players (91A07) Equilibrium refinements (91A11)
Related Items (1)
Cites Work
- Braess's paradox for flows over time
- Existence of optima and equilibria for traffic flow on networks
- Nash equilibria and the price of anarchy for flows over time
- Competitive routing over time
- Optima and equilibria for traffic flow on networks with backward propagating queues
- Strong equilibrium in congestion games
- A strategic model for dynamic traffic assignment
- Long term behavior of dynamic equilibria in fluid queuing networks
- Queue Spillovers in Transportation Networks with a Route Choice
- Dynamic Equilibria in Fluid Queueing Networks
- How bad is selfish routing?
- A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks
- Equilibria in Dynamic Selfish Routing
- Nash Equilibria and the Price of Anarchy for Flows over Time
- Routing Games over Time with FIFO Policy
- Dynamic Atomic Congestion Games with Seasonal Flows
- Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks
- The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing
- An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem
- Nash Flows Over Time with Spillback
- Robust Price of Anarchy Bounds via LP and Fenchel Duality
- Dynamic flows with adaptive route choice
This page was built for publication: Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents
