Piotr Faliszewski
42 papers · 2013–2026 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+13 more ↓ Show less ↑
🌍 Conference Polyglot (4) 🏃 Academic Marathon (12) 🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge 🐝 Cross-Pollinator (3)
🐝
Cross-Pollinator
(3)
🌈
Renaissance Researcher
(5)
🗺️
Taxonomy Completionist
(29)
🏠
Conference Loyalist
(26)
🤝
Dynamic Duo
(12)
🔬
Deep Specialist
(12)
🏆
Keyword Champion
(13)
⚡
Prolific Year
(5)
🚀
Conference Pioneer
🔥
Unstoppable
(11)
🗃️
Keyword Collector
(143)
💎
Century Club
(39)
❓
The Questioner
(3)
Conferences
IJCAI (26)
AAAI (14)
ICML (1)
NIPS (1)
Top co-authors
Keywords
computational complexity
(13)
approval voting
(10)
voting rule
(8)
approximation algorithm
(4)
preference order
(4)
preference aggregation
(4)
combinatorial optimization
(4)
social choice
(4)
election analysis
(3)
participatory budgeting
(3)
committee selection
(3)
voting theory
(3)
justified representation
(3)
preference profile
(2)
proportional representation
(2)
mallows model
(2)
axiomatic analysis
(2)
multiwinner voting
(2)
computational social choice
(2)
voting system
(2)
Papers
Identifying Imperfect Clones in Elections
AAAI 2026
Diversity of Structured Domains via k-Kemeny Scores
AAAI 2026
Computing Equilibrium Nominations in Presidential Elections
AAAI 2026
Participatory Budgeting Project Strength via Candidate Control
IJCAI 2025
Distances Between Top-Truncated Elections of Different Sizes
AAAI 2025
Guide to Numerical Experiments on Elections in Computational Social Choice
IJCAI 2024
Evaluation of Project Performance in Participatory Budgeting
IJCAI 2024
Properties of the Mallows Model Depending on the Number of Alternatives: A Warning for an Experimentalist
ICML 2023
Diversity, Agreement, and Polarization in Elections
IJCAI 2023
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections
IJCAI 2023
Participatory Budgeting: Data, Tools and Analysis
IJCAI 2023
Properties of Position Matrices and Their Elections
AAAI 2023
Ties in Multiwinner Approval Voting
IJCAI 2023
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning
NIPS 2022
The Price of Justified Representation
AAAI 2022
The Complexity of Subelection Isomorphism Problems
AAAI 2022
The Complexity of Proportionality Degree in Committee Elections
AAAI 2022
Understanding Distance Measures Among Elections
IJCAI 2022
How to Sample Approval Elections?
IJCAI 2022
Putting a Compass on the Map of Elections
IJCAI 2021
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments
IJCAI 2021
An Analysis of Approval-Based Committee Rules for 2D-Euclidean Elections
AAAI 2021
Parameterized Algorithms for Finding a Collective Set of Items
AAAI 2020
On Swap Convexity of Voting Rules
AAAI 2020
Strategic Campaign Management in Apportionment Elections
IJCAI 2020
The Complexity of Election Problems with Group-Separable Preferences
IJCAI 2020
An Experimental View on Committees Providing Justified Representation
IJCAI 2019
Multigoal Committee Selection
IJCAI 2019
A Framework for Approval-Based Budgeting Methods
AAAI 2019
Approximation and Hardness of Shift-Bribery
AAAI 2019
How Similar Are Two Elections?
AAAI 2019
Egalitarian Committee Scoring Rules
IJCAI 2018
Opinion Diffusion and Campaigning on Society Graphs
IJCAI 2018
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality
IJCAI 2017
Recognizing Top-Monotonic Preference Profiles in Polynomial Time
IJCAI 2017
Committee Scoring Rules: A Call to Arms
IJCAI 2017
Multiwinner Rules on Paths From k-Borda to Chamberlin–Courant
IJCAI 2017
Voting-Based Group Formation
IJCAI 2016
Committee Scoring Rules: Axiomatic Classification and Hierarchy
IJCAI 2016
How Hard Is It for a Party to Nominate an Election Winner?
IJCAI 2016
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract)
IJCAI 2015
Fully Proportional Representation as Resource Allocation: Approximability Results
IJCAI 2013