Elections with Few Candidates: Prices, Weights, and Covering Problems

DOI10.1007/978-3-319-23114-3_25zbMath1403.68075OpenAlexW2124164512WikidataQ62039073 ScholiaQ62039073MaRDI QIDQ3449547

Piotr Faliszewski, Robert Bredereck, Piotr Skowron, Rolf Niedermeier, Nimrod Talmon

Publication date: 4 November 2015

Published in: Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23114-3_25

Mathematics Subject Classification ID

Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (12)

Parameterized Resiliency Problems via Integer Linear Programming ⋮ Prices matter for the parameterized complexity of shift bribery ⋮ Integer programming in parameterized complexity: five miniatures ⋮ Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives ⋮ Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity ⋮ Combinatorial \(n\)-fold integer programming and applications ⋮ Integer Programming in Parameterized Complexity: Three Miniatures. ⋮ Parameterized shifted combinatorial optimization ⋮ Unnamed Item ⋮ Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting ⋮ Backdoors to planning ⋮ Parameterized resiliency problems

This page was built for publication: Elections with Few Candidates: Prices, Weights, and Covering Problems