Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings

DOI10.1007/978-3-030-65739-0_15OpenAlexW3121398880MaRDI QIDQ6130889

Ustav Malkov, Vlasta Malkova

Publication date: 3 April 2024

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-65739-0_15

zbMATH Keywords

Nash equilibriummixed strategiesgameLemke-Howson algorithmbimatrixgeneral settingmulti-matrix game

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) (n)-person games, (n>2) (91A06) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Algorithmic game theory and complexity (91A68)

Cites Work

• Unnamed Item
• Polymatrix games and optimization problems
• A global optimization algorithm for solving a four-person game
• A cutting plane algorithm for solving bilinear programs
• Equilibrium Points of Bimatrix Games
• On computational search for Nash equilibrium in hexamatrix games

This page was built for publication: Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings