Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
From MaRDI portal
Publication:5388026
DOI10.1287/moor.1060.0229zbMath1276.91038OpenAlexW2127478912MaRDI QIDQ5388026
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f48b62bd1b7799faaaa157c0199ca35d4e080439
Noncooperative games (91A10) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Games involving topology, set theory, or logic (91A44) Games with infinitely many players (91A07)
Related Items (18)
Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ On the Uniqueness of Equilibrium in Atomic Splittable Routing Games ⋮ A game-theoretic analysis of bandwidth allocation under a user-grouping constraint ⋮ Strategic decentralization in binary choice composite congestion games ⋮ Equilibrium computation in resource allocation games ⋮ Coalitions in Nonatomic Network Congestion Games ⋮ A tight characterization of strategic games with a unique equilibrium ⋮ Unnamed Item ⋮ Decentralized bandwidth control subject to two-layer constraints ⋮ Network topology and equilibrium existence in weighted network congestion games ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ Congestion games viewed from M-convexity ⋮ A Survey of Uniqueness Results for Selfish Routing ⋮ The uniqueness property for networks with several origin-destination pairs ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Fragility of the commons under prospect-theoretic risk attitudes ⋮ Generalising diagonal strict concavity property for uniqueness of Nash equilibrium ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
This page was built for publication: Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
