The following pages link to Piotr Faliszewski (Q314423):
Displaying 50 items.
- The complexity of priced control in elections (Q314424) (← links)
- Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Manipulating the quota in weighted voting games (Q420828) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- Campaign management under approval-driven voting rules (Q513294) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- Distance rationalization of voting rules (Q892848) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- The complexity of power-index comparison (Q1001906) (← links)
- Properties of uniformly hard languages (Q1041777) (← links)
- Axiomatic characterization of committee scoring rules (Q1729676) (← links)
- Line-up elections: parallel voting with shared candidate pool (Q2109967) (← links)
- A characterization of the single-peaked single-crossing domain (Q2179455) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- Robustness of approval-based multiwinner voting rules (Q2290364) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Combinatorial voter control in elections (Q2346381) (← links)
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives (Q2417370) (← links)
- Rationalizations of Condorcet-consistent rules via distances of Hamming type (Q2450151) (← links)
- The complexity of fully proportional representation for single-crossing electorates (Q2513672) (← links)
- Properties of multiwinner voting rules (Q2628711) (← links)
- Large-Scale Election Campaigns: Combinatorial Shift Bribery (Q2800947) (← links)
- The Complexity of Fully Proportional Representation for Single-Crossing Electorates (Q2856127) (← links)
- Combinatorial Voter Control in Elections (Q2922604) (← links)
- Recognizing 1-Euclidean Preferences: An Alternative Approach (Q2938654) (← links)
- Multimode Control Attacks on Elections (Q3081454) (← links)
- (Q3112639) (← links)
- Elections with Few Candidates: Prices, Weights, and Covering Problems (Q3449547) (← links)
- (Q3457231) (← links)
- Copeland Voting Fully Resists Constructive Control (Q3511426) (← links)
- The Complexity of Power-Index Comparison (Q3511427) (← links)
- Swap Bribery (Q3648865) (← links)
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control (Q3651465) (← links)
- How Hard Is Bribery in Elections? (Q3651470) (← links)
- Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time (Q4596723) (← links)
- Elections with Few Voters: Candidate Control Can Be Easy (Q4600728) (← links)
- Multiwinner Rules with Variable Number of Winners (Q4999205) (← links)
- Isomorphic Distances Among Elections (Q5042228) (← links)
- Opinion diffusion and campaigning on society graphs (Q5103726) (← links)
- Control and Bribery in Voting (Q5133010) (← links)
- A Richer Understanding of the Complexity of Election Systems (Q5192366) (← links)
- Recognizing Top-Monotonic Preference Profiles in Polynomial Time (Q5232783) (← links)
- Weighted Electoral Control (Q5246710) (← links)
- (Q5283025) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492867) (← links)
- ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES (Q5704373) (← links)
- Complexity of Shift Bribery in Committee Elections (Q5868881) (← links)
- Robustness among multiwinner voting rules (Q5894693) (← links)
