The Price of Optimum: Complexity and Approximation for a Matching Game.
Bruno EscoffierLaurent GourvèsJérôme MonnotPublished in: Algorithmica (2017)
Keyphrases
- approximation error
- matching algorithm
- nash equilibrium
- graph matching
- worst case
- error tolerance
- game theory
- neural network
- space complexity
- feature points
- pattern matching
- computer games
- video games
- game theoretic
- game playing
- game design
- increase in computational complexity
- closed form
- error bounds
- image matching
- keypoints
- virtual world
- special case
- optimal solution
- multi agent