Piotr Faliszewski

According to our database1, Piotr Faliszewski authored at least 125 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting.
Theor. Comput. Sci., 2020

A characterization of the single-peaked single-crossing domain.
Soc. Choice Welf., 2020

Line-Up Elections: Parallel Voting with Shared Candidate Pool.
CoRR, 2020

The Complexity of Election Problems with Group-Separable Preferences.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Strategic Campaign Management in Apportionment Elections.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Isomorphic Distances Among Elections.
Proceedings of the Computer Science - Theory and Applications, 2020

Drawing a Map of Elections in the Space of Statistical Cultures.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Algorithms for Swap and Shift Bribery in Structured Elections.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

On Swap Convexity of Voting Rules.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Parameterized Algorithms for Finding a Collective Set of Items.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Committee Scoring Rules: Axiomatic Characterization and Hierarchy.
ACM Trans. Economics and Comput., 2019

Axiomatic characterization of committee scoring rules.
J. Econ. Theory, 2019

Recognizing Top-Monotonic Preference Profiles in Polynomial Time.
J. Artif. Intell. Res., 2019

Algorithms for destructive shift bribery.
Auton. Agents Multi Agent Syst., 2019

Multigoal Committee Selection.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

An Experimental View on Committees Providing Justified Representation.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Proportional Representation in Elections: STV vs PAV.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Approximation Algorithms for BalancedCC Multiwinner Rules.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Robustness of Approval-Based Multiwinner Voting Rules.
Proceedings of the Algorithmic Decision Theory - 6th International Conference, 2019

A Framework for Approval-Based Budgeting Methods.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

How Similar Are Two Elections?
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Approximation and Hardness of Shift-Bribery.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives.
Soc. Choice Welf., 2018

Achieving fully proportional representation by clustering voters.
J. Heuristics, 2018

Opinion Diffusion and Campaigning on Society Graphs.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Egalitarian Committee Scoring Rules.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Between Proportionality and Diversity: Balancing District Sizes under the Chamberlin-Courant Rule.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Optimization-Based Voting Rule Design: The Closer to Utopia the Better.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Effective Heuristics for Committee Scoring Rules.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Multiwinner Elections With Diversity Constraints.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Properties of multiwinner voting rules.
Soc. Choice Welf., 2017

Chamberlin-Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time.
J. Artif. Intell. Res., 2017

Elections with Few Voters: Candidate Control Can Be Easy.
J. Artif. Intell. Res., 2017

Multiwinner Voting in Genetic Algorithms.
IEEE Intell. Syst., 2017

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

The Complexity of Multiwinner Voting Rules with Variable Number of Winners.
CoRR, 2017

Campaign Management Under Approval-Driven Voting Rules.
Algorithmica, 2017

How hard is control in single-crossing elections?
Auton. Agents Multi Agent Syst., 2017

Robustness Among Multiwinner Voting Rules.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Committee Scoring Rules: A Call to Arms.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Two-Phase Strategy Managing Insensitivity in Global Optimization.
Proceedings of the Applications of Evolutionary Computation - 20th European Conference, 2017

How to choose a committee based on agents' preferences?
Proceedings of the 2017 International Conference on Behavioral, 2017

Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules.
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.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Control and Bribery in Voting.
Proceedings of the Handbook of Computational Social Choice, 2016

Parameterization in Computational Social Choice.
Encyclopedia of Algorithms, 2016

The Complexity of Voter Control and Shift Bribery Under Parliament Choosing Rules.
Trans. Comput. Collect. Intell., 2016

Large-Scale Election Campaigns: Combinatorial Shift Bribery.
J. Artif. Intell. Res., 2016

Prices matter for the parameterized complexity of shift bribery.
Inf. Comput., 2016

Modeling Representation of Minorities Under Multiwinner Voting Rules.
CoRR, 2016

The complexity of priced control in elections.
Ann. Math. Artif. Intell., 2016

Finding a collective set of items: From proportional multirepresentation to group recommendation.
Artif. Intell., 2016

On the Computational Cost and Complexity of Stochastic Inverse Solvers.
Comput. Sci., 2016

Voting-Based Group Formation.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Committee Scoring Rules: Axiomatic Classification and Hierarchy.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

How Hard Is It for a Party to Nominate an Election Winner?.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Multiwinner Voting in Genetic Algorithms for Solving Ill-Posed Global Optimization Problems.
Proceedings of the Applications of Evolutionary Computation - 19th European Conference, 2016

