Reproduce “Revealed Preferences for Matching with Contracts” 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

Daniel Lehmann

The authors model many-to-many matching over finite contracts using each side’s choices from offered sets rather than utility scores or complete rankings. When both sides’ choices satisfy contraction, irrelevance of rejected contracts, and substitutes, their iterative procedure finds a stable agreement in at most |X| rounds and yields an extremal stable outcome; this is a bound on rounds, not choice-computation time.

Summary by alphaXiv.

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