{"type":"ScholarlyArticle","title":"Algorithmics of Egalitarian versus Equitable Sequences of Committees","authors":[{"name":"Eva Michelle Deltl","slug":"eva-michelle-deltl","given":"Eva Michelle","family":"Deltl","affiliation":"Technische Universität Berlin , Faculty IV, Algorithmics and Computational Complexity"},{"name":"Till Fluschnik","slug":"till-fluschnik","given":"Till","family":"Fluschnik","affiliation":"Technische Universität Berlin , Faculty IV, Algorithmics and Computational Complexity; TU Clausthal , Institut für Informatik"},{"name":"Robert Bredereck","slug":"robert-bredereck","given":"Robert","family":"Bredereck","affiliation":"TU Clausthal , Institut für Informatik"}],"abstract":"We study the election of sequences of committees, where in each of tau levels (e.g. modeling points in time) a committee consisting of k candidates from a common set of m candidates is selected. For each level, each of n agents (voters) may nominate one candidate whose selection would satisfy her. We are interested in committees which are good with respect to the satisfaction per day and per agent. More precisely, we look for egalitarian or equitable committee sequences. While both guarantee that at least x agents per day are satisfied, egalitarian committee sequences ensure that each agent is satisfied in at least y levels while equitable committee sequences ensure that each agent is satisfied in exactly y levels. We analyze the parameterized complexity of finding such committees for the parameters n, m, k, tau, x, and y, as well as combinations thereof.","doi":"10.24963/ijcai.2023/295","url":"https://ijcai.org/proceedings/2023/295","pdf":"https://ijcai.org/proceedings/2023/0295.pdf","markdown":"https://ijcai.org/proceedings/2023/295.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/295","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":"Game Theory and Economic Paradigms","track":"Main Track","number":295,"pages":{"first":2651,"last":2658},"keywords":["Game Theory and Economic Paradigms: GTEP: Computational social choice","AI Ethics, Trust, Fairness: ETF: Fairness and diversity","Knowledge Representation and Reasoning: KRR: Computational complexity of reasoning"],"videos":[],"references":[{"position":1,"raw":"[Aziz et al., 2018] Haris Aziz, Piotr Faliszewski, Bernard Grofman, Arkadii Slinko, and Nimrod Talmon. Egalitar- ian committee scoring rules. In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI '18), pages 56-62, 2018.","title":"Egalitarian committee scoring rules","authors":"Haris Aziz, Piotr Faliszewski, Bernard Grofman, Arkadii Slinko, Nimrod Talmon","year":"2018","venue":"Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI '18)","doi":null,"url":null,"internal_url":"/proceedings/2018/8"},{"position":2,"raw":"[Bredereck et al., 2020a] Robert Bredereck, Piotr Fal- iszewski, Andrzej Kaczmarczyk, Dušan Knop, and Rolf Niedermeier. Parameterized algorithms for finding a collective set of items. In Proceedings of the 33rd Conference on Artificial Intelligence (AAAI '19), pages 1838-1845. AAAI Press, 2020.","title":"Parameterized algorithms for finding a collective set of items","authors":"Bredereck","year":"2020","venue":"Proceedings of the 33rd Conference on Artificial Intelligence (AAAI '19)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bredereck et al., 2020b] Robert Bredereck, Andrzej Kacz- marczyk, and Rolf Niedermeier. Electing successive com- mittees: Complexity and algorithms. In Proceedings of the 34th Conference on Artificial Intelligence (AAAI '20), pages 1846-1853, 2020.","title":"Electing successive committees: Complexity and algorithms","authors":"Bredereck","year":"2020","venue":"Proceedings of the 34th Conference on Artificial Intelligence (AAAI '20)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bredereck et al., 2022] Robert Bredereck, Till Fluschnik, and Andrzej Kaczmarczyk. When votes change and com- mittees should (not). In Proceedings of the 31st Inter- national Joint Conference on Artificial Intelligence (IJ- CAI '22), pages 144-150. ijcai.org, 2022.","title":"When votes change and committees should (not)","authors":"Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk","year":"2022","venue":"Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJ-CAI '22)","doi":null,"url":null,"internal_url":"/proceedings/2022/21"},{"position":5,"raw":"[Bulteau et al., 2021] Laurent Bulteau, Noam Hazon, Rutvik Page, Ariel Rosenfeld, and Nimrod Talmon. Justified rep- resentation for perpetual voting. IEEE Access, 9, 2021.","title":"Justified representation for perpetual voting","authors":"Laurent Bulteau, Noam Hazon, Rutvik Page, Ariel Rosenfeld, Nimrod Talmon","year":"2021","venue":"IEEE Access","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cygan et al., 2015] Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parame- terized Algorithms. Springer, 2015.","title":"Parameterized Algorithms","authors":"Marek Cygan, V Fedor, Lukasz Fomin, Daniel Kowalik, Dániel Lokshtanov, Marcin Marx, Michal Pilipczuk, Saket Pilipczuk, Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Eisenstat et al., 2014] David Eisenstat, Claire Mathieu, and Nicolas Schabanel. Facility location in evolving metrics. In Proceedings of the 41st International Colloquium on Au- tomata, Languages, and Programming (ICALP '14), pages 459-470, 2014.","title":"Facility location in evolving metrics","authors":"David Eisenstat, Claire Mathieu, Nicolas Schabanel","year":"2014","venue":"Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP '14)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Elkind et al., 2017] Edith Elkind, Piotr Faliszewski, Piotr Skowron, and Arkadii Slinko. Properties of multiwinner voting rules. Social Choice and Welfare, 48(3):599-632, 2017.","title":"Properties of multiwinner voting rules","authors":"Elkind","year":"2017","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fernau and Niedermeier, 2001] Henning Fernau and Rolf Niedermeier. An efficient exact algorithm for constraint bi- partite vertex cover. Journal of Algorithms, 38(2):374-410, 2001.","title":"An efficient exact algorithm for constraint bipartite vertex cover","authors":"Niedermeier Fernau, Henning Fernau, Rolf Niedermeier","year":"2001","venue":"Journal of Algorithms","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Freeman et al., 2017] Rupert Freeman, Seyed Majid Zahedi, and Vincent Conitzer. Fair and efficient social choice in dynamic settings. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 4580-4587, 2017.","title":"Fair and efficient social choice in dynamic settings","authors":"Freeman","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17)","doi":null,"url":null,"internal_url":"/proceedings/2017/639"},{"position":11,"raw":"[Garey and Johnson, 1979] M. R. Garey and David S. John- son. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. [Gupta et al., 2014] Anupam Gupta, Kunal Talwar, and Udi Wieder. Changing bases: Multistage optimization for ma- troids and matchings. In Proceedings of the 41st Interna- tional Colloquium on Automata, Languages, and Program- ming (ICALP '14), pages 563-575, 2014.","title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","authors":"M R Garey, David S Johnson, W H Freeman, Gupta","year":"1979","venue":"Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP '14)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Impagliazzo and Paturi, 2001] Russell Impagliazzo and Ra- mamohan Paturi. On the complexity of k-SAT. Journal of Computer and System Sciences, 62(2):367-375, 2001.","title":"Russell Impagliazzo and Ramamohan Paturi. On the complexity of k-SAT","authors":"Paturi Impagliazzo","year":"2001","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Impagliazzo et al., 2001] Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? Journal of Computer and System Sciences, 63(4):512-530, 2001.","title":"Which problems have strongly exponential complexity","authors":"Impagliazzo","year":"2001","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Jansen, 2016] Bart M. P. Jansen. Constrained bipartite vertex cover: The easy kernel is essentially tight. In Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS '16), volume 47 of LIPIcs, pages 45:1-45:13. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2016.","title":"Constrained bipartite vertex cover: The easy kernel is essentially tight","authors":"M P Bart, Jansen","year":"2016","venue":"Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS '16)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kellerhals et al., 2021] Leon Kellerhals, Malte Renken, and Philipp Zschoche. Parameterized algorithms for diverse multistage problems. In Proceedings of the 29th Annual European Symposium on Algorithms (ESA '21), pages 55:1- 55:17. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2021.","title":"Parameterized algorithms for diverse multistage problems","authors":"Leon Kellerhals, Malte Renken, Philipp Zschoche","year":"2021","venue":"Proceedings of the 29th Annual European Symposium on Algorithms (ESA '21)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kuo and Fuchs, 1987] Sy-Yen Kuo and W. Kent Fuchs. Ef- ficient spare allocation for reconfigurable arrays. IEEE Design & Test of Computers, 4(1):24-31, 1987.","title":"Efficient spare allocation for reconfigurable arrays","authors":"Sy-Yen Kuo, W Kent Fuchs","year":"1987","venue":"IEEE Design & Test of Computers","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lackner, 2020] Martin Lackner. Perpetual voting: Fairness in long-term decision making. In Proceedings of the 34th Conference on Artificial Intelligence (AAAI '20), pages 2103-2110, 2020.","title":"Perpetual voting: Fairness in long-term decision making","authors":"Martin Lackner","year":"2020","venue":"Proceedings of the 34th Conference on Artificial Intelligence (AAAI '20)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Lenstra Jr., 1983] Hendrik W. Lenstra Jr. Integer program- ming with a fixed number of variables. Mathematics of Operations Research, 8(4):538-548, 1983.","title":"Integer programming with a fixed number of variables","authors":"Hendrik W Lenstra","year":"1983","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Parkes and Procaccia, 2013] David C. Parkes and Ariel D. Procaccia. Dynamic social choice with evolving prefer- ences. In Proceedings of the 27th Conference on Artificial Intelligence (AAAI '13), page 767-773, 2013.","title":"Dynamic social choice with evolving preferences","authors":"David C Parkes, Ariel D Procaccia","year":"2013","venue":"Proceedings of the 27th Conference on Artificial Intelligence (AAAI '13)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Schaefer, 1978] Thomas J. Schaefer. The complexity of satis- fiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC'78), pages 216-226. ACM, 1978.","title":"The complexity of satisfiability problems","authors":"J Thomas, Schaefer","year":"1978","venue":"Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC'78)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Schmidt, 2010] Tatjana Schmidt. Computational complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas. PhD thesis, University of Cologne, 2010.","title":"Computational complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas","authors":"Tatjana Schmidt","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}