Computing Stable Coalitions: Approximation Algorithms for Reward Sharing.
Elliot AnshelevichShreyas SekarPublished in: WINE (2015)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- randomized algorithms
- network design problem
- constant factor approximation
- reinforcement learning
- open shop
- set cover
- primal dual
- np hardness
- approximation ratio
- long run
- coalition formation
- polynomial time approximation
- multi agent systems
- precedence constraints
- disjoint paths