Reproduce “Anytime Coalition Structure Generation with Worst Case Guarantees” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohme
The authors analyze how to search coalition structures in characteristic-function games without evaluating every partition. Their ordering examines the grand coalition and then structures pairing each coalition with its complement, so every coalition is observed. After 2^(a−1) searches, the worst-case welfare bound is a, and the next search tightens it to a/2. This guarantee assumes nonnegative values for coalitions searched.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.