Network structure and strong equilibrium in route selection games.
From MaRDI portal
Recommendations
- A game-theoretic approach to network equilibrium
- Nash equilibrium and stability in network selection games
- Network topology and equilibrium existence in weighted network congestion games
- Strong equilibrium in network congestion games: increasing versus decreasing costs
- Equilibrium games in networks
- Equilibrium refinements for the network formation game
- Equilibria in Networks
- The structure and complexity of Nash equilibria for a selfish routing game
- scientific article; zbMATH DE number 2086616
- scientific article; zbMATH DE number 1908192
Cites work
Cited in
(32)- Approximate strong equilibria in job scheduling games with two uniformly related machines
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Balancing Load via Small Coalitions in Selfish Ring Routing Games
- Excluding Braess's paradox in nonatomic selfish routing
- The equilibrium existence of a robust routing game under interval uncertainty
- Strong price of anarchy
- Graphs and Path Equilibria
- Nash equilibrium and stability in network selection games
- Congestion games viewed from M-convexity
- Repeated congestion games with bounded rationality
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- Strong equilibrium in cost sharing connection games
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- scientific article; zbMATH DE number 7378361 (Why is no real title available?)
- Strong equilibrium in network congestion games: increasing versus decreasing costs
- Network topology and the efficiency of equilibrium
- Efficient graph topologies in network routing games
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Capacitated network design games
- Internalization of social cost in congestion games
- A selective tour through congestion games
- Approximate Strong Equilibrium in Job Scheduling Games
- Strong Nash equilibrium in games with common and complementary local utilities
- Partition equilibrium always exists in resource selection games
- Partition Equilibrium Always Exists in Resource Selection Games
- Informational Braess' paradox: the effect of information on traffic congestion
- Greediness and equilibrium in congestion games
- Social learning in nonatomic routing games
- On weak Pareto optimality of nonatomic routing networks
- Network characterizations for excluding Braess's paradox
- Network topology and equilibrium existence in weighted network congestion games
- Network topologies for weakly Pareto optimal nonatomic selfish routing
This page was built for publication: Network structure and strong equilibrium in route selection games.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1414825)
