16 citations · 64 across the 18 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Comparing Election Methods Where Each Voter Ranks Only Few Candidates
Matthias Bentert, Piotr Skowron
Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literatu…
cs.DS2017★ 3 cited
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier +2
A classic result of Lenstra [Math.~Oper.~Res.~1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameter being the number of…