Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDPiotr Faliszewski
Person information
- affiliation: AGH University of Science and Technology, Krakow, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j44]Robert Bredereck
, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness among multiwinner voting rules. Artif. Intell. 290: 103403 (2021)- 2020
- [j43]Edith Elkind, Piotr Faliszewski, Piotr Skowron:
A characterization of the single-peaked single-crossing domain. Soc. Choice Welf. 54(1): 167-181 (2020) - [j42]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theor. Comput. Sci. 814: 86-105 (2020) - [c92]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
Parameterized Algorithms for Finding a Collective Set of Items. AAAI 2020: 1838-1845 - [c91]Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski:
On Swap Convexity of Voting Rules. AAAI 2020: 1910-1917 - [c90]Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy:
Algorithms for Swap and Shift Bribery in Structured Elections. AAMAS 2020: 366-374 - [c89]Stanislaw Szufa, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Drawing a Map of Elections in the Space of Statistical Cultures. AAMAS 2020: 1341-1349 - [c88]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon:
Isomorphic Distances Among Elections. CSR 2020: 64-78 - [c87]Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon:
Multiwinner Rules with Variable Number of Winners. ECAI 2020: 67-74 - [c86]Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk, Martin Lackner:
Strategic Campaign Management in Apportionment Elections. IJCAI 2020: 103-109 - [c85]Piotr Faliszewski, Alexander Karpov, Svetlana Obraztsova:
The Complexity of Election Problems with Group-Separable Preferences. IJCAI 2020: 203-209 - [c84]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. SAGT 2020: 275-290 - [i50]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. CoRR abs/2007.04960 (2020) - [i49]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion Diffusion and Campaigning on Society Graphs. CoRR abs/2010.00651 (2020) - [i48]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
On the Robustness of Winners: Counting Briberies in Elections. CoRR abs/2010.09678 (2020)
2010 – 2019
- 2019
- [j41]Andrzej Kaczmarczyk, Piotr Faliszewski:
Algorithms for destructive shift bribery. Auton. Agents Multi Agent Syst. 33(3): 275-297 (2019) - [j40]Krzysztof Magiera, Piotr Faliszewski:
Recognizing Top-Monotonic Preference Profiles in Polynomial Time. J. Artif. Intell. Res. 66: 57-84 (2019) - [j39]Piotr Skowron, Piotr Faliszewski, Arkadii Slinko:
Axiomatic characterization of committee scoring rules. J. Econ. Theory 180: 244-273 (2019) - [j38]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Characterization and Hierarchy. ACM Trans. Economics and Comput. 7(1): 3:1-3:39 (2019) - [c83]Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat:
Approximation and Hardness of Shift-Bribery. AAAI 2019: 1901-1908 - [c82]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon:
How Similar Are Two Elections? AAAI 2019: 1909-1916 - [c81]Nimrod Talmon, Piotr Faliszewski:
A Framework for Approval-Based Budgeting Methods. AAAI 2019: 2181-2188 - [c80]Grzegorz Gawron, Piotr Faliszewski:
Robustness of Approval-Based Multiwinner Voting Rules. ADT 2019: 17-31 - [c79]Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon:
Approximation Algorithms for BalancedCC Multiwinner Rules. AAMAS 2019: 494-502 - [c78]Piotr Faliszewski, Piotr Skowron, Stanislaw Szufa, Nimrod Talmon:
Proportional Representation in Elections: STV vs PAV. AAMAS 2019: 1946-1948 - [c77]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
An Experimental View on Committees Providing Justified Representation. IJCAI 2019: 109-115 - [c76]Maciej Kocot, Anna Kolonko, Edith Elkind, Piotr Faliszewski, Nimrod Talmon:
Multigoal Committee Selection. IJCAI 2019: 385-391 - [i47]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. CoRR abs/1901.09217 (2019) - [i46]Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat:
Approximation and Hardness of Shift-Bribery. CoRR abs/1908.10562 (2019) - 2018
- [j37]Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon:
Achieving fully proportional representation by clustering voters. J. Heuristics 24(5): 725-756 (2018) - [j36]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives. Soc. Choice Welf. 51(3): 513-550 (2018) - [c75]Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron:
Multiwinner Elections With Diversity Constraints. AAAI 2018: 933-940 - [c74]Piotr Faliszewski, Martin Lackner, Dominik Peters, Nimrod Talmon:
Effective Heuristics for Committee Scoring Rules. AAAI 2018: 1023-1030 - [c73]Piotr Faliszewski, Nimrod Talmon:
Between Proportionality and Diversity: Balancing District Sizes under the Chamberlin-Courant Rule. AAMAS 2018: 14-22 - [c72]Piotr Faliszewski, Stanislaw Szufa, Nimrod Talmon:
Optimization-Based Voting Rule Design: The Closer to Utopia the Better. AAMAS 2018: 32-40 - [c71]Haris Aziz, Piotr Faliszewski, Bernard Grofman, Arkadii Slinko, Nimrod Talmon:
Egalitarian Committee Scoring Rules. IJCAI 2018: 56-62 - [c70]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion Diffusion and Campaigning on Society Graphs. IJCAI 2018: 219-225 - [i45]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Characterization and Hierarchy. CoRR abs/1802.06483 (2018) - [i44]Piotr Faliszewski, Nimrod Talmon:
A Framework for Approval-based Budgeting Methods. CoRR abs/1809.04382 (2018) - [i43]Andrzej Kaczmarczyk, Piotr Faliszewski:
Algorithms for Destructive Shift Bribery. CoRR abs/1810.01763 (2018) - 2017
- [j35]Krzysztof Magiera, Piotr Faliszewski:
How hard is control in single-crossing elections? Auton. Agents Multi Agent Syst. 31(3): 606-627 (2017) - [j34]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management Under Approval-Driven Voting Rules. Algorithmica 77(1): 84-115 (2017) - [j33]Piotr Faliszewski, Jakub Sawicki, Robert Schaefer, Maciej Smolka:
Multiwinner Voting in Genetic Algorithms. IEEE Intell. Syst. 32(1): 40-48 (2017) - [j32]Piotr Skowron, Piotr Faliszewski:
Chamberlin-Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time. J. Artif. Intell. Res. 60: 687-716 (2017) - [j31]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. J. Artif. Intell. Res. 60: 937-1002 (2017) - [j30]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko:
Properties of multiwinner voting rules. Soc. Choice Welf. 48(3): 599-632 (2017) - [c69]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. AAAI 2017: 494-501 - [c68]Piotr Faliszewski, Piotr Skowron, Nimrod Talmon:
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules. AAMAS 2017: 6-14 - [c67]Piotr Faliszewski:
How to choose a committee based on agents' preferences? BESC 2017: 1-6 - [c66]Jakub Sawicki, Maciej Smolka, Marcin Los, Robert Schaefer, Piotr Faliszewski:
Two-Phase Strategy Managing Insensitivity in Global Optimization. EvoApplications (1) 2017: 266-281 - [c65]Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, Piotr Skowron:
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. IJCAI 2017: 84-90 - [c64]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant. IJCAI 2017: 192-198 - [c63]Krzysztof Magiera, Piotr Faliszewski:
Recognizing Top-Monotonic Preference Profiles in Polynomial Time. IJCAI 2017: 324-330 - [c62]Piotr Faliszewski:
Committee Scoring Rules: A Call to Arms. IJCAI 2017: 5121-5125 - [c61]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. SAGT 2017: 80-92 - [i42]Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, Piotr Skowron:
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. CoRR abs/1701.08023 (2017) - [i41]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. CoRR abs/1707.01417 (2017) - [i40]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting. CoRR abs/1709.02850 (2017) - [i39]Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron:
Multiwinner Elections with Diversity Constraints. CoRR abs/1711.06527 (2017) - [i38]Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon:
The Complexity of Multiwinner Voting Rules with Variable Number of Winners. CoRR abs/1711.06641 (2017) - [i37]Dorothea Baumeister, Piotr Faliszewski, Annick Laruelle, Toby Walsh:
Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261). Dagstuhl Reports 7(6): 109-134 (2017) - 2016
- [j29]Piotr Faliszewski, Maciej Smolka, Robert Schaefer, Maciej Paszynski:
On the Computational Cost and Complexity of Stochastic Inverse Solvers. Comput. Sci. 17(2): 225-264 (2016) - [j28]Piotr Skowron, Piotr Faliszewski, Jérôme Lang:
Finding a collective set of items: From proportional multirepresentation to group recommendation. Artif. Intell. 241: 191-216 (2016) - [j27]Tomasz Miasko, Piotr Faliszewski:
The complexity of priced control in elections. Ann. Math. Artif. Intell. 77(3-4): 225-250 (2016) - [j26]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices matter for the parameterized complexity of shift bribery. Inf. Comput. 251: 140-164 (2016) - [j25]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. J. Artif. Intell. Res. 55: 603-652 (2016) - [j24]Tomasz Put, Piotr Faliszewski:
The Complexity of Voter Control and Shift Bribery Under Parliament Choosing Rules. Trans. Comput. Collect. Intell. 23: 29-50 (2016) - [c60]Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon:
Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives. AAAI 2016: 482-488 - [c59]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. AAAI 2016: 2452-2458 - [c58]Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon:
Achieving Fully Proportional Representation by Clustering Voters. AAMAS 2016: 296-304 - [c57]Andrzej Kaczmarczyk, Piotr Faliszewski:
Algorithms for Destructive Shift Bribery. AAMAS 2016: 305-313 - [c56]Piotr Faliszewski, Jakub Sawicki, Robert Schaefer, Maciej Smolka:
Multiwinner Voting in Genetic Algorithms for Solving Ill-Posed Global Optimization Problems. EvoApplications (1) 2016: 409-424 - [c55]Piotr Faliszewski, Arkadii M. Slinko, Nimrod Talmon:
Voting-Based Group Formation. IJCAI 2016: 243-249 - [c54]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Classification and Hierarchy. IJCAI 2016: 250-256 - [c53]Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot:
How Hard Is It for a Party to Nominate an Election Winner?. IJCAI 2016: 257-263 - [p1]Piotr Faliszewski, Irene Rothe, Jörg Rothe:
Noncooperative Game Theory. Economics and Computation 2016: 41-134 - [e1]Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier:
41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. LIPIcs 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-016-3 [contents] - [r2]Piotr Faliszewski, Rolf Niedermeier:
Parameterization in Computational Social Choice. Encyclopedia of Algorithms 2016: 1516-1520 - [r1]Piotr Faliszewski, Jörg Rothe:
Control and Bribery in Voting. Handbook of Computational Social Choice 2016: 146-168 - [i36]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. CoRR abs/1601.01492 (2016) - [i35]Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon:
Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives. CoRR abs/1602.08687 (2016) - [i34]Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Axiomatic Characterization of Committee Scoring Rules. CoRR abs/1604.01529 (2016) - [i33]Piotr Faliszewski, Jean-François Laslier, Robert Schaefer, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Modeling Representation of Minorities Under Multiwinner Voting Rules. CoRR abs/1604.02364 (2016) - 2015
- [j23]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Auton. Agents Multi Agent Syst. 29(6): 1091-1124 (2015) - [j22]Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Achieving fully proportional representation: Approximability results. Artif. Intell. 222: 67-103 (2015) - [j21]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted Electoral Control. J. Artif. Intell. Res. 52: 507-542 (2015) - [j20]Edith Elkind, Piotr Faliszewski, Arkadii Slinko:
Distance rationalization of voting rules. Soc. Choice Welf. 45(2): 345-377 (2015) - [j19]Piotr Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind:
The complexity of fully proportional representation for single-crossing electorates. Theor. Comput. Sci. 569: 43-57 (2015) - [j18]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial voter control in elections. Theor. Comput. Sci. 589: 99-120 (2015) - [c52]Edith Elkind, Piotr Faliszewski, Martin Lackner, Svetlana Obraztsova:
The Complexity of Recognizing Incomplete Single-Crossing Preferences. AAAI 2015: 865-871 - [c51]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. AAAI 2015: 2045-2051 - [c50]Piotr Krzysztof Skowron, Piotr Faliszewski:
Fully Proportional Representation with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time. AAAI 2015: 2124-2130 - [c49]Piotr Krzysztof Skowron, Piotr Faliszewski, Jérôme Lang:
Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation. AAAI 2015: 2131-2137 - [c48]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Elections with Few Candidates: Prices, Weights, and Covering Problems. ADT 2015: 414-431 - [c47]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. AAMAS 2015: 67-75 - [c46]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). IJCAI 2015: 4178-4182 - [i32]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management under Approval-Driven Voting Rules. CoRR abs/1501.00387 (2015) - [i31]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. CoRR abs/1502.01253 (2015) - [i30]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko:
Properties of Multiwinner Voting Rules. CoRR abs/1506.02891 (2015) - 2014
- [j17]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207: 69-99 (2014) - [c45]Edith Elkind, Piotr Faliszewski, Piotr Skowron:
A Characterization of the Single-Peaked Single-Crossing Domain. AAAI 2014: 654-660 - [c44]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. AAAI 2014: 1398-1404 - [c43]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko:
Properties of multiwinner voting rules. AAMAS 2014: 53-60 - [c42]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting. AAMAS 2014: 1357-1358 - [c41]Krzysztof Magiera, Piotr Faliszewski:
How Hard is Control in Single-Crossing Elections? ECAI 2014: 579-584 - [c40]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. MFCS (2) 2014: 153-164 - [c39]Edith Elkind, Piotr Faliszewski:
Recognizing 1-Euclidean Preferences: An Alternative Approach. SAGT 2014: 146-157 - [i29]Edith Elkind, Piotr Faliszewski, Arkadii Slinko:
Cloning in Elections: Finding the Possible Winners. CoRR abs/1401.4602 (2014) - [i28]Piotr Skowron, Piotr Faliszewski, Jérôme Lang:
Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation. CoRR abs/1402.3044 (2014) - [i27]Krzysztof Wojtas, Krzysztof Magiera, Tomasz Miasko, Piotr Faliszewski:
Possible Winners in Noisy Elections. CoRR abs/1405.6630 (2014) - [i26]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. CoRR abs/1406.6859 (2014) - [i25]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger:
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. CoRR abs/1407.2143 (2014) - [i24]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. CoRR abs/1411.7812 (2014) - 2013
- [c38]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted electoral control. AAMAS 2013: 367-374 - [c37]Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On swap-distance geometry of voting rules. AAMAS 2013: 383-390 - [c36]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Achieving fully proportional representation is easy in practice. AAMAS 2013: 399-406 - [c35]Tomasz Perek, Piotr Faliszewski, Maria Silvia Pini, Francesca Rossi:
The complexity of losing voters. AAMAS 2013: 407-414 - [c34]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing 2013: 375-406 - [c33]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Fully Proportional Representation as Resource Allocation: Approximability Results. IJCAI 2013: 353-359 - [c32]Piotr Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind:
The Complexity of Fully Proportional Representation for Single-Crossing Electorates. SAGT 2013: 1-12 - [i23]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Achieving Fully Proportional Representation is Easy in Practice. CoRR abs/1301.6400 (2013) - [i22]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted Electoral Control. CoRR abs/1305.0943 (2013) - [i21]Piotr Krzysztof Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind:
The Complexity of Fully Proportional Representation for Single-Crossing Electorates. CoRR abs/1307.1252 (2013) - [i20]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting. CoRR abs/1307.7322 (2013) - [i19]Piotr Skowron, Piotr Faliszewski:
Approximating the MaxCover Problem with Bounded Frequencies in FPT Time. CoRR abs/1309.4405 (2013) - [i18]Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Achieving Fully Proportional Representation: Approximability Results. CoRR abs/1312.4026 (2013) - 2012
- [j16]Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind:
Manipulating the quota in weighted voting games. Artif. Intell. 180-181: 1-19 (2012) - [j15]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Rationalizations of Condorcet-consistent rules via distances of hamming type. Soc. Choice Welf. 39(4): 891-905 (2012) - [c31]