Reachability of fair allocations via sequential exchanges

DOI10.1007/S00453-024-01271-YMaRDI QIDQ6647774zbMATH OpenFDO

Authors Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen

Publication date 3 December 2024

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00453-024-01271-Y

zbMATH Keywords

exchangesfair divisionindivisible goodsreachability

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Cites work

• Almost envy-free allocations with connected bundles
• Fair enough: guaranteeing approximate maximin shares
• Finding shortest paths between graph colourings
• Fixed-point cycles and approximate EFX allocations
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• Introduction to reconfiguration
• Introduction to the theory of fair allocation
• On reachable assignments in cycles
• On reachable assignments under dichotomous preferences
• On the complexity of reconfiguration problems
• Relationships between nondeterministic and deterministic tape complexities
• The NP-Completeness of Some Edge-Partition Problems
• The Perfect Matching Reconfiguration Problem
• The price of connectivity in fair division

Cited in

(1)

• Reforming an unfair allocation by exchanging goods

This page was built for publication: Reachability of fair allocations via sequential exchanges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647774)