Follow
Nimrod Talmon
Title
Cited by
Cited by
Year
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
2312017
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
852018
Proportionally representative participatory budgeting: Axioms and algorithms
H Aziz, B Lee, N Talmon
arXiv preprint arXiv:1711.08226, 2017
702017
Pairwise Liquid Democracy.
M Brill, N Talmon
IJCAI 18, 137-143, 2018
602018
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
582017
A framework for approval-based budgeting methods
N Talmon, P Faliszewski
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2181-2188, 2019
562019
Elections with Few Voters: Candidate Control Can Be Easy
J Chen, P Faliszewski, R Niedermeier, N Talmon
AAAI 15, 2045-2051, 2015
562015
Committee Scoring Rules: Axiomatic Classification and Hierarchy
P Faliszewski, P Skowron, A Slinko, N Talmon
IJCAI, 250-256, 2016
492016
Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives
P Faliszewski, P Skowron, AM Slinko, N Talmon
AAAI, 482-488, 2016
472016
Complexity of shift bribery in committee elections
R Bredereck, P Faliszewski, R Niedermeier, N Talmon
Thirtieth AAAI Conference on Artificial Intelligence, 2016
452016
Large-scale election campaigns: Combinatorial shift bribery
R Bredereck, P Faliszewski, R Niedermeier, N Talmon
Journal of Artificial Intelligence Research 55, 603-652, 2016
422016
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
412021
Robustness among multiwinner voting rules
R Bredereck, P Faliszewski, A Kaczmarczyk, R Niedermeier, P Skowron, ...
Algorithmic Game Theory: 10th International Symposium, SAGT 2017, L’Aquila …, 2017
412017
Opinion diffusion and campaigning on society graphs
P Faliszewski, R Gonen, M KoutecÝ, N Talmon
Journal of Logic and Computation 32 (6), 1162-1194, 2022
402022
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant.
P Faliszewski, P Skowron, A Slinko, N Talmon
IJCAI, 192-198, 2017
362017
Precedence-constrained scheduling problems parameterized by partial order width
R Van Bevern, R Bredereck, L Bulteau, C Komusiewicz, N Talmon, ...
Discrete Optimization and Operations Research: 9th International Conference …, 2016
342016
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
322015
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
312019
Elections with few candidates: Prices, weights, and covering problems
R Bredereck, P Faliszewski, R Niedermeier, P Skowron, N Talmon
Algorithmic Decision Theory: 4th International Conference, ADT 2015 …, 2015
312015
Combinatorial voter control in elections
J Chen, P Faliszewski, R Niedermeier, N Talmon
Mathematical Foundations of Computer Science 2014: 39th International …, 2014
30*2014
The system can't perform the operation now. Try again later.
Articles 1–20