@InProceedings{bhaskar_et_al:LIPIcs.APPROX/RANDOM.2021.1,
author = {Bhaskar, Umang and Sricharan, A. R. and Vaish, Rohit},
title = {{On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)},
pages = {1:1--1:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-207-5},
ISSN = {1868-8969},
year = {2021},
volume = {207},
editor = {Wootters, Mary and Sanit\`{a}, Laura},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.1},
URN = {urn:nbn:de:0030-drops-146944},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.1},
annote = {Keywords: Fair Division, Indivisible Chores, Approximate Envy-Freeness}
}