{"type":"ScholarlyArticle","title":"Achieving a Fairer Future by Changing the Past","authors":[{"name":"Jiafan He","slug":"jiafan-he","given":"Jiafan","family":"He","affiliation":"Institute for Interdisciplinary Information Sciences , Tsinghua University"},{"name":"Ariel D. Procaccia","slug":"ariel-d-procaccia","given":"Ariel D.","family":"Procaccia","affiliation":"Computer Science Department , Carnegie Mellon University"},{"name":"Alexandros Psomas","slug":"alexandros-psomas","given":"Alexandros","family":"Psomas","affiliation":"Computer Science Department , Carnegie Mellon University"},{"name":"David Zeng","slug":"david-zeng","given":"David","family":"Zeng","affiliation":"Computer Science Department , Carnegie Mellon University"}],"abstract":"We study the problem of allocating T indivisible items that arrive online to agents with additive valuations. The allocation must satisfy a prominent fairness notion, envy-freeness up to one item (EF1), at each round. To make this possible, we allow the reallocation of previously allocated items, but aim to minimize these so-called adjustments. For the case of two agents, we show that algorithms that are informed about the values of future items can get by without any adjustments, whereas uninformed algorithms require Theta(T) adjustments. For the general case of three or more agents, we prove that even informed algorithms must use Omega(T) adjustments, and design an uninformed algorithm that requires only O(T^(3/2)).","doi":"10.24963/ijcai.2019/49","url":"https://ijcai.org/proceedings/2019/49","pdf":"https://ijcai.org/proceedings/2019/0049.pdf","markdown":"https://ijcai.org/proceedings/2019/49.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/49","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":49,"pages":{"first":343,"last":349},"keywords":["Agent-based and Multi-agent Systems: Algorithmic Game Theory","Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[],"references":[{"position":1,"raw":"[Aleksandrov and Walsh, 2017] M. Aleksandrov and T. Walsh. Pure Nash equilibria in online fair division. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pages 42-48, 2017.","title":"Pure Nash equilibria in online fair division","authors":"M Aleksandrov, T Walsh","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2017/7"},{"position":2,"raw":"[Aleksandrov et al., 2015] M. Aleksandrov, H. Aziz, S. Gaspers, and T. Walsh. Online fair division: Analysing a food bank problem. In Proceedings of the 24th Interna- tional Joint Conference on Artificial Intelligence (IJCAI), pages 2540-2546, 2015.","title":"Online fair division: Analysing a food bank problem","authors":"M Aleksandrov, H Aziz, S Gaspers, T Walsh","year":"2015","venue":"Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Amanatidis et al., 2016] G. Amanatidis, G. Birmpas, and E. Markakis. On truthful mechanisms for maximin share allocations. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 31- 37, 2016.","title":"On truthful mechanisms for maximin share allocations","authors":"G Amanatidis, G Birmpas, E Markakis","year":"2016","venue":"Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Barman and Krishnamurthy, 2017] S. Barman and S. K. Kr- ishnamurthy. Approximation algorithms for maximin fair division. In Proceedings of the 18th ACM Conference on Economics and Computation (EC), pages 647-664, 2017.","title":"Approximation algorithms for maximin fair division","authors":"S Barman, S K Krishnamurthy","year":"2017","venue":"Proceedings of the 18th ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Barman et al., 2018] S. Barman, S. K. Krishnamurthy, and R. Vaish. Finding fair and efficient allocations. In Pro- ceedings of the 19th ACM Conference on Economics and Computation (EC), pages 557-574, 2018.","title":"Finding fair and efficient allocations","authors":"S Barman, S K Krishnamurthy, R Vaish","year":"2018","venue":"Proceedings of the 19th ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Benadè et al., 2018] G. Benadè, A. M. Kazachkov, A. D. Procaccia, and C.-A. Psomas. How to make envy vanish over time. In Proceedings of the 19th ACM Conference on Economics and Computation (EC), pages 593-610, 2018.","title":"How to make envy vanish over time","authors":"G Benadè, A M Kazachkov, A D Procaccia, C.-A Psomas","year":"2018","venue":"Proceedings of the 19th ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bogomolnaia et al., 2017] A. Bogomolnaia, H. Moulin, F. Sandomirskiy, and E. Yanovskaia. Dividing goods or bads under additive utilities. arXiv:1608.01540, 2017.","title":"Dividing goods or bads under additive utilities","authors":"A Bogomolnaia, H Moulin, F Sandomirskiy, E Yanovskaia","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bouveret and Lemaître, 2016] S. Bouveret and M. Lemaître. Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Autonomous Agents and Multi-Agent Systems, 30(2):259-290, 2016.","title":"Characterizing conflicts in fair division of indivisible goods using a scale of criteria","authors":"S Bouveret, M Lemaître","year":"2016","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bouveret et al., 2017] S. Bouveret, K. Cechlárová, E. Elkind, A. Igarashi, and D. Peters. Fair division of a graph. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pages 135-141, 2017.","title":"Fair division of a graph","authors":"S Bouveret, K Cechlárová, E Elkind, A Igarashi, D Peters","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Brams and Taylor, 1996] S. J. Brams and A. D. Taylor. Fair Division: From Cake-Cutting to Dispute Resolution. Cam- bridge University Press, 1996.","title":"Fair Division: From Cake-Cutting to Dispute Resolution","authors":"S J Brams, A D Taylor","year":"1996","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Brandt et al., 2016] F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia, editors. Handbook of Com- putational Social Choice. Cambridge University Press, 2016.","title":"Handbook of Computational Social Choice","authors":"F Brandt, V Conitzer, U Endriss, J","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Caragiannis et al., 2016] I. Caragiannis, D. Kurokawa, H. Moulin, A. D. Procaccia, N. Shah, and J. Wang. The unreasonable fairness of maximum Nash welfare. In Pro- ceedings of the 17th ACM Conference on Economics and Computation (EC), pages 305-322, 2016.","title":"The unreasonable fairness of maximum Nash welfare","authors":"Caragiannis","year":"2016","venue":"Proceedings of the 17th ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Cole and Gkatzelis, 2015] R. Cole and V. Gkatzelis. Ap- proximating the Nash social welfare with indivisible items. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC), pages 371-380, 2015.","title":"Approximating the Nash social welfare with indivisible items","authors":"R Cole, V Gkatzelis","year":"2015","venue":"Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Friedman et al., 2015] E. J. Friedman, C.-A. Psomas, and S. Vardi. Dynamic fair division with minimal disruptions. In Proceedings of the 16th ACM Conference on Economics and Computation (EC), pages 697-713, 2015.","title":"Dynamic fair division with minimal disruptions","authors":"E J Friedman, C.-A Psomas, S Vardi","year":"2015","venue":"Proceedings of the 16th ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Friedman et al., 2017] E. J. Friedman, C.-A. Psomas, and S. Vardi. Controlled dynamic fair division. In Proceedings of the 18th ACM Conference on Economics and Computa- tion (EC), pages 461-478, 2017.","title":"Controlled dynamic fair division","authors":"E J Friedman, C.-A Psomas, S Vardi","year":"2017","venue":"Proceedings of the 18th ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gal et al., 2017] Y. Gal, M. Mash, A. D. Procaccia, and Y. Zick. Which is the fairest (rent division) of them all? Journal of the ACM, 64(6): article 39, 2017.","title":"Which is the fairest (rent division) of them all?","authors":"Y Gal, M Mash, A D Procaccia, Y Zick","year":"2017","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Goldman and Procaccia, 2014] J. Goldman and A. D. Pro- caccia. Spliddit: Unleashing fair division algorithms. SIGecom Exchanges, 13(2):41-46, 2014.","title":"Spliddit: Unleashing fair division algorithms","authors":"J Goldman, A D","year":"2014","venue":"SIGecom Exchanges","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kash et al., 2014] I. Kash, A. D. Procaccia, and N. Shah. No agent left behind: Dynamic fair division of multi- ple resources. Journal of Artificial Intelligence Research, 51:579-603, 2014.","title":"No agent left behind: Dynamic fair division of multiple resources","authors":"Kash","year":"2014","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kurokawa et al., 2018] D. Kurokawa, A. D. Procaccia, and J. Wang. Fair enough: Guaranteeing approximate max- imin shares. Journal of the ACM, 64(2): article 8, 2018.","title":"Fair enough: Guaranteeing approximate maximin shares","authors":"D Kurokawa, A D Procaccia, J Wang","year":"2018","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lipton et al., 2004] R. J. Lipton, E. Markakis, E. Mossel, and A. Saberi. On approximately fair allocations of in- divisible goods. In Proceedings of the 6th ACM Confer- ence on Economics and Computation (EC), pages 125- 131, 2004.","title":"On approximately fair allocations of indivisible goods","authors":"R J Lipton, E Markakis, E Mossel, A Saberi","year":"2004","venue":"Proceedings of the 6th ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Procaccia, 2016] A. D. Procaccia. Cake cutting algorithms. In F. Brandt, V. Conitzer, U. Endress, J. Lang, and A. D. Procaccia, editors, Handbook of Computational Social Choice, chapter 13. Cambridge University Press, 2016.","title":"Cake cutting algorithms","authors":"A D Procaccia","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Su, 1999] F. E. Su. Rental harmony: Sperner's lemma in fair division. American Mathematical Monthly, 106(10):930- 942, 1999.","title":"Rental harmony: Sperner's lemma in fair division","authors":"F E Su","year":"1999","venue":"American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Walsh, 2011] T. Walsh. Online cake cutting. In Proceed- ings of the 3rd International Conference on Algorithmic Decision Theory (ADT), pages 292-305, 2011.","title":"Online cake cutting","authors":"T Walsh","year":"2011","venue":"Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}