Piotr Faliszewski

273 papers A* 66A 30B 12C 4Misc 1Journal 143Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Computational Social Choice: Research & Development.
CoRR
Dorothea Baumeister, Ratip Emin Berker, Niclas Boehmer, Sylvain Bouveret, Andreas Darmann, Piotr Faliszewski, Martin Lackner, Jérôme Lang, Nicholas Mattei, Arianna Novaro
2026 A* conf
Computing Equilibrium Nominations in Presidential Elections.
AAAI
Piotr Faliszewski, Stanislaw Kazmierowski, Grzegorz Lisowski, Ildikó Schlotter, Paolo Turrini
2026 J jnl
Distances Between Top-Truncated Elections of Different Sizes.
CoRR
Piotr Faliszewski, Jitka Mertlová, Pierre Nunn, Stanislaw Szufa, Tomasz Was
2026 A* conf
Diversity of Structured Domains via k-Kemeny Scores.
AAAI
Piotr Faliszewski, Krzysztof Sornat, Stanislaw Szufa, Tomasz Was
2026 J jnl
How Similar Are Two Elections?
CoRR
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Krzysztof Sornat, Stanislaw Szufa, Nimrod Talmon
2026 J jnl
How to Tamper with a Parliament: Strategic Campaigns in Apportionment Elections.
CoRR
Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk, Joanna Kaczmarek, Martin Lackner, Christian Laußmann, Jörg Rothe, Tessa Seeger
2026 J jnl
How to tamper with a Parliament: Strategic campaigns in apportionment elections.
J. Comput. Syst. Sci.
Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk, Joanna Kaczmarek, Martin Lackner, Christian Laußmann, Jörg Rothe, Tessa Seeger
2026 A* conf
Identifying Imperfect Clones in Elections.
AAAI
Piotr Faliszewski, Lukasz Janeczko, Grzegorz Lisowski, Kristýna Pekárková, Ildikó Schlotter
2026 J jnl
Learning Real-Life Approval Elections.
CoRR
Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Marcin Kurdziel, Grzegorz Pierczynski, Stanislaw Szufa
2026 J jnl
Maps of Tournaments: Distances, Experiments, and Data.
CoRR
Filip Nikolow, Piotr Faliszewski, Stanislaw Szufa
2026 J jnl
Outer Diversity of Structured Domains.
CoRR
Piotr Faliszewski, Krzysztof Sornat, Stanislaw Szufa, Tomasz Was
2026 J jnl
Participatory Budgeting Project Strength via Candidate Control.
CoRR
Piotr Faliszewski, Lukasz Janeczko, Dusan Knop, Jan Pokorný, Simon Schierreich, Mateusz Sluszniak, Krzysztof Sornat
2026 J jnl
Robustness of Approval-Based Multiwinner Voting Rules.
CoRR
Piotr Faliszewski, Grzegorz Gawron, Bartosz Kusek
2025 J jnl
Computing Equilibrium Nominations in Presidential Elections.
CoRR
Piotr Faliszewski, Stanislaw Kazmierowski, Grzegorz Lisowski, Ildikó Schlotter, Paolo Turrini
2025 A* conf
Distances Between Top-Truncated Elections of Different Sizes.
AAAI
Piotr Faliszewski, Jitka Mertlová, Pierre Nunn, Stanislaw Szufa, Tomasz Was
2025 J jnl
Diversity of Structured Domains via k-Kemeny Scores.
CoRR
Piotr Faliszewski, Krzysztof Sornat, Stanislaw Szufa, Tomasz Was
2025 J jnl
Drawing a Map of Elections.
CoRR
Stanislaw Szufa, Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2025 J jnl
Drawing a map of elections.
Artif. Intell.
Stanislaw Szufa, Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2025 J jnl
How similar are two elections?
J. Comput. Syst. Sci.
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Krzysztof Sornat, Stanislaw Szufa, Nimrod Talmon
2025 J jnl
Identifying Imperfect Clones in Elections.
CoRR
Piotr Faliszewski, Lukasz Janeczko, Grzegorz Lisowski, Kristýna Pekárková, Ildikó Schlotter
2025 A conf
Learning Real-Life Approval Elections.
AAMAS
Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Marcin Kurdziel, Grzegorz Pierczynski, Stanislaw Szufa
2025 A conf
Maps of Tournaments: Distances, Experiments, and Data.
ECAI
Filip Nikolow, Piotr Faliszewski, Stanislaw Szufa
2025 A conf
Participatory Budgeting Project Strength via Candidate Control.
AAMAS
Piotr Faliszewski, Lukasz Janeczko, Dusan Knop, Jan Pokorný, Simon Schierreich, Mateusz Sluszniak, Krzysztof Sornat
2025 A* conf
Participatory Budgeting Project Strength via Candidate Control.
IJCAI
Piotr Faliszewski, Lukasz Janeczko, Dusan Knop, Jan Pokorný, Simon Schierreich, Mateusz Sluszniak, Krzysztof Sornat
2025 J jnl
Project Submission Games in Participatory Budgeting.
CoRR
Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Grzegorz Pierczynski
2024 J jnl
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections.
CoRR
Piotr Faliszewski, Martin Lackner, Krzysztof Sornat, Stanislaw Szufa
2024 A* conf
Evaluation of Project Performance in Participatory Budgeting.
IJCAI
Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Dominik Peters, Grzegorz Pierczynski, Simon Schierreich, Piotr Skowron, Stanislaw Szufa
2024 A* conf
Guide to Numerical Experiments on Elections in Computational Social Choice.
IJCAI
Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Grzegorz Pierczynski, Simon Rey, Dariusz Stolicki, Stanislaw Szufa, Tomasz Was
2024 J jnl
Guide to Numerical Experiments on Elections in Computational Social Choice.
CoRR
Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Grzegorz Pierczynski, Simon Rey, Dariusz Stolicki, Stanislaw Szufa, Tomasz Was
2024 J jnl
Properties of the Mallows Model Depending on the Number of Alternatives: A Warning for an Experimentalist.
CoRR
Niclas Boehmer, Piotr Faliszewski, Sonja Kraiczy
2024 A conf
Selecting Representative Bodies: An Axiomatic View.
AAMAS
Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind
2024 A conf
Strategic Cost Selection in Participatory Budgeting.
AAMAS
Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Piotr Skowron, Stanislaw Szufa
2024 J jnl
Strategic Cost Selection in Participatory Budgeting.
CoRR
Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Piotr Skowron, Stanislaw Szufa
2024 J jnl
The Complexity of Subelection Isomorphism Problems.
J. Artif. Intell. Res.
Piotr Faliszewski, Krzysztof Sornat, Stanislaw Szufa
2024 J jnl
The Price of Justified Representation.
ACM Trans. Economics and Comput.
Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong
2023 A* conf
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections.
IJCAI
Piotr Faliszewski, Martin Lackner, Krzysztof Sornat, Stanislaw Szufa
2023 A conf
Bribery Can Get Harder in Structured Multiwinner Approval Election.
AAMAS
Bartosz Kusek, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop
2023 J jnl
Correction to: Opinion diffusion and campaigning on society graphs.
J. Log. Comput.
Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon
2023 A* conf
Diversity, Agreement, and Polarization in Elections.
IJCAI
Piotr Faliszewski, Andrzej Kaczmarczyk, Krzysztof Sornat, Stanislaw Szufa, Tomasz Was
2023 J jnl
Diversity, Agreement, and Polarization in Elections.
CoRR
Piotr Faliszewski, Andrzej Kaczmarczyk, Krzysztof Sornat, Stanislaw Szufa, Tomasz Was
2023 J jnl
Evaluation of Project Performance in Participatory Budgeting.
CoRR
Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Dominik Peters, Grzegorz Pierczynski, Simon Schierreich, Piotr Skowron, Stanislaw Szufa
2023 J jnl
Justifying groups in multiwinner approval voting.
Theor. Comput. Sci.
Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong
2023 A* conf
Participatory Budgeting: Data, Tools and Analysis.
IJCAI
Piotr Faliszewski, Jaroslaw Flis, Dominik Peters, Grzegorz Pierczynski, Piotr Skowron, Dariusz Stolicki, Stanislaw Szufa, Nimrod Talmon
2023 J jnl
Participatory Budgeting: Data, Tools, and Analysis.
CoRR
Piotr Faliszewski, Jaroslaw Flis, Dominik Peters, Grzegorz Pierczynski, Piotr Skowron, Dariusz Stolicki, Stanislaw Szufa, Nimrod Talmon
2023 A* conf
Properties of Position Matrices and Their Elections.
AAAI
Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski, Austen Z. Fan, Lukasz Janeczko, Andrzej Kaczmarczyk, Tomasz Was
2023 J jnl
Properties of Position Matrices and Their Elections.
CoRR
Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski, Austen Z. Fan, Lukasz Janeczko, Andrzej Kaczmarczyk, Tomasz Was
2023 A* conf
Properties of the Mallows Model Depending on the Number of Alternatives: A Warning for an Experimentalist.
ICML
Niclas Boehmer, Piotr Faliszewski, Sonja Kraiczy
2023 B conf
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments.
SAGT
Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk
2023 J jnl
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments.
CoRR
Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk
2023 J jnl
Selecting Representative Bodies: An Axiomatic View.
CoRR
Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind
2023 A* conf
Ties in Multiwinner Approval Voting.
IJCAI
Lukasz Janeczko, Piotr Faliszewski
2023 J jnl
Ties in Multiwinner Approval Voting.
CoRR
Lukasz Janeczko, Piotr Faliszewski
2022 A ed.
21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, Auckland, New Zealand, May 9-13, 2022
AAMAS
Piotr Faliszewski, Viviana Mascardi, Catherine Pelachaud, Matthew E. Taylor
2022 — conf
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners.
EAAMO
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
2022 J jnl
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners.
CoRR
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
2022 J jnl
Bribery Can Get Harder in Structured Multiwinner Approval Election.
CoRR
Bartosz Kusek, Robert Bredereck, Piotr Faliszewski
2022 A* conf
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning.
NeurIPS
Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa
2022 J jnl
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning.
CoRR
Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa
2022 A* conf
How to Sample Approval Elections?
IJCAI
Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko, Martin Lackner, Arkadii Slinko, Krzysztof Sornat, Nimrod Talmon
2022 J jnl
How to Sample Approval Elections?
CoRR
Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko, Martin Lackner, Arkadii Slinko, Krzysztof Sornat, Nimrod Talmon
2022 B conf
Justifying Groups in Multiwinner Approval Voting.
SAGT
Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong
2022 J jnl
Opinion diffusion and campaigning on society graphs.
J. Log. Comput.
Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon
2022 C conf
Robustness of Greedy Approval Rules.
EUMAS
Piotr Faliszewski, Grzegorz Gawron, Bartosz Kusek
2022 J jnl
Robustness of Greedy Approval Rules.
CoRR
Piotr Faliszewski, Grzegorz Gawron, Bartosz Kusek
2022 A* conf
The Complexity of Proportionality Degree in Committee Elections.
AAAI
Lukasz Janeczko, Piotr Faliszewski
2022 J jnl
The Complexity of Proportionality Degree in Committee Elections.
CoRR
Lukasz Janeczko, Piotr Faliszewski
2022 A* conf
The Complexity of Subelection Isomorphism Problems.
AAAI
Piotr Faliszewski, Krzysztof Sornat, Stanislaw Szufa
2022 A* conf
The Price of Justified Representation.
AAAI
Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong
2022 J jnl
The complexity of election problems with group-separable preferences.
Auton. Agents Multi Agent Syst.
Piotr Faliszewski, Alexander Karpov, Svetlana Obraztsova
2022 A* conf
Understanding Distance Measures Among Elections.
IJCAI
Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was
2022 J jnl
Understanding Distance Measures Among Elections.
CoRR
Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was
2022 C conf
Using Multiwinner Voting to Search for Movies.
EUMAS
Grzegorz Gawron, Piotr Faliszewski
2022 J jnl
Using Multiwinner Voting to Search for Movies.
CoRR
Grzegorz Gawron, Piotr Faliszewski
2021 A* conf
An Analysis of Approval-Based Committee Rules for 2D-Euclidean Elections.
AAAI
Michal Tomasz Godziszewski, Pawel Batko, Piotr Skowron, Piotr Faliszewski
2021 J jnl
Approximation and hardness of Shift-Bribery.
Artif. Intell.
Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat
2021 J jnl
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules.
CoRR
Piotr Faliszewski, Piotr Skowron, Nimrod Talmon
2021 J jnl
Complexity of Shift Bribery in Committee Elections.
ACM Trans. Comput. Theory
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2021 J jnl
Justifying Groups in Multiwinner Approval Voting.
CoRR
Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong
2021 A* conf
Putting a Compass on the Map of Elections.
IJCAI
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa
2021 J jnl
Putting a Compass on the Map of Elections.
CoRR
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa
2021 J jnl
Robustness among multiwinner voting rules.
Artif. Intell.
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2021 J jnl
The Complexity of Subelection Isomorphism Problems.
CoRR
Stanislaw Szufa, Piotr Faliszewski
2021 J jnl
The Price of Justified Representation.
CoRR
Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong
2021 A* conf
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments.
IJCAI
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
2020 J jnl
A characterization of the single-peaked single-crossing domain.
Soc. Choice Welf.
Edith Elkind, Piotr Faliszewski, Piotr Skowron
2020 A conf
Algorithms for Swap and Shift Bribery in Structured Elections.
AAMAS
Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy
2020 A conf
Drawing a Map of Elections in the Space of Statistical Cultures.
AAMAS
Stanislaw Szufa, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2020 Misc conf
Isomorphic Distances Among Elections.
CSR
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon
2020 B conf
Line-Up Elections: Parallel Voting with Shared Candidate Pool.
SAGT
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier
2020 J jnl
Line-Up Elections: Parallel Voting with Shared Candidate Pool.
CoRR
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier
2020 J jnl
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting.
Theor. Comput. Sci.
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2020 A conf
Multiwinner Rules with Variable Number of Winners.
ECAI
Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon
2020 A* conf
On Swap Convexity of Voting Rules.
AAAI
Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski
2020 J jnl
On the Robustness of Winners: Counting Briberies in Elections.
CoRR
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
2020 J jnl
Opinion Diffusion and Campaigning on Society Graphs.
CoRR
Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon
2020 A* conf
Parameterized Algorithms for Finding a Collective Set of Items.
AAAI
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2020 A* conf
Strategic Campaign Management in Apportionment Elections.
IJCAI
Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk, Martin Lackner
2020 A* conf
The Complexity of Election Problems with Group-Separable Preferences.
IJCAI
Piotr Faliszewski, Alexander Karpov, Svetlana Obraztsova
2019 A* conf
A Framework for Approval-Based Budgeting Methods.
AAAI
Nimrod Talmon, Piotr Faliszewski
2019 J jnl
Algorithms for destructive shift bribery.
Auton. Agents Multi Agent Syst.
Andrzej Kaczmarczyk, Piotr Faliszewski
2019 A* conf
An Experimental View on Committees Providing Justified Representation.
IJCAI
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier
2019 A conf
Approximation Algorithms for BalancedCC Multiwinner Rules.
AAMAS
Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon
2019 A* conf
Approximation and Hardness of Shift-Bribery.
AAAI
Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat
2019 J jnl
Approximation and Hardness of Shift-Bribery.
CoRR
Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat
2019 J jnl
Axiomatic characterization of committee scoring rules.
J. Econ. Theory
Piotr Skowron, Piotr Faliszewski, Arkadii Slinko
2019 J jnl
Committee Scoring Rules: Axiomatic Characterization and Hierarchy.
ACM Trans. Economics and Comput.
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2019 A* conf
How Similar Are Two Elections?
AAAI
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon
2019 A* conf
Multigoal Committee Selection.
IJCAI
Maciej Kocot, Anna Kolonko, Edith Elkind, Piotr Faliszewski, Nimrod Talmon
2019 A conf
Proportional Representation in Elections: STV vs PAV.
AAMAS
Piotr Faliszewski, Piotr Skowron, Stanislaw Szufa, Nimrod Talmon
2019 J jnl
Recognizing Top-Monotonic Preference Profiles in Polynomial Time.
J. Artif. Intell. Res.
Krzysztof Magiera, Piotr Faliszewski
2019 — conf
Robustness of Approval-Based Multiwinner Voting Rules.
ADT
Grzegorz Gawron, Piotr Faliszewski
2019 J jnl
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain.
CoRR
Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2018 J jnl
A Framework for Approval-based Budgeting Methods.
CoRR
Piotr Faliszewski, Nimrod Talmon
2018 J jnl
Achieving fully proportional representation by clustering voters.
J. Heuristics
Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon
2018 J jnl
Algorithms for Destructive Shift Bribery.
CoRR
Andrzej Kaczmarczyk, Piotr Faliszewski
2018 A conf
Between Proportionality and Diversity: Balancing District Sizes under the Chamberlin-Courant Rule.
AAMAS
Piotr Faliszewski, Nimrod Talmon
2018 J jnl
Committee Scoring Rules: Axiomatic Characterization and Hierarchy.
CoRR
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2018 A* conf
Effective Heuristics for Committee Scoring Rules.
AAAI
Piotr Faliszewski, Martin Lackner, Dominik Peters, Nimrod Talmon
2018 A* conf
Egalitarian Committee Scoring Rules.
IJCAI
Haris Aziz, Piotr Faliszewski, Bernard Grofman, Arkadii Slinko, Nimrod Talmon
2018 A* conf
Multiwinner Elections With Diversity Constraints.
AAAI
Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron
2018 J jnl
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives.
Soc. Choice Welf.
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2018 A* conf
Opinion Diffusion and Campaigning on Society Graphs.
IJCAI
Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon
2018 A conf
Optimization-Based Voting Rule Design: The Closer to Utopia the Better.
AAMAS
Piotr Faliszewski, Stanislaw Szufa, Nimrod Talmon
2017 A conf
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules.
AAMAS
Piotr Faliszewski, Piotr Skowron, Nimrod Talmon
2017 J jnl
Campaign Management Under Approval-Driven Voting Rules.
Algorithmica
Ildikó Schlotter, Piotr Faliszewski, Edith Elkind
2017 J jnl
Chamberlin-Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time.
J. Artif. Intell. Res.
Piotr Skowron, Piotr Faliszewski
2017 A* conf
Committee Scoring Rules: A Call to Arms.
IJCAI
Piotr Faliszewski
2017 J jnl
Elections with Few Voters: Candidate Control Can Be Easy.
J. Artif. Intell. Res.
Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2017 J jnl
How hard is control in single-crossing elections?
Auton. Agents Multi Agent Syst.
Krzysztof Magiera, Piotr Faliszewski
2017 — conf
How to choose a committee based on agents' preferences?
BESC
Piotr Faliszewski
2017 J jnl
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting.
CoRR
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2017 J jnl
Multiwinner Elections with Diversity Constraints.
CoRR
Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron
2017 A* conf
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant.
IJCAI
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2017 J jnl
Multiwinner Voting in Genetic Algorithms.
IEEE Intell. Syst.
Piotr Faliszewski, Jakub Sawicki, Robert Schaefer, Maciej Smolka
2017 J jnl
Properties of multiwinner voting rules.
Soc. Choice Welf.
Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko
2017 A* conf
Recognizing Top-Monotonic Preference Profiles in Polynomial Time.
IJCAI
Krzysztof Magiera, Piotr Faliszewski
2017 B conf
Robustness Among Multiwinner Voting Rules.
SAGT
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2017 J jnl
Robustness Among Multiwinner Voting Rules.
CoRR
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2017 J jnl
The Complexity of Multiwinner Voting Rules with Variable Number of Winners.
CoRR
Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon
2017 A* conf
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality.
IJCAI
Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, Piotr Skowron
2017 J jnl
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality.
CoRR
Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, Piotr Skowron
2017 — conf
Two-Phase Strategy Managing Insensitivity in Global Optimization.
EvoApplications (1)
Jakub Sawicki, Maciej Smolka, Marcin Los, Robert Schaefer, Piotr Faliszewski
2017 J jnl
Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261).
Dagstuhl Reports
Dorothea Baumeister, Piotr Faliszewski, Annick Laruelle, Toby Walsh
2017 A* conf
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain.
AAAI
Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2016 B ed.
41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Kraków, Poland, August 22-26, 2016
MFCS
Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier
2016 A conf
Achieving Fully Proportional Representation by Clustering Voters.
AAMAS
Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon
2016 A conf
Algorithms for Destructive Shift Bribery.
AAMAS
Andrzej Kaczmarczyk, Piotr Faliszewski
2016 J jnl
Axiomatic Characterization of Committee Scoring Rules.
CoRR
Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko
2016 A* conf
Committee Scoring Rules: Axiomatic Classification and Hierarchy.
IJCAI
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2016 A* conf
Complexity of Shift Bribery in Committee Elections.
AAAI
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2016 J jnl
Complexity of Shift Bribery in Committee Elections.
CoRR
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2016 — ch.
Control and Bribery in Voting.
Handbook of Computational Social Choice
Piotr Faliszewski, Jörg Rothe
2016 J jnl
Finding a collective set of items: From proportional multirepresentation to group recommendation.
Artif. Intell.
Piotr Skowron, Piotr Faliszewski, Jérôme Lang
2016 A* conf
How Hard Is It for a Party to Nominate an Election Winner?.
IJCAI
Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot
2016 J jnl
Large-Scale Election Campaigns: Combinatorial Shift Bribery.
J. Artif. Intell. Res.
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2016 J jnl
Modeling Representation of Minorities Under Multiwinner Voting Rules.
CoRR
Piotr Faliszewski, Jean-François Laslier, Robert Schaefer, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2016 J jnl
Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives.
CoRR
Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon
2016 A* conf
Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives.
AAAI
Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon
2016 — conf
Multiwinner Voting in Genetic Algorithms for Solving Ill-Posed Global Optimization Problems.
EvoApplications (1)
Piotr Faliszewski, Jakub Sawicki, Robert Schaefer, Maciej Smolka
2016 — ch.
Noncooperative Game Theory.
Economics and Computation
Piotr Faliszewski, Irene Rothe, Jörg Rothe
2016 J jnl
On the Computational Cost and Complexity of Stochastic Inverse Solvers.
Comput. Sci.
Piotr Faliszewski, Maciej Smolka, Robert Schaefer, Maciej Paszynski
2016 — ch.
Parameterization in Computational Social Choice.
Encyclopedia of Algorithms
Piotr Faliszewski, Rolf Niedermeier
2016 J jnl
Prices matter for the parameterized complexity of shift bribery.
Inf. Comput.
Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
2016 J jnl
The Complexity of Voter Control and Shift Bribery Under Parliament Choosing Rules.
Trans. Comput. Collect. Intell.
Tomasz Put, Piotr Faliszewski
2016 J jnl
The complexity of priced control in elections.
Ann. Math. Artif. Intell.
Tomasz Miasko, Piotr Faliszewski
2016 A* conf
Voting-Based Group Formation.
IJCAI
Piotr Faliszewski, Arkadii M. Slinko, Nimrod Talmon
2015 J jnl
Achieving fully proportional representation: Approximability results.
Artif. Intell.
Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko
2015 J jnl
Campaign Management under Approval-Driven Voting Rules.
CoRR
Ildikó Schlotter, Piotr Faliszewski, Edith Elkind
2015 J jnl
Combinatorial voter control in elections.
Theor. Comput. Sci.
Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2015 J jnl
Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting.
Auton. Agents Multi Agent Syst.
Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend
2015 J jnl
Distance rationalization of voting rules.
Soc. Choice Welf.
Edith Elkind, Piotr Faliszewski, Arkadii Slinko
2015 — conf
Elections with Few Candidates: Prices, Weights, and Covering Problems.
ADT
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2015 A* conf
Elections with Few Voters: Candidate Control Can Be Easy.
AAAI
Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2015 A* conf
Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation.
AAAI
Piotr Krzysztof Skowron, Piotr Faliszewski, Jérôme Lang
2015 A* conf
Fully Proportional Representation with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time.
AAAI
Piotr Krzysztof Skowron, Piotr Faliszewski
2015 A conf
Large-Scale Election Campaigns: Combinatorial Shift Bribery.
AAMAS
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2015 J jnl
Prices Matter for the Parameterized Complexity of Shift Bribery.
CoRR
Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
2015 J jnl
Properties of Multiwinner Voting Rules.
CoRR
Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko
2015 A* conf
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract).
IJCAI
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2015 A* conf
The Complexity of Recognizing Incomplete Single-Crossing Preferences.
AAAI
Edith Elkind, Piotr Faliszewski, Martin Lackner, Svetlana Obraztsova
2015 J jnl
The complexity of fully proportional representation for single-crossing electorates.
Theor. Comput. Sci.
Piotr Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind
2015 J jnl
Weighted Electoral Control.
J. Artif. Intell. Res.
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2014 A* conf
A Characterization of the Single-Peaked Single-Crossing Domain.
AAAI
Edith Elkind, Piotr Faliszewski, Piotr Skowron
2014 J jnl
Cloning in Elections: Finding the Possible Winners.
CoRR
Edith Elkind, Piotr Faliszewski, Arkadii Slinko
2014 — conf
Combinatorial Voter Control in Elections.
MFCS (2)
Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2014 J jnl
Combinatorial Voter Control in Elections.
CoRR
Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2014 A conf
Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting.
AAMAS
Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend
2014 J jnl
Elections with Few Voters: Candidate Control Can Be Easy.
CoRR
Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2014 J jnl
Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation.
CoRR
Piotr Skowron, Piotr Faliszewski, Jérôme Lang
2014 A conf
How Hard is Control in Single-Crossing Elections?
ECAI
Krzysztof Magiera, Piotr Faliszewski
2014 J jnl
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.
CoRR
Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger
2014 J jnl
Possible Winners in Noisy Elections.
CoRR
Krzysztof Wojtas, Krzysztof Magiera, Tomasz Miasko, Piotr Faliszewski
2014 A* conf
Prices Matter for the Parameterized Complexity of Shift Bribery.
AAAI
Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
2014 A conf
Properties of multiwinner voting rules.
AAMAS
Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko
2014 B conf
Recognizing 1-Euclidean Preferences: An Alternative Approach.
SAGT
Edith Elkind, Piotr Faliszewski
2014 J jnl
The complexity of manipulative attacks in nearly single-peaked electorates.
Artif. Intell.
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2013 — conf
A Richer Understanding of the Complexity of Election Systems.
Fundamental Problems in Computing
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013 J jnl
Achieving Fully Proportional Representation is Easy in Practice
CoRR
Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko
2013 J jnl
Achieving Fully Proportional Representation: Approximability Results.
CoRR
Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko
2013 A conf
Achieving fully proportional representation is easy in practice.
AAMAS
Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko
2013 J jnl
Approximating the MaxCover Problem with Bounded Frequencies in FPT Time.
CoRR
Piotr Skowron, Piotr Faliszewski
2013 J jnl
Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting.
CoRR
Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend
2013 A* conf
Fully Proportional Representation as Resource Allocation: Approximability Results.
IJCAI
Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko
2013 A conf
On swap-distance geometry of voting rules.
AAMAS
Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2013 B conf
The Complexity of Fully Proportional Representation for Single-Crossing Electorates.
SAGT
Piotr Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind
2013 J jnl
The Complexity of Fully Proportional Representation for Single-Crossing Electorates.
CoRR
Piotr Krzysztof Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind
2013 A conf
The complexity of losing voters.
AAMAS
Tomasz Perek, Piotr Faliszewski, Maria Silvia Pini, Francesca Rossi
2013 J jnl
Weighted Electoral Control
CoRR
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2013 A conf
Weighted electoral control.
AAMAS
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2012 A conf
Campaigns for lazy voters: truncated ballots.
AAMAS
Dorothea Baumeister, Piotr Faliszewski, Jérôme Lang, Jörg Rothe
2012 A* conf
Clone structures in voters' preferences.
EC
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2012 J jnl
Manipulating the quota in weighted voting games.
Artif. Intell.
Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind
2012 A* conf
Possible Winners in Noisy Elections.
AAAI
Krzysztof Wojtas, Piotr Faliszewski
2012 J jnl
Proportional Representation as Resource Allocation: Approximability Results
CoRR
Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko
2012 J jnl
Rationalizations of Condorcet-consistent rules via distances of hamming type.
Soc. Choice Welf.
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2012 A conf
Weighted Manipulation for Four-Candidate Llull Is Easy.
ECAI
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
2011 — conf
An NTU Cooperative Game Theoretic View of Manipulating Elections.
WINE
Michael Zuckerman, Piotr Faliszewski, Vincent Conitzer, Jeffrey S. Rosenschein
2011 A* conf
Campaign Management under Approval-Driven Voting Rules.
AAAI
Ildikó Schlotter, Piotr Faliszewski, Edith Elkind
2011 J jnl
Clone Structures in Voters' Preferences
CoRR
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2011 J jnl
Cloning in Elections: Finding the Possible Winners.
J. Artif. Intell. Res.
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2011 A* conf
Coalitional Voting Manipulation: A Game-Theoretic Perspective.
IJCAI
Yoram Bachrach, Edith Elkind, Piotr Faliszewski
2011 A* conf
Constrained Coalition Formation.
AAAI
Talal Rahwan, Tomasz P. Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael J. Wooldridge, Nicholas R. Jennings
2011 A conf
Homogeneity and monotonicity of distance-rationalizable voting rules.
AAMAS
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2011 J jnl
Multimode Control Attacks on Elections.
J. Artif. Intell. Res.
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2011 J jnl
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates
CoRR
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2011 B conf
The complexity of manipulative attacks in nearly single-peaked electorates.
TARK
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2011 J jnl
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control.
Inf. Comput.
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2010 J jnl
AI's War on Manipulation: Are We Winning?
AI Mag.
Piotr Faliszewski, Ariel D. Procaccia
2010 J jnl
Approximation Algorithms for Campaign Management
CoRR
Edith Elkind, Piotr Faliszewski
2010 — conf
Approximation Algorithms for Campaign Management.
WINE
Edith Elkind, Piotr Faliszewski
2010 A* conf
Cloning in Elections.
AAAI
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2010 A* conf
Good Rationalizations of Voting Rules.
AAAI
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2010 A conf
Manipulation of copeland elections.
AAMAS
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
2010 J jnl
Multimode Control Attacks on Elections
CoRR
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2010 J jnl
On the Autoreducibility of Functions.
Theory Comput. Syst.
Piotr Faliszewski, Mitsunori Ogihara
2010 A conf
On the role of distances in defining voting rules.
AAMAS
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2010 A* conf
Probabilistic Possible Winner Determination.
AAAI
Yoram Bachrach, Nadja Betzler, Piotr Faliszewski
2010 J jnl
Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type
CoRR
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2010 J jnl
Using complexity to protect elections.
Commun. ACM
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2009 — conf
Boolean combinations of weighted voting games.
AAMAS (1)
Piotr Faliszewski, Edith Elkind, Michael J. Wooldridge
2009 J jnl
How Hard Is Bribery in Elections?
J. Artif. Intell. Res.
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2009 J jnl
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control.
J. Artif. Intell. Res.
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009 A* conf
Multimode Control Attacks on Elections.
IJCAI
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2009 B conf
On distance rationalizability of some voting rules.
TARK
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2009 J jnl
Swap Bribery
CoRR
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2009 B conf
Swap Bribery.
SAGT
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2009 J jnl
The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control
CoRR
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009 J jnl
The complexity of power-index comparison.
Theor. Comput. Sci.
Piotr Faliszewski, Lane A. Hemaspaandra
2009 B conf
The shield that never was: societies with single-peaked preferences are more open to manipulation and control.
TARK
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008 A* conf
Approximability of Manipulating Elections.
AAAI
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2008 C conf
Copeland Voting Fully Resists Constructive Control.
AAIM
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008 — conf
Copeland voting: ties matter.
AAMAS (2)
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
2008 J jnl
Llull and Copeland Voting Computationally Resist Bribery and Control
CoRR
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008 A* conf
Manipulating the Quota in Weighted Voting Games.
AAAI
Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind
2008 — conf
Nonuniform bribery.
AAMAS (3)
Piotr Faliszewski
2008 J jnl
The Complexity of Power-Index Comparison
CoRR
Piotr Faliszewski, Lane A. Hemaspaandra
2008 C conf
The Complexity of Power-Index Comparison.
AAIM
Piotr Faliszewski, Lane A. Hemaspaandra
2008 J jnl
The consequences of eliminating NP solutions.
Comput. Sci. Rev.
Piotr Faliszewski, Lane A. Hemaspaandra
2007 J jnl
Copeland Voting Fully Resists Constructive Control
CoRR
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007 A* conf
Llull and Copeland Voting Broadly Resist Bribery and Control.
AAAI
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007 J jnl
Nonuniform Bribery
CoRR
Piotr Faliszewski
2007 J jnl
Review of "Complexity Theory and Cryptology: An Introduction to Cryptocomplexity by Jörg Rothe", Springer, 2005, 484 pages.
SIGACT News
Piotr Faliszewski
2006 J jnl
A Richer Understanding of the Complexity of Election Systems
CoRR
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2006 J jnl
How Hard Is Bribery in Elections?
CoRR
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2006 J jnl
Open questions in the theory of semifeasible computation.
SIGACT News
Piotr Faliszewski, Lane A. Hemaspaandra
2006 A* conf
The Complexity of Bribery in Elections.
AAAI
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2006 J jnl
The Consequences of Eliminating NP Solutions
CoRR
Piotr Faliszewski, Lane A. Hemaspaandra
2006 — conf
The Consequences of Eliminating NP Solutions.
DCFS
Piotr Faliszewski, Lane A. Hemaspaandra
2005 J jnl
Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties.
Int. J. Found. Comput. Sci.
Piotr Faliszewski, Lane A. Hemaspaandra
2005 J jnl
Open Questions in the Theory of Semifeasible Computation
CoRR
Piotr Faliszewski, Lane A. Hemaspaandra
2005 J jnl
Properties of uniformly hard languages.
Inf. Process. Lett.
Piotr Faliszewski, Janusz Jarosz
2005 B conf
Separating the Notions of Self- and Autoreducibility.
MFCS
Piotr Faliszewski, Mitsunori Ogihara
2004 J jnl
Exponential time reductions and sparse languages in NEXP
Electron. Colloquium Comput. Complex.
Piotr Faliszewski