Toward Computing the Margin of Victory in Single Transferable Vote Elections

DOI10.1287/ijoc.2018.0853OpenAlexW2947692969MaRDI QIDQ5139621

Peter J. Stuckey, Michelle Blom, Vanessa Teague

Publication date: 9 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2018.0853

zbMATH Keywords

electionshybrid optimisationnonlinear mixed integer programmingmargin of victory

Mathematics Subject Classification ID

Mathematical economics (91Bxx)

Related Items (1)

Robustness among multiwinner voting rules

Uses Software

• SCIP

Cites Work

• Unnamed Item
• SCIP: solving constraint integer programs
• Single transferable vote resists strategic voting
• Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
• When are elections with few candidates hard to manipulate?
• How Hard Is Bribery in Elections?
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Handbook of Computational Social Choice

This page was built for publication: Toward Computing the Margin of Victory in Single Transferable Vote Elections