Reproduce “Cores of $3$-distant convex games” 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

Keisuke Bando, Toshiyuki Hirai, Kenzo Imamura, Ryuhei Mizutani

The paper studies when transferable-utility games with 3-distant convexity can retain tractable core analysis despite local violations of convexity. For this class, core nonemptiness is equivalent to the sum of players’ marginal contributions to the grand coalition being at least its worth. When this test passes, a combinatorial algorithm constructs a core allocation using O(n^2) characteristic-function evaluations and arithmetic operations.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.