{"type":"ScholarlyArticle","title":"Proportionally Fair Online Allocation of Public Goods with Predictions","authors":[{"name":"Siddhartha Banerjee","slug":"siddhartha-banerjee","given":"Siddhartha","family":"Banerjee","affiliation":"Cornell University"},{"name":"Vasilis Gkatzelis","slug":"vasilis-gkatzelis","given":"Vasilis","family":"Gkatzelis","affiliation":"Drexel University"},{"name":"Safwan Hossain","slug":"safwan-hossain","given":"Safwan","family":"Hossain","affiliation":"Harvard University"},{"name":"Billy Jin","slug":"billy-jin","given":"Billy","family":"Jin","affiliation":"Cornell University"},{"name":"Evi Micha","slug":"evi-micha","given":"Evi","family":"Micha","affiliation":"University of Toronto"},{"name":"Nisarg Shah","slug":"nisarg-shah","given":"Nisarg","family":"Shah","affiliation":"University of Toronto"}],"abstract":"We design online algorithms for fair allocation of public goods to a set of N agents over a sequence of T rounds and focus on improving their performance using predictions. In the basic model, a public good arrives in each round, and every agent reveals their value for it upon arrival. The algorithm must irrevocably decide the investment in this good without exceeding a total budget of B across all rounds. The algorithm can utilize (potentially noisy) predictions of each agent’s total value for all remaining goods. The algorithm's performance is measured using a proportional fairness objective, which informally demands that every group of agents be rewarded proportional to its size and the cohesiveness of its preferences. We show that no algorithm can achieve better than Θ(T/B) proportional fairness without predictions. With reasonably accurate predictions, the situation improves significantly, and Θ(log(T/B)) proportional fairness is achieved. We also extend our results to a general setting wherein a batch of L public goods arrive in each round and O(log(min(N,L)T/B)) proportional fairness is achieved. Our exact bounds are parameterized as a function of the prediction error, with performance degrading gracefully with increasing errors.","doi":"10.24963/ijcai.2023/3","url":"https://ijcai.org/proceedings/2023/3","pdf":"https://ijcai.org/proceedings/2023/0003.pdf","markdown":"https://ijcai.org/proceedings/2023/3.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/3","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Agent-based and Multi-agent Systems","track":"Main Track","number":3,"pages":{"first":20,"last":28},"keywords":["Agent-based and Multi-agent Systems: MAS: Resource allocation","Game Theory and Economic Paradigms: GTEP: Fair division"],"videos":[],"references":[{"position":1,"raw":"[Almanza et al., 2021] Matteo Almanza, Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi, and Giuseppe Re. Online facility location with multiple advice. Advances in Neural Information Processing Systems, 34, 2021.","title":"Online facility location with multiple advice","authors":"Matteo Almanza, Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi, Giuseppe Re","year":"2021","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Antoniadis et al., 2020a] Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, and Bertrand Simon. Online metric algorithms with untrusted predictions. In In- ternational Conference on Machine Learning, pages 345- 355. PMLR, 2020.","title":"Online metric algorithms with untrusted predictions","authors":"Antoniadis","year":"2020","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Antoniadis et al., 2020b] Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, and Pavel Kolev. Secretary and online matching problems with machine learned advice. Advances in Neural Information Processing Systems, 33:7933-7944, 2020.","title":"Secretary and online matching problems with machine learned advice","authors":"Antoniadis","year":"2020","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Antoniadis et al., 2021] Antonios Antoniadis, Christian Co- ester, Marek Elias, Adam Polak, and Bertrand Simon. Learning-augmented dynamic power management with multiple states via new ski rental bounds. Advances in Neural Information Processing Systems, 34, 2021.","title":"Learning-augmented dynamic power management with multiple states via new ski rental bounds","authors":"Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, Bertrand Simon","year":"2021","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Azar et al., 2016] Yossi Azar, Niv Buchbinder, and Kamal Jain. How to allocate goods in an online market? Algo- rithmica, 74(2):589-601, 2016.","title":"How to allocate goods in an online market?","authors":"Yossi Azar, Niv Buchbinder, Kamal Jain","year":"2016","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Aziz and Shah, 2021] Haris Aziz and Nisarg Shah. Partici- patory budgeting: Models and approaches. In Pathways Between Social Science and Computational Social Sci- ence, pages 215-236. Springer, 2021.","title":"Participatory budgeting: Models and approaches","authors":"Haris Aziz, Nisarg Shah","year":"2021","venue":"Pathways Between Social Science and Computational Social Science","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Aziz et al., 2019] Haris Aziz, Anna Bogomolnaia, and Hervé Moulin. Fair mixing: the case of dichotomous pref- erences. In Proceedings of the 20th ACM Conference on Economics and Computation (EC), pages 753-781, 2019.","title":"Fair mixing: the case of dichotomous preferences","authors":"Haris Aziz, Anna Bogomolnaia, Hervé Moulin","year":"2019","venue":"Proceedings of the 20th ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bamas et al., 2020] Étienne Bamas, Andreas Maggiori, and Ola Svensson. The primal-dual method for learning aug- mented algorithms. Advances in Neural Information Pro- cessing Systems, 33:20083-20094, 2020.","title":"The primal-dual method for learning augmented algorithms","authors":"Étienne Bamas, Andreas Maggiori, Ola Svensson","year":"2020","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Banerjee et al., 2022a] Siddhartha Banerjee, Vasilis Gkatzelis, Artur Gorokh, and Billy Jin. Online nash social welfare maximization with predictions. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. SIAM, 2022.","title":"Online nash social welfare maximization with predictions","authors":"Banerjee","year":"2022","venue":"Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Banerjee et al., 2022b] Siddhartha Banerjee, Vasilis Gkatzelis, Safwan Hossain, Billy Jin, Evi Micha, and Nisarg Shah. Proportionally fair online allocation of pub- lic goods with predictions (full version). arXiv preprint arXiv:2209.15305, 2022.","title":"Proportionally fair online allocation of public goods with predictions","authors":"Banerjee","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Barman et al., 2022] Siddharth Barman, Arindam Khan, and Arnab Maiti. Universal and tight online algorithms for generalized-mean welfare. In The Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI. AAAI Press, 2022.","title":"Universal and tight online algorithms for generalized-mean welfare","authors":"Siddharth Barman, Arindam Khan, Arnab Maiti","year":"2022","venue":"The Thirty-Sixth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Benade et al., 2018] Gerdus Benade, Aleksandr M. Kazachkov, Ariel D. Procaccia, and Christos-Alexandros Psomas. How to make envy vanish over time. In Éva Tardos, Edith Elkind, and Rakesh Vohra, editors, Pro- ceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018, pages 593-610. ACM, 2018.","title":"How to make envy vanish over time","authors":"Benade","year":"2018","venue":"Proceedings of the 2018 ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Bogomolnaia et al., 2005] Anna Bogomolnaia, Hervé Moulin, and Richard Stong. Collective choice under dichotomous preferences. Journal of Economic Theory, 122(2):165-184, 2005.","title":"Collective choice under dichotomous preferences","authors":"Anna Bogomolnaia, Hervé Moulin, Richard Stong","year":"2005","venue":"Journal of Economic Theory","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Bogomolnaia et al., 2019] Anna Bogomolnaia, Hervé Moulin, and Fedor Sandomirskiy. A simple online fair division problem. CoRR, abs/1903.10361, 2019.","title":"A simple online fair division problem","authors":"Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Borodin and El-Yaniv, 2005] Allan Borodin and Ran El- Yaniv. Online computation and competitive analysis. cam- bridge university press, 2005.","title":"Online computation and competitive analysis","authors":"El-Yaniv ; Borodin, Allan Borodin, Ran El-Yaniv","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Brandl et al., 2021] Florian Brandl, Felix Brandt, Dominik Peters, and Christian Stricker. Distribution rules under di- chotomous preferences: Two out of three ain't bad. In Proceedings of the 22nd ACM Conference on Economics and Computation (EC), pages 158-179, 2021.","title":"Distribution rules under dichotomous preferences: Two out of three ain't bad","authors":"Florian Brandl, Felix Brandt, Dominik Peters, Christian Stricker","year":"2021","venue":"Proceedings of the 22nd ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Brandt et al., 2016] Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia, editors. Fair Allocation, page 259-260. Cambridge University Press, 2016.","title":"Fair Allocation","authors":"Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D Procaccia","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Buchbinder and Naor, 2009] Niv Buchbinder and Joseph Naor. The design of competitive online algorithms via a primal-dual approach. Now Publishers Inc, 2009.","title":"The design of competitive online algorithms via a primal-dual approach","authors":"Naor Buchbinder, Niv Buchbinder, Joseph Naor","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Conitzer et al., 2017] Vincent Conitzer, Rupert Freeman, and Nisarg Shah. Fair public decision making. In Con- stantinos Daskalakis, Moshe Babaioff, and Hervé Moulin, editors, Proceedings of the 2017 ACM Conference on Eco- nomics and Computation, EC '17, Cambridge, MA, USA, June 26-30, 2017, pages 629-646. ACM, 2017.","title":"Fair public decision making","authors":"Vincent Conitzer, Rupert Freeman, Nisarg Shah","year":"2017","venue":"Proceedings of the 2017 ACM Conference on Economics and Computation, EC '17","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Devanur and Jain, 2012] Nikhil R Devanur and Kamal Jain. Online matching with concave returns. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 137-144, 2012.","title":"Online matching with concave returns","authors":"R Nikhil, Kamal Devanur, Jain","year":"2012","venue":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Dinitz et al., 2021] Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. Faster matchings via learned duals. Advances in Neural Information Processing Systems, 34, 2021.","title":"Faster matchings via learned duals","authors":"Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii","year":"2021","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Do et al., 2022] Virginie Do, Matthieu Hervouin, Jérôme Lang, and Piotr Skowron. Online approval committee elections. In Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI), pages 251- 257, 2022.","title":"Online approval committee elections","authors":"Virginie Do, Matthieu Hervouin, Jérôme Lang, Piotr Skowron","year":"2022","venue":"Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2022/36"},{"position":23,"raw":"[Duddy, 2015] Conal Duddy. Fair sharing under dichoto- mous preferences. Mathematical Social Sciences, 73:1-5, 2015.","title":"Conal Duddy. Fair sharing under dichotomous preferences","authors":"Duddy","year":"2015","venue":"Mathematical Social Sciences","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Dütting et al., 2021] Paul Dütting, Silvio Lattanzi, Renato Paes Leme, and Sergei Vassilvitskii. Secretaries with ad- vice. In Proceedings of the 22nd ACM Conference on Eco- nomics and Computation, pages 409-429, 2021.","title":"Secretaries with advice","authors":"Paul Dütting, Silvio Lattanzi, Renato Paes Leme, Sergei Vassilvitskii","year":"2021","venue":"Proceedings of the 22nd ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Ebadian et al., 2022a] Soroush Ebadian, Rupert Freeman, and Nisarg Shah. Efficient resource allocation with secre- tive agents. In Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI), 2022.","title":"Efficient resource allocation with secretive agents","authors":"Ebadian","year":"2022","venue":"Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2022/39"},{"position":26,"raw":"[Ebadian et al., 2022b] Soroush Ebadian, Anson Kahng, Do- minik Peters, and Nisarg Shah. Optimized distortion and proportional fairness in voting. In Proceedings of the 23rd ACM Conference on Economics and Computation (EC), 2022.","title":"Optimized distortion and proportional fairness in voting","authors":"Ebadian","year":"2022","venue":"Proceedings of the 23rd ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Fain et al., 2016] Brandon Fain, Ashish Goel, and Kamesh Munagala. The core of the participatory budgeting prob- lem. In International Conference on Web and Internet Economics, pages 384-399. Springer, 2016.","title":"The core of the participatory budgeting problem","authors":"Brandon Fain, Ashish Goel, Kamesh Munagala","year":"2016","venue":"International Conference on Web and Internet Economics","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Fain et al., 2018] Brandon Fain, Kamesh Munagala, and Nisarg Shah. Fair allocation of indivisible public goods. In Éva Tardos, Edith Elkind, and Rakesh Vohra, editors, Pro- ceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018, pages 575-592. ACM, 2018.","title":"Fair allocation of indivisible public goods","authors":"Brandon Fain, Kamesh Munagala, Nisarg Shah","year":"2018","venue":"Proceedings of the 2018 ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Foley, 1970] Duncan K Foley. Lindahl's solution and the core of an economy with public goods. Econometrica: Journal of the Econometric Society, pages 66-72, 1970.","title":"Lindahl's solution and the core of an economy with public goods","authors":"K Duncan, Foley","year":"1970","venue":"Econometrica: Journal of the Econometric Society","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Freeman et al., 2017] Rupert Freeman, Seyed Majid Za- hedi, and Vincent Conitzer. Fair and efficient social choice in dynamic settings. In Carles Sierra, editor, Proceedings of the Twenty-Sixth International Joint Conference on Arti- ficial Intelligence, IJCAI 2017, Melbourne, Australia, Au- gust 19-25, 2017, pages 4580-4587. ijcai.org, 2017.","title":"Fair and efficient social choice in dynamic settings","authors":"Rupert Freeman, Seyed Majid Zahedi, Vincent Conitzer","year":"2017","venue":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017","doi":null,"url":null,"internal_url":"/proceedings/2017/639"},{"position":31,"raw":"[Friedman et al., 2019] Eric J. Friedman, Vasilis Gkatzelis, Christos-Alexandros Psomas, and Scott Shenker. Fair and efficient memory sharing: Confronting free riders. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 -February 1, 2019, pages 1965-1972. AAAI Press, 2019.","title":"Fair and efficient memory sharing: Confronting free riders","authors":"Eric J Friedman, Vasilis Gkatzelis, Christos-Alexandros Psomas, Scott Shenker","year":"2019","venue":"The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Garg et al., 2021] Jugal Garg, Pooja Kulkarni, and Aniket Murhekar. On fair and efficient allocations of indivisi- ble public goods. In Proceedings of the 41st conference on Foundations of Software Technology and Theoretical Computer Science, number 22, pages 1-19, 2021.","title":"On fair and efficient allocations of indivisible public goods","authors":"Jugal Garg, Pooja Kulkarni, Aniket Murhekar","year":"2021","venue":"Proceedings of the 41st conference on Foundations of Software Technology and Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Gkatzelis et al., 2021] Vasilis Gkatzelis, Alexandros Pso- mas, and Xizhi Tan. Fair and efficient online allocations with normalized valuations. In The Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI. AAAI Press, 2021.","title":"Fair and efficient online allocations with normalized valuations","authors":"Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan","year":"2021","venue":"The Thirty-Fifth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Jiang et al., 2020] Zhihao Jiang, Debmalya Panigrahi, and Kevin Sun. Online algorithms for weighted paging with predictions. In 47th International Colloquium on Au- tomata, Languages, and Programming (ICALP 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020.","title":"Online algorithms for weighted paging with predictions","authors":"Zhihao Jiang, Debmalya Panigrahi, Kevin Sun","year":"2020","venue":"47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Kelly et al., 1998] Frank P Kelly, Aman K Maulloo, and David Kim Hong Tan. Rate control for communica- tion networks: shadow prices, proportional fairness and stability. Journal of the Operational Research society, 49(3):237-252, 1998.","title":"Rate control for communication networks: shadow prices, proportional fairness and stability","authors":"Aman K Frank P Kelly, David Maulloo, Hong Kim, Tan","year":"1998","venue":"Journal of the Operational Research society","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Kunjir et al., 2017] Mayuresh Kunjir, Brandon Fain, Kamesh Munagala, and Shivnath Babu. ROBUS: fair cache allocation for data-parallel workloads. In Semih Salihoglu, Wenchao Zhou, Rada Chirkova, Jun Yang, and Dan Suciu, editors, Proceedings of the 2017 ACM Inter- national Conference on Management of Data, SIGMOD Conference 2017, Chicago, IL, USA, May 14-19, 2017, pages 219-234. ACM, 2017.","title":"ROBUS: fair cache allocation for data-parallel workloads","authors":"Mayuresh Kunjir, Brandon Fain, Kamesh Munagala, Shivnath Babu","year":"2017","venue":"Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD Conference 2017","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Lackner, 2020] Martin Lackner. Perpetual voting: Fairness in long-term decision making. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 2103-2110, 2020.","title":"Perpetual voting: Fairness in long-term decision making","authors":"Martin Lackner","year":"2020","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Lattanzi et al., 2020] Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. Online scheduling via learned weights. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Al- gorithms, pages 1859-1877. SIAM, 2020.","title":"Online scheduling via learned weights","authors":"Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii","year":"2020","venue":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Lykouris and Vassilvtiskii, 2018] Thodoris Lykouris and Sergei Vassilvtiskii. Competitive caching with machine learned advice. In International Conference on Machine Learning, pages 3296-3305. PMLR, 2018.","title":"Competitive caching with machine learned advice","authors":"Thodoris Lykouris, Sergei Vassilvtiskii","year":"2018","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Mitzenmacher and Vassilvitskii, 2021] Michael Mitzen- macher and Sergei Vassilvitskii. Algorithms with predictions. In Tim Roughgarden, editor, Beyond the Worst-Case Analysis of Algorithms, page 646-662. Cambridge University Press, 2021.","title":"Algorithms with predictions","authors":"Michael Mitzenmacher, Sergei Vassilvitskii","year":"2021","venue":"Beyond the Worst-Case Analysis of Algorithms","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Munagala et al., 2021] Kamesh Munagala, Yiheng Shen, Kangning Wang, and Zhiyi Wang. Approximate core for committee selection via multilinear extension and market clearing. CoRR, abs/2110.12499, 2021.","title":"Approximate core for committee selection via multilinear extension and market clearing","authors":"Kamesh Munagala, Yiheng Shen, Kangning Wang, Zhiyi Wang","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Nash, 1950] John Nash. The bargaining problem. Econo- metrica, 18(2):155-162, April 1950.","title":"The bargaining problem","authors":"John Nash","year":"1950","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Oren and Lucier, 2014] Joel Oren and Brendan Lucier. On- line (budgeted) social choice. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 28, 2014.","title":"Online (budgeted) social choice","authors":"Oren, Lucier, Joel Oren, Brendan Lucier","year":"2014","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Peters et al., 2020] Dominik Peters, Grzegorz Pierczynski, and Piotr Skowron. Proportional participatory budgeting with cardinal utilities. CoRR, abs/2008.13276, 2020.","title":"Proportional participatory budgeting with cardinal utilities","authors":"Dominik Peters, Grzegorz Pierczynski, Piotr Skowron","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Purohit et al., 2018] Manish Purohit, Zoya Svitkina, and Ravi Kumar. Improving online algorithms via ml predic- tions. Advances in Neural Information Processing Sys- tems, 31, 2018.","title":"Improving online algorithms via ml predictions","authors":"Manish Purohit, Zoya Svitkina, Ravi Kumar","year":"2018","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Rohatgi, 2020] Dhruv Rohatgi. Near-optimal bounds for online caching with machine learned advice. In Proceed- ings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1834-1845. SIAM, 2020.","title":"Near-optimal bounds for online caching with machine learned advice","authors":"Dhruv Rohatgi","year":"2020","venue":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Wang et al., 2020] Shufan Wang, Jian Li, and Shiqiang Wang. Online algorithms for multi-shop ski rental with machine learned advice. Advances in Neural Information Processing Systems, 33:8150-8160, 2020.","title":"Online algorithms for multi-shop ski rental with machine learned advice","authors":"Wang","year":"2020","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Zeng and Psomas, 2020] David Zeng and Alexandros Pso- mas. Fairness-efficiency tradeoffs in dynamic fair divi- sion. In Péter Biró, Jason Hartline, Michael Ostrovsky, and Ariel D. Procaccia, editors, EC '20: The 21st ACM Con- ference on Economics and Computation, Virtual Event, Hungary, July 13-17, 2020, pages 911-912. ACM, 2020.","title":"Fairness-efficiency tradeoffs in dynamic fair division","authors":"David Zeng, Alexandros Psomas","year":"2020","venue":"EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}