A survey on algorithms for Nash equilibria in finite normal-form games

DOI10.1016/J.COSREV.2023.100613MaRDI QIDQ6554378zbMATH OpenFDO

Authors Hanyu Li, Wenhan Huang, Zhijian Duan, David Henry Mguni, Kun Shao, Jun Wang, Xiaotie Deng

Publication date 12 June 2024

Published in Computer Science Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COSREV.2023.100613

zbMATH Keywords

approximation algorithmsgame theoryNash equilibrium

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Analysis of algorithms (68W40) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Equilibrium refinements (91A11) Algorithmic game theory and complexity (91A68)

Cited in

(7)

• Distributed adaptive Nash equilibrium seeking for networked systems with unknown disturbance and actuator saturation
• Automating approximation analysis for Nash equilibria algorithms in two-player games
• On the optimal mixing problem of approximate Nash equilibria in bimatrix games
• Matrix expressions of symmetric n-player games
• Inefficiency of multiplicative approximate Nash equilibrium for scheduling games
• Finding Nash equilibrium in bimatrix games in zero-error probabilistic polynomial time
• On the optimal mixing problem of approximate Nash equilibria in bimatrix games

This page was built for publication: A survey on algorithms for Nash equilibria in finite normal-form games

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