Topological Conditions for Uniqueness of Equilibrium in Networks
From MaRDI portal
Recommendations
- Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
- The uniqueness property for networks with several origin-destination pairs
- A Survey of Uniqueness Results for Selfish Routing
- scientific article; zbMATH DE number 1841944
- Network topology and the efficiency of equilibrium
Cited in
(30)- Efficient graph topologies in network routing games
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Congestion games viewed from M-convexity
- Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks
- Characterization of layer-2 unique topologies
- Mixed Nash equilibria in selfish routing problems with dynamic constraints
- The uniqueness property for networks with several origin-destination pairs
- The price of anarchy in nonatomic consumption-relevance congestion games
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Investigating factors for existence of multiple equilibria in dynamic traffic network
- Strategic decentralization in binary choice composite congestion games
- Network topology and the efficiency of equilibrium
- On the uniqueness of equilibrium in atomic splittable routing games
- Excluding Braess's paradox in nonatomic selfish routing
- A Survey of Uniqueness Results for Selfish Routing
- Equilibria and convex cost networks
- Equilibria for Networks with Lower Semicontinuous Costs: With an Application to Congestion Pricing
- scientific article; zbMATH DE number 1841944 (Why is no real title available?)
- Network topology and equilibrium existence in weighted network congestion games
- Strong equilibrium in network congestion games: increasing versus decreasing costs
- Informational Braess' paradox: the effect of information on traffic congestion
- Network characterizations for excluding Braess's paradox
- On the existence of pure Nash equilibria in weighted congestion games
- Monotonicity of equilibria in nonatomic congestion games
- Complexity and parametric computation of equilibria in atomic splittable congestion games via weighted block Laplacians
- Potential in population games
- Strong equilibrium in cost sharing connection games
- Network topology and the efficiency of equilibrium
- Capacitated network design games
This page was built for publication: Topological Conditions for Uniqueness of Equilibrium in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704219)
