EFX allocations for indivisible chores: matching-based approach
From MaRDI portal
Publication:6658304
DOI10.1016/j.tcs.2024.115010MaRDI QIDQ6658304
Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto
Publication date: 8 January 2025
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximizing Nash product social welfare in allocating indivisible goods
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
- Maximum Nash welfare and other stories about EFX
- Almost Envy-Freeness with General Valuations
- Handbook of Computational Social Choice
- Sur la division pragmatique
- On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
- Extension of Additive Valuations to General Valuations on the Existence of EFX.
- Fair division of indivisible goods: recent progress and open questions
- Approximately EFX allocations for indivisible chores
- EFX allocations exist for binary valuations
- Fair allocation of a multiset of indivisible items
This page was built for publication: EFX allocations for indivisible chores: matching-based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658304)