Complexity of Shift Bribery in Committee Elections.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Noncooperative Game Theory.
Proceedings of the Economics and Computation, 2016

2015
The complexity of fully proportional representation for single-crossing electorates.
Theor. Comput. Sci., 2015

Combinatorial voter control in elections.
Theor. Comput. Sci., 2015

Distance rationalization of voting rules.
Soc. Choice Welf., 2015

Weighted Electoral Control.
J. Artif. Intell. Res., 2015

Achieving fully proportional representation: Approximability results.
Artif. Intell., 2015

Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting.
Auton. Agents Multi Agent Syst., 2015

The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract).
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Elections with Few Candidates: Prices, Weights, and Covering Problems.
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.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

The Complexity of Recognizing Incomplete Single-Crossing Preferences.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Possible Winners in Noisy Elections.
CoRR, 2014

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.
CoRR, 2014

The complexity of manipulative attacks in nearly single-peaked electorates.
Artif. Intell., 2014

Recognizing 1-Euclidean Preferences: An Alternative Approach.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Combinatorial Voter Control in Elections.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Approximating the MaxCover Problem with Bounded Frequencies in FPT Time.
CoRR, 2013

Fully Proportional Representation as Resource Allocation: Approximability Results.
Proceedings of the IJCAI 2013, 2013

A Richer Understanding of the Complexity of Election Systems.
Proceedings of the Fundamental Problems in Computing, 2013

Achieving fully proportional representation is easy in practice.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

The complexity of losing voters.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

On swap-distance geometry of voting rules.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Rationalizations of Condorcet-consistent rules via distances of hamming type.
Soc. Choice Welf., 2012

Proportional Representation as Resource Allocation: Approximability Results
CoRR, 2012

Manipulating the quota in weighted voting games.
Artif. Intell., 2012

Clone structures in voters' preferences.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Weighted Manipulation for Four-Candidate Llull Is Easy.
Proceedings of the ECAI 2012, 2012

Campaigns for lazy voters: truncated ballots.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Possible Winners in Noisy Elections.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Multimode Control Attacks on Elections.
J. Artif. Intell. Res., 2011

Cloning in Elections: Finding the Possible Winners.
J. Artif. Intell. Res., 2011

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

An NTU Cooperative Game Theoretic View of Manipulating Elections.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Coalitional Voting Manipulation: A Game-Theoretic Perspective.
Proceedings of the IJCAI 2011, 2011

Homogeneity and monotonicity of distance-rationalizable voting rules.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Constrained Coalition Formation.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
On the Autoreducibility of Functions.
Theory Comput. Syst., 2010

Using complexity to protect elections.
Commun. ACM, 2010

AI's War on Manipulation: Are We Winning?
AI Magazine, 2010

Approximation Algorithms for Campaign Management.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

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

On the role of distances in defining voting rules.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Good Rationalizations of Voting Rules.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Cloning in Elections.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Probabilistic Possible Winner Determination.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
The complexity of power-index comparison.
Theor. Comput. Sci., 2009

Llull and Copeland Voting Computationally Resist Bribery and Constructive Control.
J. Artif. Intell. Res., 2009

How Hard Is Bribery in Elections?
J. Artif. Intell. Res., 2009

On distance rationalizability of some voting rules.
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009

Swap Bribery.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Boolean combinations of weighted voting games.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
The consequences of eliminating NP solutions.
Comput. Sci. Rev., 2008

Llull and Copeland Voting Computationally Resist Bribery and Control
CoRR, 2008

Copeland voting: ties matter.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

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

Copeland Voting Fully Resists Constructive Control.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

Approximability of Manipulating Elections.
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.
SIGACT News, 2007

Llull and Copeland Voting Broadly Resist Bribery and Control.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Open questions in the theory of semifeasible computation.
SIGACT News, 2006

The Complexity of Bribery in Elections.
Proceedings of the Proceedings, 2006

2005
Properties of uniformly hard languages.
Inf. Process. Lett., 2005

Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties.
Int. J. Found. Comput. Sci., 2005

Separating the Notions of Self- and Autoreducibility.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
Exponential time reductions and sparse languages in NEXP
Electronic Colloquium on Computational Complexity (ECCC), 2004


  Loading...