EFX allocations for indivisible chores: matching-based approach
From MaRDI portal
Publication:6546298
DOI10.1007/978-3-031-43254-5_15zbMATH Open1537.91132MaRDI QIDQ6546298
Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto
Publication date: 29 May 2024
Could not fetch data.
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)
Cites Work
- Dividing a cake fairly
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
- Maximum Nash welfare and other stories about EFX
- Rental Harmony: Sperner's Lemma in Fair Division
- How to Cut a Cake Fairly
- Almost Envy-Freeness with General Valuations
- Handbook of Computational Social Choice
- A discrete and bounded envy-free cake cutting protocol for four agents
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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 Q6546298)
