Metraipolis › archive › dc_2339b60fb8c2

Reconfiguration in Fair Division Revisited — arXiv:2609.15358

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15358
License (as archived)
CC0-1.0
Archived
2026-10-15T23:48:36.242Z
SHA-256 of the archived text
68f48868e7fb277a060326fc226c9d20e6714257c7507c345daedf36eb1943ed
Stable URL of this page
https://metraipolis.com/documento/dc_2339b60fb8c2

How to cite

Reconfiguration in Fair Division Revisited — arXiv:2609.15358 — arXiv (en), https://arxiv.org/abs/2609.15358 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2339b60fb8c2 (Metraipolis archive dc_2339b60fb8c2, sha256 68f48868e7fb277a060326fc226c9d20e6714257c7507c345daedf36eb1943ed)
BibTeX
@misc{dc2339b60fb8c2,
  title = {Reconfiguration in Fair Division Revisited — arXiv:2609.15358},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15358},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2339b60fb8c2; sha256 68f48868e7fb277a060326fc226c9d20e6714257c7507c345daedf36eb1943ed},
  year = {2026}
}

Archived text

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

We revisit reconfiguration in the fair allocation of indivisible goods, where the goal is to transform one fair allocation into another through a sequence of exchanges while preserving fairness at every step. Our focus is on the hierarchy of envy-freeness up to $k$ goods (EF$k$). We show that for any fixed $k$, two EF1 allocations with the same size vector need not admit a reconfiguration path whose intermediate allocations satisfy EF$k$. This impossibility persists even when the two allocations arise from standard EF1 approaches: the envy cycle elimination algorithm or the maximum Nash welfare solution. In contrast, we prove that allocations with the same size vector produced by recursively balanced picking sequences, including round-robin, are always connected via a path that maintains EF2. We also show that deciding whether an EF1 reconfiguration path exists is NP-hard for any fixed number of agents. Furthermore, we complement these exchange-based results by studying a more permissive model that also allows transfers, establishing additional connectivity guarantees.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-15 in cs.GT).
Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.15358 — 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-15T23:17:52.843Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).