Piotr Faliszewski

Available identifiers

zbMath Open faliszewski.piotrWikidataQ65163370 ScholiaQ65163370MaRDI QIDQ314423

List of research outcomes

Publication	Date of Publication	Type
Justifying groups in multiwinner approval voting	2023-08-01	Paper
Justifying groups in multiwinner approval voting	2023-07-28	Paper
Correction to: Opinion diffusion and campaigning on society graphs	2023-05-16	Paper
Line-up elections: parallel voting with shared candidate pool	2022-12-21	Paper
Isomorphic Distances Among Elections	2022-10-19	Paper
Complexity of Shift Bribery in Committee Elections	2022-09-24	Paper
Opinion diffusion and campaigning on society graphs	2022-09-08	Paper
Approximation and hardness of shift-Bribery	2021-11-02	Paper
Robustness among multiwinner voting rules	2021-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q4999205	2021-07-06	Paper
https://portal.mardi4nfdi.de/entity/Q5133010	2020-11-12	Paper
A characterization of the single-peaked single-crossing domain	2020-05-12	Paper
Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting	2020-03-12	Paper
Robustness of approval-based multiwinner voting rules	2020-01-27	Paper
Recognizing Top-Monotonic Preference Profiles in Polynomial Time	2019-09-13	Paper
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives	2019-06-12	Paper
Axiomatic characterization of committee scoring rules	2019-02-28	Paper
Robustness among multiwinner voting rules	2018-02-13	Paper
Elections with Few Voters: Candidate Control Can Be Easy	2018-01-12	Paper
Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time	2017-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5283025	2017-07-18	Paper
Properties of multiwinner voting rules	2017-06-02	Paper
Campaign management under approval-driven voting rules	2017-03-06	Paper
Prices matter for the parameterized complexity of shift bribery	2016-11-18	Paper
Finding a collective set of items: from proportional multirepresentation to group recommendation	2016-11-01	Paper
The complexity of priced control in elections	2016-09-16	Paper
Large-Scale Election Campaigns: Combinatorial Shift Bribery	2016-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q3457231	2015-12-11	Paper
Distance rationalization of voting rules	2015-11-12	Paper
Elections with Few Candidates: Prices, Weights, and Covering Problems	2015-11-04	Paper
The complexity of manipulative attacks in nearly single-peaked electorates	2015-08-27	Paper
Combinatorial voter control in elections	2015-06-01	Paper
Weighted Electoral Control	2015-04-22	Paper
The complexity of fully proportional representation for single-crossing electorates	2015-01-28	Paper
Recognizing 1-Euclidean Preferences: An Alternative Approach	2015-01-14	Paper
Combinatorial Voter Control in Elections	2014-10-14	Paper
The consequences of eliminating NP solutions	2014-10-07	Paper
Rationalizations of Condorcet-consistent rules via distances of Hamming type	2014-05-16	Paper
The Complexity of Fully Proportional Representation for Single-Crossing Electorates	2013-10-23	Paper
Manipulating the quota in weighted voting games	2012-05-23	Paper
https://portal.mardi4nfdi.de/entity/Q3112639	2012-01-12	Paper
Multimode Control Attacks on Elections	2011-03-08	Paper
The shield that never was: societies with single-peaked preferences are more open to manipulation and control	2011-02-21	Paper
On the autoreducibility of functions	2010-05-10	Paper
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control	2009-12-10	Paper
How Hard Is Bribery in Elections?	2009-12-10	Paper
Properties of uniformly hard languages	2009-12-04	Paper
Swap Bribery	2009-12-01	Paper
A Richer Understanding of the Complexity of Election Systems	2009-08-05	Paper
The complexity of power-index comparison	2009-02-19	Paper
Copeland Voting Fully Resists Constructive Control	2008-07-10	Paper
The Complexity of Power-Index Comparison	2008-07-10	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES	2005-11-14	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Piotr Faliszewski