Reachability of fair allocations via sequential exchanges

DOI10.1007/s00453-024-01271-yMaRDI QIDQ6647774

Could not fetch data.

Publication date: 3 December 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

reachabilityfair divisionindivisible goodsexchanges

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Finding shortest paths between graph colourings
• On the complexity of reconfiguration problems
• Almost envy-free allocations with connected bundles
• Introduction to reconfiguration
• Relationships between nondeterministic and deterministic tape complexities
• On reachable assignments in cycles
• The NP-Completeness of Some Edge-Partition Problems
• Fair Enough
• The Perfect Matching Reconfiguration Problem
• Introduction to the Theory of Fair Allocation
• The Price of Connectivity in Fair Division
• On reachable assignments under dichotomous preferences
• Fixed-point cycles and approximate EFX allocations

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)