On the complexity of nucleolus computation for bipartite b-matching games.

Jochen Könemann Justin Toth Felix Zhou

Published in: Theor. Comput. Sci. (2024)

Keyphrases

cooperative game
solution concepts
matching algorithm
matching process
space complexity
game theory
computer games
search range
game theoretic
bipartite graph
graph matching
computational complexity
decision problems
image matching
worst case
computational cost
pattern matching
graph partitioning
upper bound