Network structure and strong equilibrium in route selection games.
From MaRDI portal
Publication:1414825
DOI10.1016/S0165-4896(03)00076-3zbMath1064.91026OpenAlexW1980800623MaRDI QIDQ1414825
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
Related Items
Partition Equilibrium Always Exists in Resource Selection Games ⋮ Strong equilibrium in cost sharing connection games ⋮ Excluding Braess’s Paradox in Nonatomic Selfish Routing ⋮ Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ A Selective Tour Through Congestion Games ⋮ Network topology and the efficiency of equilibrium ⋮ Partition equilibrium always exists in resource selection games ⋮ Unnamed Item ⋮ Capacitated network design games ⋮ Repeated congestion games with bounded rationality ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Greediness and equilibrium in congestion games ⋮ A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs ⋮ Network topology and equilibrium existence in weighted network congestion games ⋮ Strong equilibrium in network congestion games: increasing versus decreasing costs ⋮ Strong Nash equilibrium in games with common and complementary local utilities ⋮ Network characterizations for excluding Braess's paradox ⋮ Approximate Strong Equilibrium in Job Scheduling Games ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Congestion games viewed from M-convexity ⋮ Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy ⋮ Strong price of anarchy ⋮ Informational Braess’ Paradox: The Effect of Information on Traffic Congestion ⋮ Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing ⋮ Efficient graph topologies in network routing games ⋮ Internalization of social cost in congestion games ⋮ Social learning in nonatomic routing games ⋮ On weak Pareto optimality of nonatomic routing networks ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games
Cites Work
