A near-optimal algorithm for finite partial-monitoring games against adversarial opponents.
Gábor BartókPublished in: COLT (2013)
Keyphrases
- preprocessing
- computational cost
- detection algorithm
- cost function
- learning algorithm
- matching algorithm
- np hard
- optimization algorithm
- worst case
- high accuracy
- segmentation algorithm
- times faster
- monitoring system
- particle swarm optimization
- simulated annealing
- experimental evaluation
- computational complexity
- lower bound
- multiagent systems
- tree structure
- monte carlo
- similarity measure
- image segmentation