A Metaheuristic Approach to Compute Pure Nash Equilibria
From MaRDI portal
Publication:5111130
DOI10.1007/978-3-319-95104-1_14zbMath1443.91019OpenAlexW2885177425MaRDI QIDQ5111130
No author found.
Publication date: 26 May 2020
Published in: Bioinspired Heuristics for Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-95104-1_14
Mixed integer programming (90C11) Linear programming (90C05) Algorithmic game theory and complexity (91A68) Equilibrium refinements (91A11)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Approximate well-supported Nash equilibria below two-thirds
- Combining simulated annealing with local search heuristics
- An Optimization Approach for Approximate Nash Equilibria
- The complexity of pure Nash equilibria
- The Complexity of Computing a Nash Equilibrium
- Equilibrium Points of Bimatrix Games
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games