On the uniqueness of equilibrium in atomic splittable routing games
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7051244
- Load balancing congestion games and their asymptotic behavior
- Load balancing congestion games and their asymptotic behavior
- Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
Cites work
- Combinatorial algorithms on a class of graphs
- Competitive routing in networks with polynomial costs
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Generic uniqueness of equilibrium in large crowding games
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Local smoothness and the price of anarchy in splittable congestion games
- Multiple Equilibrium Behaviors on Networks
- On the relationship between Nash—Cournot and Wardrop equilibria
- Stackelberg strategies and collusion in network games with splittable flow
- The complexity of pure Nash equilibria
- 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
- Topological Conditions for Uniqueness of Equilibrium in Networks
- Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
- Topology of series-parallel networks
- Worst-case equilibria
Cited in
(11)- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Load balancing congestion games and their asymptotic behavior
- Equilibrium computation in resource allocation games
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Strategic decentralization in binary choice composite congestion games
- Load balancing congestion games and their asymptotic behavior
- Dynamic Atomic Congestion Games with Seasonal Flows
- scientific article; zbMATH DE number 7378728 (Why is no real title available?)
- Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
- Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
- Complexity and parametric computation of equilibria in atomic splittable congestion games via weighted block Laplacians
This page was built for publication: On the uniqueness of equilibrium in atomic splittable routing games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449452)
