Skip to main navigation Skip to search Skip to main content

On the decomposability of fractional allocations

  • Shurojit Chatterji
  • , Peng Liu*
  • *Corresponding author for this work
  • Singapore Management University

Research output: Contribution to journal › Article › peer-review

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 languageEnglish
Pages (from-to)79-89
Number of pages11
JournalMathematical Social Sciences
Volume132
DOIs
StatePublished - 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