| Publication | Date of Publication | Type |
|---|
Robustness of participatory budgeting outcomes: complexity and experiments
| 2024-05-29 | Paper |
Justifying groups in multiwinner approval voting
Theoretical Computer Science | 2023-08-01 | Paper |
Justifying groups in multiwinner approval voting
Algorithmic Game Theory | 2023-07-28 | Paper |
Correction to: Opinion diffusion and campaigning on society graphs
Journal Of Logic And Computation | 2023-05-16 | Paper |
Line-up elections: parallel voting with shared candidate pool
| 2022-12-21 | Paper |
Isomorphic Distances Among Elections
Computer Science – Theory and Applications | 2022-10-19 | Paper |
Complexity of shift bribery in committee elections
ACM Transactions on Computation Theory | 2022-09-24 | Paper |
Opinion diffusion and campaigning on society graphs
Journal Of Logic And Computation | 2022-09-08 | Paper |
Approximation and hardness of shift-bribery
Artificial Intelligence | 2021-11-02 | Paper |
Robustness among multiwinner voting rules
Artificial Intelligence | 2021-08-16 | Paper |
Multiwinner rules with variable number of winners
| 2021-07-06 | Paper |
Control and bribery in voting
| 2020-11-12 | Paper |
A characterization of the single-peaked single-crossing domain
Social Choice and Welfare | 2020-05-12 | Paper |
Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
Theoretical Computer Science | 2020-03-12 | Paper |
Robustness of approval-based multiwinner voting rules
| 2020-01-27 | Paper |
Recognizing top-monotonic preference profiles in polynomial time
Journal of Artificial Intelligence Research | 2019-09-13 | Paper |
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
Social Choice and Welfare | 2019-06-12 | Paper |
Axiomatic characterization of committee scoring rules
Journal of Economic Theory | 2019-02-28 | Paper |
Robustness among multiwinner voting rules
Algorithmic Game Theory | 2018-02-13 | Paper |
Elections with few voters: candidate control can be easy
Journal of Artificial Intelligence Research | 2018-01-12 | Paper |
Chamberlin-Courant rule with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time
Journal of Artificial Intelligence Research | 2017-12-08 | Paper |
scientific article; zbMATH DE number 6747953 (Why is no real title available?)
| 2017-07-18 | Paper |
Properties of multiwinner voting rules
Social Choice and Welfare | 2017-06-02 | Paper |
Campaign management under approval-driven voting rules
Algorithmica | 2017-03-06 | Paper |
Prices matter for the parameterized complexity of shift bribery
Information and Computation | 2016-11-18 | Paper |
Finding a collective set of items: from proportional multirepresentation to group recommendation
Artificial Intelligence | 2016-11-01 | Paper |
The complexity of priced control in elections
Annals of Mathematics and Artificial Intelligence | 2016-09-16 | Paper |
Large-scale election campaigns: combinatorial shift bribery
The Journal of Artificial Intelligence Research (JAIR) | 2016-04-19 | Paper |
Weighted manipulation for four-candidate Llull is easy
| 2015-12-11 | Paper |
Distance rationalization of voting rules
Social Choice and Welfare | 2015-11-12 | Paper |
Elections with few candidates: prices, weights, and covering problems
Algorithmic Decision Theory | 2015-11-04 | Paper |
The complexity of manipulative attacks in nearly single-peaked electorates
Artificial Intelligence | 2015-08-27 | Paper |
Combinatorial voter control in elections
Theoretical Computer Science | 2015-06-01 | Paper |
Weighted electoral control
Journal of Artificial Intelligence Research | 2015-04-22 | Paper |
The complexity of fully proportional representation for single-crossing electorates
Theoretical Computer Science | 2015-01-28 | Paper |
Recognizing 1-Euclidean preferences: an alternative approach
Algorithmic Game Theory | 2015-01-14 | Paper |
Combinatorial voter control in elections
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
The consequences of eliminating NP solutions
Computer Science Review | 2014-10-07 | Paper |
Rationalizations of Condorcet-consistent rules via distances of Hamming type
Social Choice and Welfare | 2014-05-16 | Paper |
The complexity of fully proportional representation for single-crossing electorates
Algorithmic Game Theory | 2013-10-23 | Paper |
Manipulating the quota in weighted voting games
Artificial Intelligence | 2012-05-23 | Paper |
Cloning in elections: finding the possible winners
| 2012-01-12 | Paper |
Multimode control attacks on elections
Journal of Artificial Intelligence Research | 2011-03-08 | Paper |
The shield that never was: societies with single-peaked preferences are more open to manipulation and control
Information and Computation | 2011-02-21 | Paper |
On the autoreducibility of functions
Theory of Computing Systems | 2010-05-10 | Paper |
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
Journal of Artificial Intelligence Research | 2009-12-10 | Paper |
How hard is bribery in elections?
Journal of Artificial Intelligence Research | 2009-12-10 | Paper |
Properties of uniformly hard languages
Information Processing Letters | 2009-12-04 | Paper |
Swap bribery
Algorithmic Game Theory | 2009-12-01 | Paper |
A Richer Understanding of the Complexity of Election Systems
Fundamental Problems in Computing | 2009-08-05 | Paper |
The complexity of power-index comparison
Theoretical Computer Science | 2009-02-19 | Paper |
The Complexity of Power-Index Comparison
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Copeland Voting Fully Resists Constructive Control
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES
International Journal of Foundations of Computer Science | 2005-11-14 | Paper |
