Fast convergence of best-reply dynamics in aggregative games

DOI10.1287/MOOR.2017.0868MaRDI QIDQ5219297zbMATH OpenOpenAlexFDO

Authors Yakov Babichenko

Publication date 11 March 2020

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2017.0868

zbMATH Keywords

aggregative gamesbest-reply dynamicsCournot oligopolyfast convergenceNash equilibriumsmall influence games

Mathematics Subject Classification ID

Noncooperative games (91A10) Special types of economic markets (including Cournot, Bertrand) (91B54)

Recommendations

• Best-reply dynamics in large binary-choice anonymous games
• Aggregative games and best-reply potentials
• Better-reply dynamics and global convergence to Nash equilibrium in aggregative games
• Stochastic Learning Dynamics and Speed of Convergence in Population Games
• Convergence to approximate Nash equilibria in congestion games

Cites work

• Aggregative games and best-reply potentials
• Ballot problems
• Best response dynamics in finite games with additive aggregation
• Best-reply dynamics in large binary-choice anonymous games
• Better-reply dynamics and global convergence to Nash equilibrium in aggregative games
• Convergence to approximate Nash equilibria in congestion games
• How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
• scientific article; zbMATH DE number 5485547 (Why is no real title available?)
• scientific article; zbMATH DE number 3255204 (Why is no real title available?)
• scientific article; zbMATH DE number 3310623 (Why is no real title available?)
• Lipschitz games
• Potential games
• Probability inequalities for the sum in sampling without replacement
• Stochastic Learning Dynamics and Speed of Convergence in Population Games
• Strategic complements and substitutes, and potential games
• The complexity of pure Nash equilibria
• The evolutionary stability of perfectly competitive behavior

Cited in

(12)

• On the uniqueness of quantal response equilibria and its application to network games
• Aggregative games and best-reply potentials
• Best-reply dynamics in large binary-choice anonymous games
• Better-reply dynamics and global convergence to Nash equilibrium in aggregative games
• Lower bounds for the query complexity of equilibria in Lipschitz games
• On the relationship between uniqueness and stability in sum-aggregative, symmetric and general differentiable games
• Time Average Replicator and Best-Reply Dynamics
• On best-response dynamics in potential games
• Cournot tatonnement in aggregative games with monotone best responses
• Sequential voting with confirmation network
• Lower bounds for the query complexity of equilibria in Lipschitz games
• Best response dynamics in finite games with additive aggregation

This page was built for publication: Fast convergence of best-reply dynamics in aggregative games

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