Games on Graphs: A Time-Efficient Algorithm for Solving Finite Reachability and Safety Games.
Christian GiannettiPublished in: CoRR (2024)
Keyphrases
- single pass
- learning algorithm
- computational complexity
- search space
- np hard
- detection algorithm
- high efficiency
- optimization algorithm
- weighted majority
- dynamic programming
- cost function
- k means
- fictitious play
- objective function
- probabilistic model
- expectation maximization
- segmentation algorithm
- preprocessing
- game theory
- planar graphs
- game tree
- pruning strategy
- gradient projection
- undirected graph
- evaluation function
- convergence rate
- monte carlo
- computationally efficient
- linear programming
- optimal solution
- similarity measure