Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio (2404.18132v1)
Abstract: We consider the problem of fairly allocating a combination of divisible and indivisible goods. While fairness criteria like envy-freeness (EF) and proportionality (PROP) can always be achieved for divisible goods, only their relaxed versions, such as the ''up to one'' relaxations EF1 and PROP1, can be satisfied when the goods are indivisible. The ''up to one'' relaxations require the fairness conditions to be satisfied provided that one good can be completely eliminated or added in the comparison. In this work, we bridge the gap between the two extremes and propose ''up to a fraction'' relaxations for the allocation of mixed divisible and indivisible goods. The fraction is determined based on the proportion of indivisible goods, which we call the indivisibility ratio. The new concepts also introduce asymmetric conditions that are customized for individuals with varying indivisibility ratios. We provide both upper and lower bounds on the fractions of the modified item in order to satisfy the fairness criterion. Our results are tight up to a constant for EF and asymptotically tight for PROP.
- Fair division of indivisible goods: Recent progress and open questions. Artificial Intelligence, 322:103965, 2023.
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. Operations Research Letters, 48(5):573–578, 2020.
- Propm allocations of indivisible goods to multiple agents. arXiv preprint arXiv:2105.11348, 2021.
- On the proximity of markets with integral equilibria. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pages 1748–1755, 2019.
- Groupwise maximin fair allocation of indivisible goods. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pages 917–924, 2018.
- Finding fair and efficient allocations. In Proceedings of the ACM Conference on Economics and Computation (EC), pages 557–574, 2018.
- Fair division of mixed divisible and indivisible goods. Artificial Intelligence, 293:103436, 2021.
- Maximin fairness with mixed divisible and indivisible goods. Autonomous Agents and Multi-Agent Systems, 35(2):34, 2021.
- Fair division with subjective divisibility. In Proceedings of the Conference on Web and Internet Economics (WINE), page 677, 2023.
- On approximate envy-freeness for indivisible chores and mixed resources. In Proceedings of the International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 1:1–1:23, 2021.
- An envy-free cake division protocol. The American Mathematical Monthly, 102(1):9–18, 1995.
- Eric Budish. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6):1061–1103, 2011.
- The unreasonable fairness of maximum Nash welfare. ACM Transactions on Economics and Computation, 7(3):12:1–12:32, 2019.
- New fairness concepts for allocating indivisible items. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 2554–2562, 2023.
- Fair public decision making. In Proceedings of the ACM Conference on Economics and Computation (EC), pages 629–646, 2017.
- Duncan Karl Foley. Resource allocation and the public sector. Yale Economics Essays, 7(1):45–98, 1967.
- Equitable allocations of indivisible goods. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 280–286, 2019.
- Computing Pareto-optimal and almost envy-free allocations of indivisible goods. Journal of Artificial Intelligence Research, 2023. Forthcoming.
- Near fairness in matroids. In Proceedings of the European Conference on Artificial Intelligence (ECAI), pages 393–398, 2014.
- Fair allocation with binary valuations for mixed divisible and indivisible goods. CoRR, abs/2306.05986, 2023.
- Truthful fair mechanisms for allocating mixed divisible and indivisible goods. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 2808–2816, 2023.
- A complete landscape for the price of envy-freeness. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2024. Forthcoming.
- On approximately fair allocations of indivisible goods. In Proceedings of the ACM Conference on Electronic Commerce (EC), pages 125–131, 2004.
- Mixed fair division: A survey. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pages 22641–22649, 2024. Senior Member Presentation Track.
- Hervé Moulin. Fair division in the internet age. Annual Review of Economics, 11(1):407–441, 2019.
- Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods. CoRR, abs/2302.13342v2, 2023.
- Cake-Cutting Algorithm: Be Fair If You Can. A K Peters/CRC Press, 1998.
- Monotonicity and competitive equilibrium in cake-cutting. Economic Theory, 68(2):363–401, 2019.
- Hugo Steinhaus. Sur la division pragmatique. Econometrica, 17:315–319, 1949.
- Warut Suksompong. Constraints in fair division. ACM SIGecom Exchanges, 19(2):46–61, 2021.
- Hal R Varian. Equity, envy, and efficiency. Journal of Economic Theory, 9(1):63–91, 1974.
- Budget-feasible maximum Nash social welfare is almost envy-free. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 465–471, 2021.