2 citations · 6 across the 14 of their papers we have counts for
18 papers
Algorithms for Structured Elections under Thiele Voting Rules
Alexandra Lassota, Krzysztof Sornat
We study the computational complexity of winner determination problems in approval-based committee elections under Thiele voting rules. These form a class of rules parameterized by…
Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides
Alexandra Lassota, Koen Ligthart
We present a new and faster algorithm for the 4-block integer linear programming problem, overcoming the long-standing runtime barrier faced by previous algorithms that rely on Gra…
On Integer Programs That Look Like Paths
Marcin Briański, Alexandra Lassota, Kristýna Pekárková +2
Solving integer programs of the form is, in general, $…
Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns
Alexandra Lassota, Koen Ligthart
We study integer linear programs (ILP) of the form and analyze their parameterized complexity with respect to their dist…
Six Candidates Suffice to Win a Voter Majority
Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan +2
A cornerstone of social choice theory is Condorcet's paradox which says that in an election where voters rank candidates it is possible that, no matter which candidate is d…
The Condorcet Dimension of Metric Spaces
Alexandra Lassota, Adrian Vetta, Bernhard von Stengel
A Condorcet winning set is a set of candidates such that no other candidate is preferred by at least half the voters over all members of the set. The Condorcet dimension, which is…