Pure Nash equilibria in a generalization of congestion games allowing resource failures

DOI10.1007/978-3-030-85947-3_13zbMath1492.91038OpenAlexW3200490519MaRDI QIDQ2670923

Julian Nickerl, Jacobo Toran

Publication date: 1 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85947-3_13

zbMATH Keywords

Nash equilibriumfailurePLS\#Pcongestion game

Mathematics Subject Classification ID

Potential and congestion games (91A14) Algorithmic game theory and complexity (91A68)

Related Items (1)

On the impact of player capability on congestion games

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Congestion games with failures
• Congestion games with load-dependent failures: Identical resources
• The complexity of optimization problems
• How easy is local search?
• Potential games
• Taxed congestion games with failures
• A class of games possessing pure-strategy Nash equilibria
• Stochastic Congestion Games with Risk-Averse Players
• Stochastic Selfish Routing
• Random Order Congestion Games
• Simple Local Search Problems that are Hard to Solve
• PP is as Hard as the Polynomial-Time Hierarchy
• On the impact of combinatorial structure on congestion games
• The complexity of pure Nash equilibria
• Malicious Bayesian Congestion Games
• Algorithmic Game Theory

This page was built for publication: Pure Nash equilibria in a generalization of congestion games allowing resource failures