Go to content
UR Home

Algorithms for Max-Min Share Fair Allocation of Indivisible Chores

URN to cite this document:
urn:nbn:de:bvb:355-epub-350297
DOI to cite this document:
10.5283/epub.35029
Aziz, Haris ; Rauchecker, Gerhard ; Schryen, Guido ; Walsh, Toby
[img]
Preview
PDF
(723kB)
Date of publication of this fulltext: 10 Jan 2017 06:58


Abstract

We consider Max-min Share (MmS) fair allocations of indivisible chores (items with negative utilities). We show that allocation of chores and classical allocation of goods (items with positive utilities) have some fundamental connections but also differences which prevent a straightforward application of algorithms for goods in the chores setting and viceversa. We prove that an MmS allocation ...

plus


Owner only: item control page
  1. Homepage UR

University Library

Publication Server

Contact:

Publishing: oa@ur.de
0941 943 -4239 or -69394

Dissertations: dissertationen@ur.de
0941 943 -3904

Research data: datahub@ur.de
0941 943 -5707

Contact persons