Go to content
UR Home

Algorithms for Max-Min Share Fair Allocation of Indivisible Chores

Aziz, Haris, Rauchecker, Gerhard, Schryen, Guido and Walsh, Toby (2017) Algorithms for Max-Min Share Fair Allocation of Indivisible Chores. In: Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), 4-9 February 2017, San Francisco.

Download (723kB)
Date of publication of this fulltext: 10 Jan 2017 06:58


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 ...


Export bibliographical data

Item type:Conference or workshop item (Poster)
Date:February 2017
Institutions:Business, Economics and Information Systems > Institut für Wirtschaftsinformatik > Professur für Wirtschaftsinformatik (Prof. Dr. Guido Schryen)
Dewey Decimal Classification:000 Computer science, information & general works > 004 Computer science
Refereed:Yes, this version has been refereed
Created at the University of Regensburg:Yes
Item ID:35029
Owner only: item control page


Downloads per month over past year

  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons