Network structure and strong equilibrium in route selection games.

DOI10.1016/S0165-4896(03)00076-3MaRDI QIDQ1414825zbMATH OpenOpenAlexFDO

Authors Ron Holzman, Nissan Law-Yone

Publication date 4 December 2003

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0165-4896(03)00076-3

zbMATH Keywords

EfficiencyNash equilibriumNetworkRoute selection gameStrong equilibrium

Mathematics Subject Classification ID

Games involving graphs (91A43)

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

• A class of games possessing pure-strategy Nash equilibria
• Generic uniqueness of equilibrium in large crowding games
• scientific article; zbMATH DE number 3139273 (Why is no real title available?)
• Strong equilibrium in congestion games
• The network equilibrium problem in integers

Cited in

(32)

• Strong price of anarchy
• Efficient graph topologies in network routing games
• The equilibrium existence of a robust routing game under interval uncertainty
• A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
• Congestion games viewed from M-convexity
• Internalization of social cost in congestion games
• Social learning in nonatomic routing games
• On weak Pareto optimality of nonatomic routing networks
• Approximate strong equilibria in job scheduling games with two uniformly related machines
• Greediness and equilibrium in congestion games
• Network topologies for weakly Pareto optimal nonatomic selfish routing
• Computation of equilibria and the price of anarchy in bottleneck congestion games
• Partition Equilibrium Always Exists in Resource Selection Games
• Excluding Braess's paradox in nonatomic selfish routing
• A selective tour through congestion games
• Graphs and Path Equilibria
• Partition equilibrium always exists in resource selection games
• Repeated congestion games with bounded rationality
• 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
• Informational Braess' paradox: the effect of information on traffic congestion
• scientific article; zbMATH DE number 7378361 (Why is no real title available?)
• Strong Nash equilibrium in games with common and complementary local utilities
• Network characterizations for excluding Braess's paradox
• Balancing Load via Small Coalitions in Selfish Ring Routing Games
• Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
• Approximate Strong Equilibrium in Job Scheduling Games
• Strong equilibrium in cost sharing connection games
• Network topology and the efficiency of equilibrium
• Capacitated network design games
• Congestion games with linearly independent paths: convergence time and price of anarchy

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)