Abstract
A common practice in dealing with the allocation of indivisible objects is to treat them as infinitely divisible and specify a fractional allocation, which is then implemented as a lottery on integer allocations that are feasible. The question we study is whether an arbitrary fractional allocation can be decomposed as a lottery on an arbitrary set of feasible integer allocations. The main result is a characterization of decomposable fractional allocations, that is obtained by transforming the decomposability problem into a maximum flow problem. We also provide a separate necessary condition for decomposability.
| Original language | English |
|---|---|
| Pages (from-to) | 79-89 |
| Number of pages | 11 |
| Journal | Mathematical Social Sciences |
| Volume | 132 |
| DOIs | |
| State | Published - Dec 2024 |
Keywords
- Decomposability
- Fractional allocation
- Indivisibility
- Maximum flow
Fingerprint
Dive into the research topics of 'On the decomposability of fractional allocations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver