{"type":"ScholarlyArticle","title":"Online Approval Committee Elections","authors":[{"name":"Virginie Do","slug":"virginie-do","given":"Virginie","family":"Do","affiliation":"Meta AI Research , Paris , France; Université Paris Dauphine , PSL , CNRS , LAMSADE , France"},{"name":"Matthieu Hervouin","slug":"matthieu-hervouin","given":"Matthieu","family":"Hervouin","affiliation":"Université Paris Dauphine , PSL , CNRS , LAMSADE , France"},{"name":"Jérôme Lang","slug":"jerome-lang","given":"Jérôme","family":"Lang","affiliation":"CNRS , Université Paris Dauphine , PSL , LAMSADE , France"},{"name":"Piotr Skowron","slug":"piotr-skowron","given":"Piotr","family":"Skowron","affiliation":"University of Warsaw , Poland"}],"abstract":"Assume k candidates need to be selected. The candidates appear over time. Each time one appears, it must be immediately selected or rejected---a decision that is made by a group of individuals through voting. Assume the voters use approval ballots, i.e., for each candidate they only specify whether they consider it acceptable or not. This setting can be seen as a voting variant of choosing k secretaries. Our contribution is twofold. (1) We assess to what extent the committees that are computed online can proportionally represent the voters. (2) If a prior probability over candidate approvals is available, we show how to compute committees with maximal expected score.","doi":"10.24963/ijcai.2022/36","url":"https://ijcai.org/proceedings/2022/36","pdf":"https://ijcai.org/proceedings/2022/0036.pdf","markdown":"https://ijcai.org/proceedings/2022/36.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/36","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Agent-based and Multi-agent Systems","track":"Main Track","number":36,"pages":{"first":251,"last":257},"keywords":["Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986767","length_sec":88,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984910","length_sec":360,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Aziz et al., 2017] Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert Freeman, and Toby Walsh. Justified representation in approval-based committee voting. 48(2):461-485, 2017.","title":"Justified representation in approval-based committee voting","authors":"Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert Freeman, Toby Walsh","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Babaioff et al., 2008] Moshe Babaioff, Nicole Immorlica, David Kempe, and Robert Kleinberg. Online auctions and generalized secretary problems. ACM SIGecom Exchanges, 7(2):1-11, 2008.","title":"Online auctions and generalized secretary problems","authors":"Babaioff","year":"2008","venue":"ACM SIGecom Exchanges","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Banerjee et al., 2022] Siddhartha Banerjee, Vasilis Gkatzelis, Safwan Hossain, Billy Jin, Evi Micha, and Nisarg Shah. Proportionally fair online allocation of public goods. http://www.cs.toronto.edu/ nisarg/papers/fair- online-public-goods.pdf, 2022. Accessed: 2022-05-05.","title":"Proportionally fair online allocation of public goods","authors":"Siddhartha Banerjee, Vasilis Gkatzelis, Safwan Hossain, Billy Jin, Evi Micha, Nisarg Shah","year":"2022","venue":null,"doi":null,"url":"http://www.cs.toronto.edu/nisarg/papers/fair-online-public-goods.pdf","internal_url":null},{"position":4,"raw":"[Bateni et al., 2013] Mohammad Hossein Bateni, Moham- madtaghi Hajiaghayi, and Morteza Zadimoghaddam. Sub- modular secretary problem and extensions. ACM Transac- tions on Algorithms (TALG), 9(4):1-23, 2013.","title":"Submodular secretary problem and extensions","authors":"Mohammadtaghi Mohammad Hossein Bateni, Morteza Hajiaghayi, Zadimoghaddam","year":"2013","venue":"ACM Transactions on Algorithms (TALG)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bearden et al., 2005] J. Neil Bearden, Ryan O. Murphy, and Amnon Rapoport. A multi-attribute extension of the secre- tary problem: Theory and experiments. Journal of Mathe- matical Psychology, 49(5):410-422, 2005.","title":"A multi-attribute extension of the secretary problem: Theory and experiments","authors":"J Neil Bearden, Ryan O Murphy, Amnon Rapoport","year":"2005","venue":"Journal of Mathematical Psychology","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Dey et al., 2017] Palash Dey, Nimrod Talmon, and Otniel van Handel. Proportional representation in vote streams. arXiv preprint arXiv:1702.08862, 2017.","title":"Proportional representation in vote streams","authors":"Palash Dey, Nimrod Talmon, Otniel Van Handel","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Do et al., 2021] Virginie Do, Jamal Atif, Jérôme Lang, and Nicolas Usunier. Online selection of diverse committees. In Zhi-Hua Zhou, editor, Proceedings of the Thirtieth Interna- tional Joint Conference on Artificial Intelligence, IJCAI-21, pages 154-160. International Joint Conferences on Artifi- cial Intelligence Organization, 8 2021. Main Track.","title":"Online selection of diverse committees","authors":"Virginie Do, Jamal Atif, Jérôme Lang, Nicolas Usunier","year":"2021","venue":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21","doi":null,"url":null,"internal_url":"/proceedings/2021/22"},{"position":8,"raw":"[Freeman et al., 2017] Rupert Freeman, Seyed Majid Zahedi, and Vincent Conitzer. Fair social choice in dynamic settings. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI)., 2017.","title":"Fair social choice in dynamic settings","authors":"Freeman","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Hossain et al., 2021] Safwan Hossain, Evi Micha, and Nis- arg Shah. Fair algorithms for multi-agent multi-armed ban- dits. Advances in Neural Information Processing Systems, 34, 2021. [Israel and Brill, 2021] Jonas Israel and Markus Brill. Dynamic proportional rankings. arXiv preprint arXiv:2105.08043, 2021.","title":"Fair algorithms for multi-agent multi-armed bandits","authors":"Safwan Hossain, Evi Micha, Nisarg Shah","year":"2021","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Kleinberg, 2005] Robert Kleinberg. A multiple-choice sec- retary algorithm with applications to online auctions. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 630-631. Citeseer, 2005.","title":"A multiple-choice secretary algorithm with applications to online auctions","authors":"Robert Kleinberg","year":"2005","venue":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Lackner and Skowron, 2020] Martin Lackner and Piotr Skowron. Multi-winner voting with approval preferences. Technical Report arXiv:2007.01795 [cs.GT], arXiv.org, 2020.","title":"Multi-winner voting with approval preferences","authors":"Skowron Lackner, Martin Lackner, Piotr Skowron","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Lackner et al., 2021] Martin Lackner, Jan Maly, and Simon Rey. Fairness in long-term participatory budgeting. In Zhi-Hua Zhou, editor, Proceedings of the Thirtieth Interna- tional Joint Conference on Artificial Intelligence, IJCAI-21, pages 299-305. International Joint Conferences on Artifi- cial Intelligence Organization, 8 2021. Main Track.","title":"Fairness in long-term participatory budgeting","authors":"Martin Lackner, Jan Maly, Simon Rey","year":"2021","venue":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21","doi":null,"url":null,"internal_url":"/proceedings/2021/42"},{"position":13,"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":14,"raw":"[Oren and Lucier, 2014] Joel Oren and Brendan Lucier. On- line (budgeted) social choice. In Twenty-Eighth AAAI Con- ference on Artificial Intelligence, 2014.","title":"Online (budgeted) social choice","authors":"Oren, Lucier, Joel Oren, Brendan Lucier","year":"2014","venue":"Twenty-Eighth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Panigrahi et al., 2012] Debmalya Panigrahi, Atish Das Sarma, Gagan Aggarwal, and Andrew Tomkins. Online selection of diverse results. In Proceedings of the fifth ACM international conference on Web search and data mining, pages 263-272, 2012.","title":"Online selection of diverse results","authors":"Panigrahi","year":"2012","venue":"Proceedings of the fifth ACM international conference on Web search and data mining","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Peters and Skowron, 2020] Dominik Peters and Piotr Skowron. Proportionality and the limits of welfarism. In Proceedings of the 2020 ACM Conference on Economics and Computation (ACM-EC-2020), pages 793-794, 2020.","title":"Proportionality and the limits of welfarism","authors":"Skowron Peters, Dominik Peters, Piotr Skowron","year":"2020","venue":"Proceedings of the 2020 ACM Conference on Economics and Computation (ACM-EC-2020)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Pierczyński et al., 2021] Grzegorz Pierczyński, Piotr Skowron, and Dominik Peters. Proportional participatory budgeting with additive utilities. In Proceedings of the 35th Annual Conference on Neural Information Processing Systems (NeurIPS-2021), 2021.","title":"Proportional participatory budgeting with additive utilities","authors":"Grzegorz Pierczyński, Piotr Skowron, Dominik Peters","year":"2021","venue":"Proceedings of the 35th Annual Conference on Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Sánchez-Fernández et al., 2017] Luis Sánchez-Fernández, Edith Elkind, Martin Lackner, Norberto Fernández, Jesus A. Fisteus, Pablo Basanta Val, and Piotr Skowron. Propor- tional justified representation. In Proceedings of the 31st Conference on Artificial Intelligence (AAAI-2017), pages 670-676, 2017.","title":"Proportional justified representation","authors":"Luis Sánchez-Fernández, Edith Elkind, Martin Lackner, Norberto Fernández, Jesus A Fisteus, Pablo Basanta Val, Piotr Skowron","year":"2017","venue":"Proceedings of the 31st Conference on Artificial Intelligence (AAAI-2017)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Skowron et al., 2017] Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, and Elkind Elkind. Propor- tional rankings. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-2017), pages 409-415, 2017.","title":"Proportional rankings","authors":"Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, Elkind Elkind","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-2017)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Skowron, 2021] Piotr Skowron. Proportionality degree of multiwinner rules. In Proceedings of the 2021 ACM Con- ference on Economics and Computation (ACM-EC-2021), 2021.","title":"Proportionality degree of multiwinner rules","authors":"Piotr Skowron","year":"2021","venue":"Proceedings of the 2021 ACM Conference on Economics and Computation (ACM-EC-2021","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Thiele, 1895] Thorvald N. Thiele. Om flerfoldsvalg. In Over- sigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger, pages 415-441. 1895.","title":"Om flerfoldsvalg","authors":"Thorvald N Thiele","year":"1895","venue":"Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Yu et al., 2019] Ge Yu, Sheldon Howard Jacobson, and Ne- gar Kiyavash. A bi-criteria multiple-choice secretary prob- lem. Iise Transactions, 51(6):577-588, 2019.","title":"A bi-criteria multiple-choice secretary problem","authors":"Ge Yu, Sheldon Howard Jacobson, Negar Kiyavash","year":"2019","venue":"Iise Transactions","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}