On the Complexity of Nucleolus Computation for Bipartite b-Matching Games.
Jochen KönemannJustin TothFelix ZhouPublished in: SAGT (2021)
Keyphrases
- cooperative game
- game theory
- solution concepts
- matching algorithm
- computational complexity
- search range
- computer games
- pattern matching
- matching process
- video games
- computational cost
- worst case
- motion estimation
- multi agent systems
- decision problems
- shape matching
- image matching
- game design
- game theoretic
- nash equilibria
- object recognition