Strong equilibrium in congestion games
From MaRDI portal
Publication:1378018
DOI10.1006/game.1997.0592zbMath0899.90169OpenAlexW2076641899MaRDI QIDQ1378018
Publication date: 5 February 1998
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/938aa553eee94b965d9b982be178ce0b0962f3f2
Related Items (71)
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents ⋮ A survey of static and dynamic potential games ⋮ Partition Equilibrium Always Exists in Resource Selection Games ⋮ On the Complexity of Pareto-optimal Nash and Strong Equilibria ⋮ Strong mediated equilibrium ⋮ Strong equilibrium in cost sharing connection games ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ Selfish Vector Packing ⋮ On the convergence of multicast games in directed networks ⋮ Congestion games revisited ⋮ CONGESTION GAMES AND POTENTIALS RECONSIDERED ⋮ Network topology and the efficiency of equilibrium ⋮ Computing the strong Nash equilibrium for Markov chains games ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ Coordination Games on Weighted Directed Graphs ⋮ On the complexity of Pareto-optimal Nash and strong equilibria ⋮ Partition equilibrium always exists in resource selection games ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ Coordination games on graphs ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ Selfish bin packing with cardinality constraints ⋮ Equilibria in bottleneck games ⋮ Preference revelation games and strict cores of multiple‐type housing market problems ⋮ Timing matters: online dynamics in broadcast games ⋮ Selfish bin coloring ⋮ Pareto optimal equilibria for selfish bin packing with uniform cost sharing ⋮ The price of anarchy on uniformly related machines revisited ⋮ Capacitated network design games ⋮ Dynamic club formation with coordination ⋮ On singleton congestion games with resilience against collusion ⋮ Network structure and strong equilibrium in route selection games. ⋮ Repeated congestion games with bounded rationality ⋮ Unnamed Item ⋮ Designing fast converging cost sharing methods for multicast transmissions ⋮ Price of stability in survivable network design ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Quality of equilibria for selfish bin packing with cost sharing variants ⋮ Selfish Bin Packing ⋮ A bin packing game with cardinality constraints under the best cost rule ⋮ Selfish vector packing ⋮ 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 ⋮ The intermediate price of anarchy (IPoA) in bin packing games ⋮ Profit sharing with thresholds and non-monotone player utilities ⋮ Approximate Strong Equilibrium in Job Scheduling Games ⋮ A game-theoretical model of the landscape theory ⋮ Acyclicity of improvements in finite game forms ⋮ Selfish bin packing ⋮ Best response dynamics in finite games with additive aggregation ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Exact and approximate equilibria for optimal group network formation ⋮ Competitive routing over time ⋮ Games of competition in a stochastic environment ⋮ Congestion games viewed from M-convexity ⋮ Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness ⋮ Dynamic resource allocation games ⋮ Congestion Games with Variable Demands ⋮ Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy ⋮ The Price of Anarchy on Uniformly Related Machines Revisited ⋮ On existence of equilibrium under social coalition structures ⋮ Strong price of anarchy ⋮ Negotiating team formation using deep reinforcement learning ⋮ Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ Dynamic Resource Allocation Games ⋮ Efficient graph topologies in network routing games ⋮ Strategic basins of attraction, the path dominance core, and network formation games ⋮ Internalization of social cost in congestion games ⋮ On weak Pareto optimality of nonatomic routing networks ⋮ Cooperative congestion games: existence of a Nash-stable coalition structure
Cites Work
This page was built for publication: Strong equilibrium in congestion games
