Convergence of best-response dynamics in games with conflicting congestion effects

DOI10.1016/j.ipl.2014.07.012zbMath1307.91024OpenAlexW1987025386MaRDI QIDQ477597

Michal Feldman, Tami Tamir

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.07.012

zbMATH Keywords

algorithmsschedulingconvergence ratecongestion gamesbest-response-dynamics

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Evolutionary games (91A22)

Related Items (2)

Capacitated network design games ⋮ The return function: a new computable perspective on Bayesian-Nash equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• Strong equilibrium in cost sharing connection games
• The structure and complexity of Nash equilibria for a selfish routing game
• Congestion games with linearly independent paths: convergence time and price of anarchy
• Potential games
• Efficiency analysis of load balancing games with and without activation costs
• A class of games possessing pure-strategy Nash equilibria
• How bad is selfish routing?
• The complexity of pure Nash equilibria
• Conflicting Congestion Effects in Resource Allocation Games
• Algorithms, games, and the internet
• Algorithmic mechanism design

This page was built for publication: Convergence of best-response dynamics in games with conflicting congestion effects