mlsanityData to 14 Oct 2026

Fair Division with Market Values

arXiv 2410.23137 ↗First posted 30 Oct 2024cs.GT cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

We introduce a model of fair division with market values, where indivisible goods must be partitioned among agents with (additive) subjective valuations, and each good additionally has a market value. The market valuation can be viewed as a separate additive valuation that holds identically across all the agents. We seek allocations that are simultaneously fair with respect to the subjective valuations and with respect to the market valuation. We show that an allocation that satisfies stochastically-dominant envy-freeness up to one good (SD-EF1) with respect to both the subjective valuations and the market valuation does not always exist, but the weaker guarantee of EF1 with respect to the subjective valuations along with SD-EF1 with respect to the market valuation can be guaranteed. We also study a number of other guarantees such as Pareto optimality, EFX, and MMS. In addition, we explore non-additive valuations and extend our model to cake-cutting. Along the way, we identify several tantalizing open questions.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 18 of its 35 references that are in the map. First posted on arXiv 30 Oct 2024.

Builds on

18 of 35 references.

References · 18

  1. 2020FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platformscited by 78
  2. 2016Fair Public Decision Makingcited by 21
  3. 2020Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocationcited by 15
  4. 2019A Little Charity Guarantees Almost Envy-Freenesscited by 12
  5. 2018Fair Division Under Cardinality Constraintscited by 11
  6. 2019Almost Envy-Freeness in Group Resource Allocationcited by 9
  7. 2019Equitable Allocations of Indivisible Goodscited by 9
  8. 2016A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agentscited by 8
  9. 2023Breaking the 3/4 Barrier for Approximate Maximin Sharecited by 7
  10. 2023Fair Division with Allocator's Preferencecited by 7
  11. 2021Two-Sided Matching Meets Fair Divisioncited by 5
  12. 2022Fair Division with Two-Sided Preferencescited by 4
6 more
  1. 2022Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goodscited by 3
  2. 2020On Fair Division under Heterogeneous Matroid Constraintscited by 2
  3. 2022Finding Fair Allocations under Budget Constraintscited by 2
  4. 2015Monotonicity and Competitive Equilibrium in Cake-cuttingcited by 1
  5. 2016Continuity Assumptions in Cake-Cuttingcited by 1
  6. 2019Fair Division of Goods in the Shadow of Market Valuescited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.