AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Analysis of One-to-One Matching Mechanisms via SAT Solving: Impossibilities for Universal Axioms

Ulle Endriss

AAAI 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Fair division of indivisible goods

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use preservation theorem to reduce impossibility proof to n=3 base case checked by SAT solvermatching mechanism axioms · Theorem 5 and 6proof resources: 64s MUS for Theorem 5, 19s for Theorem 6Improved
lower bound from n>=3 to n>=2 for Theorem 5 and 6 (ablation)impossibility theorems · matching mechanismsimpossibility holdsHurt
weaken two-way strategyproofness to one-way strategyproofness (ablation)Theorem 5 · matching mechanismsimpossibility holdsHurt
weaken stability to top-stability (ablation)Theorem 6 · matching mechanismsimpossibility holdsHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy