On the Uniqueness of Equilibrium in Atomic Splittable Routing Games
From MaRDI portal
Publication:3449452
DOI10.1287/moor.2014.0688zbMath1323.91008OpenAlexW2097248836MaRDI QIDQ3449452
Umang Bhaskar, Chien-Chung Huang, Darrell Hoy, Lisa K. Fleischer
Publication date: 4 November 2015
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2014.0688
Noncooperative games (91A10) Applications of game theory (91A80) Deterministic network models in operations research (90B10)
Related Items (5)
Strategic decentralization in binary choice composite congestion games ⋮ Equilibrium computation in resource allocation games ⋮ Unnamed Item ⋮ Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function ⋮ Dynamic Atomic Congestion Games with Seasonal Flows
Cites Work
- Unnamed Item
- Worst-case equilibria
- Stackelberg strategies and collusion in network games with splittable flow
- Combinatorial algorithms on a class of graphs
- Local smoothness and the price of anarchy in splittable congestion games
- Topology of series-parallel networks
- Generic Uniqueness of Equilibrium in Large Crowding Games
- The effect of collusion in congestion games
- The Impact of Oligopolistic Competition in Networks
- The Price of Stability for Network Design with Fair Cost Allocation
- The complexity of pure Nash equilibria
- On the relationship between Nash—Cournot and Wardrop equilibria
- Multiple Equilibrium Behaviors on Networks
- Competitive routing in networks with polynomial costs
- Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Topological Conditions for Uniqueness of Equilibrium in Networks
This page was built for publication: On the Uniqueness of Equilibrium in Atomic Splittable Routing Games
