Constant factor approximation algorithms for coalition structure generation
Coalition structure generation is a central problem in characteristic function games. Most algorithmic work to date can be classified into one of three broad categories: anytime algorithms, design-to-time algorithms and heuristic algorithms [5]. This paper focuses on the former two approaches. Both...
Saved in:
| Published in: | Autonomous agents and multi-agent systems Vol. 23; no. 1; pp. 1 - 17 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Boston
Springer US
01.07.2011
|
| Subjects: | |
| ISSN: | 1387-2532, 1573-7454 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!