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

DOI10.1016/J.IPL.2014.07.012MaRDI QIDQ477597zbMATH OpenOpenAlexFDO

Authors 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

algorithmsconvergence rateschedulingcongestion gamesbest-response-dynamics

Mathematics Subject Classification ID

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

Recommendations

• The speed of convergence in congestion games under best-response dynamics
• Conflicting congestion effects in resource allocation games
• The Speed of Convergence in Congestion Games under Best-Response Dynamics
• Convergence Dynamics of Graphical Congestion Games
• Convergence issues in congestion games

Cites work

• scientific article; zbMATH DE number 2038734 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• Algorithmic mechanism design
• Algorithms, games, and the internet
• Conflicting congestion effects in resource allocation games
• Congestion games with linearly independent paths: convergence time and price of anarchy
• Convergence to approximate Nash equilibria in congestion games
• Efficiency analysis of load balancing games with and without activation costs
• How bad is selfish routing?
• Potential games
• Selfish load balancing
• Strong equilibrium in cost sharing connection games
• The complexity of pure Nash equilibria
• The structure and complexity of Nash equilibria for a selfish routing game
• Worst-case equilibria

Cited in

(7)

• Convergence Dynamics of Graphical Congestion Games
• Convergence to approximate Nash equilibria in congestion games
• Concurrent imitation dynamics in congestion games
• Capacitated network design games
• Convergence of Ordered Improvement Paths in Generalized Congestion Games
• The return function: a new computable perspective on Bayesian-Nash equilibria
• The speed of convergence in congestion games under best-response dynamics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477597)