Piotr Faliszewski

Proceedings of the Computer Science - Theory and Applications, 2020

Drawing a Map of Elections in the Space of Statistical Cultures.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Algorithms for Swap and Shift Bribery in Structured Elections.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

On Swap Convexity of Voting Rules.

[BibT_eX]

[DOI]

Svetlana Obraztsova

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Parameterized Algorithms for Finding a Collective Set of Items.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Committee Scoring Rules: Axiomatic Characterization and Hierarchy.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2019

Axiomatic characterization of committee scoring rules.

[BibT_eX]

[DOI]

J. Econ. Theory, 2019

Recognizing Top-Monotonic Preference Profiles in Polynomial Time.

[BibT_eX]

[DOI]

Krzysztof Magiera

J. Artif. Intell. Res., 2019

Algorithms for destructive shift bribery.

[BibT_eX]

[DOI]

Andrzej Kaczmarczyk

Auton. Agents Multi Agent Syst., 2019

Multigoal Committee Selection.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

An Experimental View on Committees Providing Justified Representation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Proportional Representation in Elections: STV vs PAV.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Approximation Algorithms for BalancedCC Multiwinner Rules.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Robustness of Approval-Based Multiwinner Voting Rules.

[BibT_eX]

[DOI]

Grzegorz Gawron

Proceedings of the Algorithmic Decision Theory - 6th International Conference, 2019

A Framework for Approval-Based Budgeting Methods.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

How Similar Are Two Elections?

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2018

Achieving fully proportional representation by clustering voters.

[BibT_eX]

[DOI]

J. Heuristics, 2018

Egalitarian Committee Scoring Rules.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Between Proportionality and Diversity: Balancing District Sizes under the Chamberlin-Courant Rule.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Optimization-Based Voting Rule Design: The Closer to Utopia the Better.

[BibT_eX]

[DOI]

Stanislaw Szufa

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Effective Heuristics for Committee Scoring Rules.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Multiwinner Elections With Diversity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Properties of multiwinner voting rules.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2017

Chamberlin-Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

Elections with Few Voters: Candidate Control Can Be Easy.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

Multiwinner Voting in Genetic Algorithms.

[BibT_eX]

[DOI]

IEEE Intell. Syst., 2017

Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

The Complexity of Multiwinner Voting Rules with Variable Number of Winners.

[BibT_eX]

[DOI]

CoRR, 2017

Campaign Management Under Approval-Driven Voting Rules.

[BibT_eX]

[DOI]

Ildikó Schlotter

Algorithmica, 2017

How hard is control in single-crossing elections?

[BibT_eX]

[DOI]

Krzysztof Magiera

Auton. Agents Multi Agent Syst., 2017

Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Committee Scoring Rules: A Call to Arms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Two-Phase Strategy Managing Insensitivity in Global Optimization.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computation - 20th European Conference, 2017

How to choose a committee based on agents' preferences?

[BibT_eX]

[DOI]

Proceedings of the 2017 International Conference on Behavioral, 2017

Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain.

[BibT_eX]

[DOI]

Jean-François Laslier

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Control and Bribery in Voting.

[BibT_eX]

[DOI]

Jörg Rothe

Proceedings of the Handbook of Computational Social Choice, 2016

Parameterization in Computational Social Choice.

[BibT_eX]

[DOI]

Rolf Niedermeier

Encyclopedia of Algorithms, 2016

The Complexity of Voter Control and Shift Bribery Under Parliament Choosing Rules.

[BibT_eX]

[DOI]

Tomasz Put

Trans. Comput. Collect. Intell., 2016

Large-Scale Election Campaigns: Combinatorial Shift Bribery.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

Prices matter for the parameterized complexity of shift bribery.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Modeling Representation of Minorities Under Multiwinner Voting Rules.

[BibT_eX]

[DOI]

Jean-François Laslier

CoRR, 2016

The complexity of priced control in elections.

[BibT_eX]

[DOI]

Tomasz Miasko

Ann. Math. Artif. Intell., 2016

Finding a collective set of items: From proportional multirepresentation to group recommendation.

[BibT_eX]

[DOI]

Jérôme Lang

Artif. Intell., 2016

On the Computational Cost and Complexity of Stochastic Inverse Solvers.

[BibT_eX]

[DOI]

Comput. Sci., 2016

Voting-Based Group Formation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Committee Scoring Rules: Axiomatic Classification and Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

How Hard Is It for a Party to Nominate an Election Winner?.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Multiwinner Voting in Genetic Algorithms for Solving Ill-Posed Global Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computation - 19th European Conference, 2016

Noncooperative Game Theory.

[BibT_eX]

[DOI]

Irene Rothe

Jörg Rothe

Proceedings of the Economics and Computation, 2016

2015

The complexity of fully proportional representation for single-crossing electorates.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Combinatorial voter control in elections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Distance rationalization of voting rules.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2015

Weighted Electoral Control.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

Achieving fully proportional representation: Approximability results.

[BibT_eX]

[DOI]

