A Survey of Uniqueness Results for Selfish Routing

DOI10.1007/978-3-540-72709-5_4zbMath1181.68080OpenAlexW1514675150MaRDI QIDQ3614959

Nahum Shimkin

Publication date: 17 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72709-5_4

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Load Balancing Congestion Games and Their Asymptotic Behavior ⋮ Generalising diagonal strict concavity property for uniqueness of Nash equilibrium ⋮ Load balancing congestion games and their asymptotic behavior

Cites Work

• Unnamed Item
• Avoiding paradoxes in multi-agent competitive routing.
• On the convergence of descent methods for monotone variational inequalities
• Equilibrium points of nonatomic games
• A survey on networking games in telecommunications
• Capacity allocation under noncooperative routing
• How bad is selfish routing?
• On the relationship between Nash—Cournot and Wardrop equilibria
• Multiple Equilibrium Behaviors on Networks
• Avoiding the Braess paradox in non-cooperative networks
• Constrained traffic equilibrium in routing
• Mixed equilibrium (ME) for multiclass routing games
• Optimal routing control: repeated game approach
• 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
• A Social Equilibrium Existence Theorem*
• Routing into two parallel links: Game-theoretic distributed algorithms

This page was built for publication: A Survey of Uniqueness Results for Selfish Routing