Complexity and Optimality of the Best Response Algorithm in Random Potential Games.
Stéphane DurandBruno GaujalPublished in: SAGT (2016)
Keyphrases
- worst case
- computational complexity
- space complexity
- experimental evaluation
- preprocessing
- optimal solution
- learning algorithm
- linear programming
- recognition algorithm
- np hard
- linear complexity
- computational cost
- k means
- optimization algorithm
- convergence rate
- times faster
- fictitious play
- matching algorithm
- classification algorithm
- objective function
- significant improvement
- computationally efficient
- simulated annealing
- high accuracy
- single pass
- complexity analysis
- cost function
- exhaustive search
- randomly generated
- improved algorithm
- mobile robot
- segmentation algorithm
- memory requirements
- graph cuts
- monte carlo
- ant colony optimization
- clustering method
- detection algorithm