Coalitions in Nonatomic Network Congestion Games
From MaRDI portal
Publication:2925351
DOI10.1287/moor.1120.0552zbMath1297.91038arXiv1203.5822OpenAlexW2122683636MaRDI QIDQ2925351
Publication date: 21 October 2014
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.5822
coalitioncomposite gamerouting gameWardrop equilibriumnetwork congestion gamenonatomic gameatomic splittable gamecomposite equilibrium
Noncooperative games (91A10) Games involving graphs (91A43) Games with infinitely many players (91A07)
Related Items (5)
Nonatomic aggregative games with infinitely many types ⋮ Strategic decentralization in binary choice composite congestion games ⋮ Collusion in atomic splittable routing games ⋮ “Beat-Your-Rival” Routing Games ⋮ Finite composite games: equilibria and dynamics
Cites Work
- The effect of collusion in congestion games
- The Impact of Oligopolistic Competition in Networks
- On the relationship between Nash—Cournot and Wardrop equilibria
- Multiple Equilibrium Behaviors on Networks
- Equilibria on a Congested Transportation Network
- Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
This page was built for publication: Coalitions in Nonatomic Network Congestion Games
