A Branch-and-Bound Algorithm for Polymatrix Games ϵ-Proper Nash Equilibria Computation.
Slim BelhaizaPublished in: Algorithms (2021)
Keyphrases
- nash equilibria
- branch and bound algorithm
- lower bound
- incomplete information
- game theory
- branch and bound
- stochastic games
- nash equilibrium
- upper bound
- fictitious play
- game theoretic
- lower bounding
- optimal solution
- np hard
- solution concepts
- precedence constraints
- search tree
- combinatorial optimization
- pure strategy
- upper bounding
- randomly generated problems
- single machine scheduling problem
- congestion games
- multiagent learning
- mixed integer linear programming
- mixed strategy
- finding an optimal solution
- worst case
- search space
- computational complexity
- multi agent systems