On computational search for Nash equilibrium in hexamatrix games.
Andrei V. OrlovAlexander S. StrekalovskyS. BatbilegPublished in: Optim. Lett. (2016)
Keyphrases
- nash equilibrium
- game theory
- nash equilibria
- game theoretic
- solution concepts
- fictitious play
- mixed strategy
- stackelberg game
- pure strategy
- pareto optimal
- variational inequalities
- regret minimization
- repeated games
- search algorithm
- stochastic games
- equilibrium strategies
- cooperative
- search space
- general sum games
- von neumann
- game tree
- dynamic environments
- worst case
- multi agent systems
- genetic algorithm
- pure nash equilibria