Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time.
Jochen KönemannKanstantsin PashkovichJustin TothPublished in: IPCO (2019)
Keyphrases
- cooperative
- game theory
- cooperative game
- solution concepts
- weighted majority
- matching algorithm
- coalitional games
- bipartite graph matching
- game design
- matching process
- computer games
- nash equilibrium
- video games
- computational complexity
- association graph
- matching scheme
- nash equilibria
- image set
- voting scheme
- multi agent
- worst case
- maximum weight
- feature points
- human computation
- np complete
- learning agents
- cooperative learning
- game theoretic
- game playing
- graph matching