A pseudo-quasi-polynomial algorithm for mean-payoff parity games.
Laure DaviaudMarcin JurdzinskiRanko LazicPublished in: LICS (2018)
Keyphrases
- learning algorithm
- dynamic programming
- preprocessing
- times faster
- objective function
- k means
- optimization algorithm
- worst case
- computational cost
- optimal solution
- improved algorithm
- cost function
- experimental evaluation
- game theory
- similarity measure
- detection algorithm
- particle swarm optimization
- convergence rate
- recognition algorithm
- monte carlo
- tree structure
- simulated annealing
- theoretical analysis
- high accuracy
- probabilistic model
- np hard
- input data
- linear programming
- matching algorithm
- search space
- computational complexity
- multi agent
- polynomial size
- weighted majority
- polynomially bounded