A Simple and Efficient Algorithm to Compute Epsilon-Equilibria of Discrete Colonel Blotto Games: Epsilon-Equilibria of Discrete Colonel Blotto Games.
Dong Quan VuPatrick LoiseauAlonso SilvaPublished in: AAMAS (2018)
Keyphrases
- nash equilibria
- fictitious play
- game theory
- game theoretic
- nash equilibrium
- complexity analysis
- detection algorithm
- single pass
- discrete version
- dynamic programming
- k means
- worst case
- computational cost
- preprocessing
- optimal solution
- optimization algorithm
- computationally efficient
- matching algorithm
- theoretical analysis
- discrete tomography
- cost function
- computational complexity
- objective function
- repeated games
- real valued time series
- sequence prediction
- hartley transform
- extensive form games
- neural network
- computational geometry
- continuous attributes
- pruning strategy
- video games
- decision problems
- segmentation algorithm
- particle swarm optimization
- simulated annealing