Multiwinner voting: A new challenge for social choice theory P Faliszewski, P Skowron, A Slinko, N Talmon Trends in computational social choice 74 (2017), 27-47, 2017 | 285 | 2017 |
The PACE 2017 parameterized algorithms and computational experiments challenge: The second iteration H Dell, C Komusiewicz, N Talmon, M Weller 12th international symposium on parameterized and exact computation (IPEC 2017), 2018 | 110 | 2018 |
Proportionally representative participatory budgeting: Axioms and algorithms H Aziz, B Lee, N Talmon arXiv preprint arXiv:1711.08226, 2017 | 97 | 2017 |
A framework for approval-based budgeting methods N Talmon, P Faliszewski Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2181-2188, 2019 | 86 | 2019 |
Pairwise Liquid Democracy. M Brill, N Talmon IJCAI 18, 137-143, 2018 | 74 | 2018 |
What do multiwinner voting rules do? An experiment over the two-dimensional euclidean domain E Elkind, P Faliszewski, JF Laslier, P Skowron, A Slinko, N Talmon Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 73 | 2017 |
Elections with Few Voters: Candidate Control Can Be Easy J Chen, P Faliszewski, R Niedermeier, N Talmon AAAI 15, 2045-2051, 2015 | 62 | 2015 |
Opinion diffusion and campaigning on society graphs P Faliszewski, R Gonen, M Koutecký, N Talmon Journal of Logic and Computation 32 (6), 1162-1194, 2022 | 56 | 2022 |
Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives P Faliszewski, P Skowron, AM Slinko, N Talmon AAAI, 482-488, 2016 | 54 | 2016 |
Committee Scoring Rules: Axiomatic Classification and Hierarchy P Faliszewski, P Skowron, A Slinko, N Talmon IJCAI, 250-256, 2016 | 52 | 2016 |
Bribery as a measure of candidate success: Complexity results for approval-based multiwinner rules P Faliszewski, P Skowron, N Talmon arXiv preprint arXiv:2104.09130, 2021 | 50 | 2021 |
Complexity of shift bribery in committee elections R Bredereck, P Faliszewski, R Niedermeier, N Talmon Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016 | 48 | 2016 |
Robustness among multiwinner voting rules R Bredereck, P Faliszewski, A Kaczmarczyk, R Niedermeier, P Skowron, ... International Symposium on Algorithmic Game Theory, 80-92, 2017 | 45 | 2017 |
Drawing a map of elections in the space of statistical cultures S Szufa, P Faliszewski, P Skowron, A Slinko, N Talmon Proceedings of the 19th International Conference on Autonomous Agents and …, 2020 | 44 | 2020 |
Large-scale election campaigns: Combinatorial shift bribery R Bredereck, P Faliszewski, R Niedermeier, N Talmon Journal of Artificial Intelligence Research 55, 603-652, 2016 | 44 | 2016 |
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant. P Faliszewski, P Skowron, A Slinko, N Talmon IJCAI, 192-198, 2017 | 43 | 2017 |
Precedence-constrained scheduling problems parameterized by partial order width R Van Bevern, R Bredereck, L Bulteau, C Komusiewicz, N Talmon, ... International conference on discrete optimization and operations research …, 2016 | 43 | 2016 |
Committee scoring rules: Axiomatic characterization and hierarchy P Faliszewski, P Skowron, A Slinko, N Talmon ACM Transactions on Economics and Computation (TEAC) 7 (1), 1-39, 2019 | 42 | 2019 |
Participatory Budgeting with Project Interactions. P Jain, K Sornat, N Talmon IJCAI, 386-392, 2020 | 38 | 2020 |
The complexity of degree anonymization by vertex addition R Bredereck, V Froese, S Hartung, A Nichterlein, R Niedermeier, ... Theoretical Computer Science 607, 16-34, 2015 | 32 | 2015 |