Lower bounds on separation automata for Parity Games.
Alexander KozachinskiyMikhail VyalyiPublished in: CoRR (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- cellular automata
- computer games
- upper and lower bounds
- nash equilibria
- game design
- error correction
- nash equilibrium
- objective function
- quadratic assignment problem
- lower and upper bounds
- game playing
- educational games
- game theory
- worst case
- np hard
- video games
- finite state
- game theoretic
- optimal solution
- probabilistic automata
- coalitional games
- lattice gas
- learning theory
- optimal cost
- perfect information
- lower bounding
- repeated games
- game development
- reinforcement learning
- finite automata
- concept class
- multi agent
- game tree
- linear programming
- serious games