Fair division of indivisible items
| dc.contributor.author | Hsu, Kuang-Yu | |
| dc.contributor.supervisor | King, Valerie D. | |
| dc.date.accessioned | 2025-10-01T20:14:01Z | |
| dc.date.available | 2025-10-01T20:14:01Z | |
| dc.date.issued | 2025 | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Doctor of Philosophy PhD | |
| dc.description.abstract | We study the fair division of indivisible items. In the general model, the goal is to find a way to allocate m indivisible items to n agents, while satisfying some fairness criteria. We are particularly interested in the fairness criteria of maximin share (MMS), envy-freeness up to one item (EF1), and envy-freeness up to any item (EFX). Additionally, we study a recently-introduced graphical model that represents the fair division problem as a multigraph, in which vertices correspond to agents and edges correspond to items. The graphical model stipulates that an item can have non-zero marginal utility to an agent only if its corresponding edge is incident to the agent's corresponding vertex, capturing the idea of proximity between agents and items. It is desirable to allocate edges only to their endpoints. Such allocations are called orientations, as they correspond naturally to graph orientations. Our first contribution concerns MMS allocations of mixed manna (i.e. a mixture of goods and chores) in the general model. It is known that MMS allocations of goods exist when m <= n+5. We generalize this result by showing that when m <= n+5, MMS allocations of mixed manna exist as long as n <= 3, there is an agent whose MMS threshold is non-negative, or every item is a chore. Remarkably, our result leaves only the case in which every agent has a negative MMS threshold unanswered. Our second contribution concerns EFX orientations of multigraphs of goods. We show that deciding whether EFX orientations exist for multigraphs is NP-complete, even for symmetric bi-valued multigraphs. Complementary to this, we show symmetric bi-valued multigraphs that do not contain non-trivial odd multitrees have EFX orientations that can be found in polynomial time. Our third contribution concerns EF1 and EFX orientations of graphs and multigraphs of chores. We obtain polynomial-time algorithms for deciding whether such graphs have EF1 and EFX orientations, resolving a previous conjecture and showing a fundamental difference between goods and chores division. In addition, we show that the analogous problems for multigraphs are NP-hard. | |
| dc.description.scholarlevel | Graduate | |
| dc.identifier.uri | https://hdl.handle.net/1828/22822 | |
| dc.language | English | eng |
| dc.language.iso | en | |
| dc.rights | Available to the World Wide Web | |
| dc.subject | Computer science | |
| dc.subject | Fair division | |
| dc.subject | Indivisible items | |
| dc.subject | EXF | |
| dc.subject | EF1 | |
| dc.subject | MMS | |
| dc.title | Fair division of indivisible items | |
| dc.type | Thesis |