Generic Uniqueness of Equilibrium in Large Crowding Games
From MaRDI portal
Publication:2757640
DOI10.1287/moor.25.3.349.12220zbMath1028.91002OpenAlexW2125772609MaRDI QIDQ2757640
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.25.3.349.12220
Related Items (21)
The complexity of welfare maximization in congestion games ⋮ The uniqueness and well-posedness of vector equilibrium problems with a representation theorem for the solution set ⋮ Bounding the inefficiency of equilibria in nonatomic congestion games ⋮ On the Uniqueness of Equilibrium in Atomic Splittable Routing Games ⋮ Robust perfect equilibrium in large games ⋮ Nonatomic aggregative games with infinitely many types ⋮ A convergence analysis of the price of anarchy in atomic congestion games ⋮ The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. ⋮ Network structure and strong equilibrium in route selection games. ⋮ Generic uniqueness of equilibrium points ⋮ Social optimality and cooperation in nonatomic congestion games. ⋮ Truthful mechanisms for selfish routing and two-parameter agents ⋮ Discounted and finitely repeated minority games with public signals ⋮ Computing solutions of the multiclass network equilibrium problem with affine cost functions ⋮ Price of anarchy for highly congested routing games in parallel networks ⋮ The uniqueness property for networks with several origin-destination pairs ⋮ A geometric approach to the price of anarchy in nonatomic congestion games ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Informational Braess’ Paradox: The Effect of Information on Traffic Congestion ⋮ On the Price of Anarchy of Highly Congested Nonatomic Network Games ⋮ A game-theoretic perspective of deep neural networks
This page was built for publication: Generic Uniqueness of Equilibrium in Large Crowding Games
