Topological Conditions for Uniqueness of Equilibrium in Networks
From MaRDI portal
Publication:5704219
DOI10.1287/moor.1040.0122zbMath1082.90010OpenAlexW2123484734MaRDI QIDQ5704219
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1040.0122
Games involving graphs (91A43) Deterministic network models in operations research (90B10) Games with infinitely many players (91A07)
Related Items
Strong equilibrium in cost sharing connection games ⋮ Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ On the Uniqueness of Equilibrium in Atomic Splittable Routing Games ⋮ Excluding Braess’s Paradox in Nonatomic Selfish Routing ⋮ Strategic decentralization in binary choice composite congestion games ⋮ Network topology and the efficiency of equilibrium ⋮ Capacitated network design games ⋮ A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs ⋮ Network topology and equilibrium existence in weighted network congestion games ⋮ Strong equilibrium in network congestion games: increasing versus decreasing costs ⋮ Network characterizations for excluding Braess's paradox ⋮ 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 ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Informational Braess’ Paradox: The Effect of Information on Traffic Congestion ⋮ Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks ⋮ Efficient graph topologies in network routing games ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
