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