{"file":[{"creator":"hsiemes","file_size":732005,"date_created":"2018-12-07T11:30:25Z","date_updated":"2021-08-13T13:55:29Z","relation":"main_file","content_type":"application/pdf","access_level":"closed","file_name":"aziz_rauchecker_schryen_walsh.pdf","file_id":"6024"},{"file_name":"10582-Article Text-14110-1-2-20201228.pdf","file_id":"23394","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_size":738751,"creator":"hsiemes","date_created":"2021-08-13T13:55:14Z","date_updated":"2021-08-13T13:55:14Z"}],"page":"1-7","issue":"1","ddc":["000"],"date_created":"2018-11-14T15:49:54Z","file_date_updated":"2021-08-13T13:55:29Z","abstract":[{"text":"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 does not need to exist for chores and computing an MmS allocation - if it exists - is strongly NP-hard. In view of these non-existence and complexity results, we present a polynomial-time 2-approximation algorithm for MmS fairness for chores. We then introduce a new fairness concept called optimal MmS that represents the best possible allocation in terms of MmS that is guaranteed to exist. We use connections to parallel machine scheduling to give (1) a polynomial-time approximation scheme for computing an optimal MmS allocation when the number of agents is fixed and (2) an effective and efficient heuristic with an ex-post worst-case analysis.","lang":"eng"}],"oa":"1","has_accepted_license":"1","date_updated":"2022-01-06T07:02:35Z","type":"conference","publication":"Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)","conference":{"name":"Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)","location":"San Francisco, CA, USA"},"language":[{"iso":"eng"}],"user_id":"61579","citation":{"chicago":"Aziz, Haris, Gerhard Rauchecker, Guido Schryen, and Toby Walsh. “Algorithms for Max-Min Share Fair Allocation of Indivisible Chores.” In <i>Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)</i>, 31:1–7, 2017.","apa":"Aziz, H., Rauchecker, G., Schryen, G., &#38; Walsh, T. (2017). Algorithms for Max-Min Share Fair Allocation of Indivisible Chores. In <i>Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)</i> (Vol. 31, pp. 1–7). San Francisco, CA, USA.","short":"H. Aziz, G. Rauchecker, G. Schryen, T. Walsh, in: Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), 2017, pp. 1–7.","ieee":"H. Aziz, G. Rauchecker, G. Schryen, and T. Walsh, “Algorithms for Max-Min Share Fair Allocation of Indivisible Chores,” in <i>Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)</i>, San Francisco, CA, USA, 2017, vol. 31, no. 1, pp. 1–7.","bibtex":"@inproceedings{Aziz_Rauchecker_Schryen_Walsh_2017, title={Algorithms for Max-Min Share Fair Allocation of Indivisible Chores}, volume={31}, number={1}, booktitle={Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)}, author={Aziz, Haris and Rauchecker, Gerhard and Schryen, Guido and Walsh, Toby}, year={2017}, pages={1–7} }","mla":"Aziz, Haris, et al. “Algorithms for Max-Min Share Fair Allocation of Indivisible Chores.” <i>Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)</i>, vol. 31, no. 1, 2017, pp. 1–7.","ama":"Aziz H, Rauchecker G, Schryen G, Walsh T. Algorithms for Max-Min Share Fair Allocation of Indivisible Chores. In: <i>Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)</i>. Vol 31. ; 2017:1-7."},"volume":31,"_id":"5692","title":"Algorithms for Max-Min Share Fair Allocation of Indivisible Chores","department":[{"_id":"277"}],"author":[{"last_name":"Aziz","full_name":"Aziz, Haris","first_name":"Haris"},{"full_name":"Rauchecker, Gerhard","last_name":"Rauchecker","first_name":"Gerhard"},{"full_name":"Schryen, Guido","last_name":"Schryen","id":"72850","first_name":"Guido"},{"full_name":"Walsh, Toby","last_name":"Walsh","first_name":"Toby"}],"extern":"1","year":"2017","status":"public","intvolume":"        31"}