Artif. Intell., 2015

Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2015

The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Elections with Few Candidates: Prices, Weights, and Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Fully Proportional Representation with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

The Complexity of Recognizing Incomplete Single-Crossing Preferences.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Possible Winners in Noisy Elections.

[BibT_eX]

[DOI]

CoRR, 2014

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.

[BibT_eX]

[DOI]

CoRR, 2014

The complexity of manipulative attacks in nearly single-peaked electorates.

[BibT_eX]

[DOI]

Artif. Intell., 2014

Recognizing 1-Euclidean Preferences: An Alternative Approach.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Combinatorial Voter Control in Elections.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Approximating the MaxCover Problem with Bounded Frequencies in FPT Time.

[BibT_eX]

[DOI]

CoRR, 2013

Fully Proportional Representation as Resource Allocation: Approximability Results.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

A Richer Understanding of the Complexity of Election Systems.

[BibT_eX]

[DOI]

Proceedings of the Fundamental Problems in Computing, 2013

Achieving fully proportional representation is easy in practice.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

The complexity of losing voters.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

On swap-distance geometry of voting rules.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012

Rationalizations of Condorcet-consistent rules via distances of hamming type.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2012

Proportional Representation as Resource Allocation: Approximability Results

[BibT_eX]

[DOI]

CoRR, 2012

Manipulating the quota in weighted voting games.

[BibT_eX]

[DOI]

Artif. Intell., 2012

Clone structures in voters' preferences.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Weighted Manipulation for Four-Candidate Llull Is Easy.

[BibT_eX]

[DOI]

Henning Schnoor

Proceedings of the ECAI 2012, 2012

Campaigns for lazy voters: truncated ballots.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Possible Winners in Noisy Elections.

[BibT_eX]

[DOI]

Krzysztof Wojtas

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Multimode Control Attacks on Elections.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2011

Cloning in Elections: Finding the Possible Winners.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2011

The shield that never was: Societies with single-peaked preferences are more open to manipulation and control.

[BibT_eX]

[DOI]

Inf. Comput., 2011

An NTU Cooperative Game Theoretic View of Manipulating Elections.

[BibT_eX]

[DOI]

Michael Zuckerman

Vincent Conitzer

Jeffrey S. Rosenschein

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Coalitional Voting Manipulation: A Game-Theoretic Perspective.

[BibT_eX]

[DOI]

Yoram Bachrach

Proceedings of the IJCAI 2011, 2011

Homogeneity and monotonicity of distance-rationalizable voting rules.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Constrained Coalition Formation.

[BibT_eX]

[DOI]

Michael J. Wooldridge

Nicholas R. Jennings

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

On the Autoreducibility of Functions.

[BibT_eX]

[DOI]

Mitsunori Ogihara

Theory Comput. Syst., 2010

Using complexity to protect elections.

[BibT_eX]

[DOI]

Commun. ACM, 2010

AI's War on Manipulation: Are We Winning?

[BibT_eX]

[DOI]

Ariel D. Procaccia

AI Mag., 2010

Approximation Algorithms for Campaign Management.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Manipulation of copeland elections.

[BibT_eX]

[DOI]

Henning Schnoor

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

On the role of distances in defining voting rules.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Good Rationalizations of Voting Rules.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Cloning in Elections.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Probabilistic Possible Winner Determination.

[BibT_eX]

[DOI]

Yoram Bachrach

Nadja Betzler

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

The complexity of power-index comparison.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Llull and Copeland Voting Computationally Resist Bribery and Constructive Control.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2009

How Hard Is Bribery in Elections?

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2009

On distance rationalizability of some voting rules.

[BibT_eX]

[DOI]

Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009

Swap Bribery.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Boolean combinations of weighted voting games.

[BibT_eX]

[DOI]

Michael J. Wooldridge

Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008

The consequences of eliminating NP solutions.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2008

Llull and Copeland Voting Computationally Resist Bribery and Control

[BibT_eX]

[DOI]

CoRR, 2008

Copeland voting: ties matter.

[BibT_eX]

[DOI]

Henning Schnoor

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Nonuniform bribery.

[BibT_eX]

[DOI]

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Copeland Voting Fully Resists Constructive Control.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2008

Approximability of Manipulating Elections.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Review of "Complexity Theory and Cryptology: An Introduction to Cryptocomplexity by Jörg Rothe", Springer, 2005, 484 pages.

[BibT_eX]

[DOI]

SIGACT News, 2007

Llull and Copeland Voting Broadly Resist Bribery and Control.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Open questions in the theory of semifeasible computation.

[BibT_eX]

[DOI]

SIGACT News, 2006

The Complexity of Bribery in Elections.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

Properties of uniformly hard languages.

[BibT_eX]

[DOI]

Janusz Jarosz

Inf. Process. Lett., 2005

Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Separating the Notions of Self- and Autoreducibility.

[BibT_eX]

[DOI]

Mitsunori Ogihara

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Exponential time reductions and sparse languages in NEXP

[BibT_eX]

[DOI]