On the Complexity of Nucleolus Computation for Bipartite b-Matching Games.
Jochen KönemannJustin TothFelix ZhouPublished in: CoRR (2021)
Keyphrases
- cooperative game
- matching process
- solution concepts
- search range
- worst case
- matching algorithm
- data sets
- graph matching
- imperfect information
- space complexity
- real valued
- video games
- game theory
- decision problems
- bipartite graph
- game play
- game theoretic
- computational complexity
- computer vision
- image matching
- nash equilibrium
- pattern matching
- serious games
- upper bound
- game tree
- nash equilibria
- image sequences
- neural network