Equilibrium computation in discrete network games

DOI10.3982/QE1386MaRDI QIDQ4991629zbMATH OpenOpenAlexFDO

Authors Michael P. Leung

Publication date 3 June 2021

Published in Quantitative Economics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.3982/qe1386

zbMATH Keywords

empirical gamesgraphical gamesmultiple equilibrianetwork formation

Mathematics Subject Classification ID

Equilibrium refinements (91A11) Games involving graphs (91A43)

Recommendations

• An algorithm for finding Nash equilibria in dynamic network games
• Equilibrium computation for two-player games in strategic and extensive form
• Computing equilibrium in network utility-sharing and discrete election games
• Pairwise-interaction games
• Finding all equilibria in games of strategic complements

Cited in

(6)

• Computing equilibrium in network utility-sharing and discrete election games
• An algorithm for finding Nash equilibria in dynamic network games
• A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies
• The computation of pairwise stable networks
• Computation of Nash equilibria of attack and defense games on networks
• Computing perfect pairwise stable networks

This page was built for publication: Equilibrium computation in discrete network games

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