The frontier of intractability for EFX with two agents
From MaRDI portal
Publication:6546301
DOI10.1007/978-3-031-43254-5_17zbMATH Open1537.91129MaRDI QIDQ6546301
Kasper Høgh, Alexandros Hollender, Paul W. Goldberg
Publication date: 29 May 2024
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On total functions, existence theorems and computational complexity
- How easy is local search?
- Dividing a cake fairly
- Walrasian equilibrium with gross substitutes
- Gross substitutability: an algorithmic survey
- Combinatorial auctions with decreasing marginal utilities
- Maximum Nash welfare and other stories about EFX
- Rental Harmony: Sperner's Lemma in Fair Division
- Note on Independence Functions
- How to Cut a Cake Fairly
- A Little Charity Guarantees Almost Envy-Freeness
- Closing Gaps in Asymptotic Fair Division
- Almost Envy-Freeness with General Valuations
- A discrete and bounded envy-free cake cutting protocol for four agents
- Optimal assignments in an ordered set: An application of matroid theory
- Matroids and the greedy algorithm
- Sur la division pragmatique
- Fair division of indivisible goods: recent progress and open questions
Related Items (1)
This page was built for publication: The frontier of intractability for EFX with two agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546301)
