Effectiveness of Nash Equilibrium Search Algorithms in Four-Person Games in General and Multi-matrix Settings
- 1 January 2020
- book chapter
- Published by Springer Nature
- p. 198-208
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Lemke–Howson Algorithm Solving Finite Non-Cooperative Three-Person Games in a Special SettingDEStech Transactions on Computer Science and Engineering, 2019
- A global optimization algorithm for solving a four-person gameOptimization Letters, 2017
- On computational search for Nash equilibrium in hexamatrix gamesOptimization Letters, 2014
- Polymatrix games and optimization problemsAutomation and Remote Control, 2014
- A cutting plane algorithm for solving bilinear programsMathematical Programming, 1976
- Equilibrium Points of Bimatrix GamesJournal of the Society for Industrial and Applied Mathematics, 1964