Metraipolis › archive › dc_62bf8ea29a99

Complete EFX Allocations Exist for Four Additive Agents and Up to Nine Goods — arXiv:2608.08590

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.08590
License (as archived)
CC0-1.0
Archived
2026-10-19T08:55:45.412Z
SHA-256 of the archived text
62683a910259b74d9bcc1469d0db0e688b63de8752654a9b0c6de0872fb571cb
Stable URL of this page
https://metraipolis.com/documento/dc_62bf8ea29a99

How to cite

Complete EFX Allocations Exist for Four Additive Agents and Up to Nine Goods — arXiv:2608.08590 — arXiv (en), https://arxiv.org/abs/2608.08590 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_62bf8ea29a99 (Metraipolis archive dc_62bf8ea29a99, sha256 62683a910259b74d9bcc1469d0db0e688b63de8752654a9b0c6de0872fb571cb)
BibTeX
@misc{dc62bf8ea29a99,
  title = {Complete EFX Allocations Exist for Four Additive Agents and Up to Nine Goods — arXiv:2608.08590},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.08590},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_62bf8ea29a99; sha256 62683a910259b74d9bcc1469d0db0e688b63de8752654a9b0c6de0872fb571cb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08590. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that every fair-division instance with four agents, additive valuations over the non-negative reals, and at most nine indivisible goods admits a \emph{complete} allocation that is envy-free up to any good in the strong, zero-tolerant sense ($\EFXo$). The case $m=9=n+5$ lies beyond the previously known frontier for complete EFX with four agents ($m\le n+3$). The proof combines a small set of hand-proven reduction lemmas with a machine-verified certificate corpus. The valuation polytope is covered by a collection of smaller polytopes. For each smaller polytope $P$, a family $F$ of allocations is found that contains an $\EFXo$ allocation for every valuation in $P$. The check that $F$ suffices for $P$ is a quantifier-free linear-arithmetic unsatisfiability verdict, re-derived and solved from scratch by an independent certifier, corroborated per clause, and re-verifiable by a independent small third implementation. The $m=8$ case is established twice: by an earlier independent project at that size and as a one-paragraph padding corollary of the $m=9$ theorem. We additionally give a possible explanation why the problem is hard: difficulty concentrates on near-identical valuations, where only ${\approx}0.14\%$ of all $4^9$ allocations are $\EFXo$, and explicit valuation pairs inside a single region force opposite mandatory allocation structure, evidence relevant to the general conjecture independently of any solver stack.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-08-11 in cs.GT).
Categorie arXiv: Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2608.08590 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T08:52:22.677Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).