Hardness of candidate nomination

• DOI: 10.1007/s10458-023-09622-9
• Publication Date: 2023-08-16T04:02:00Z
• Authors: Katarína Cechlárová; Julien Lesca; Diana Trellová; Martina Hančová; Jozef Hanč
• Keywords: NOMINATE; Nomination

Abstract We consider elections where the set of candidates is split into parties and each party can nominate just one candidate. study computational complexity two problems. The Possible President problem asks whether a given candidate become unique winner election for some nominations from other parties. Necessary to decide will be any possible several different voting rules show that all them NP-complete, even if size at most two; we prove coNP-complete. Further, formulate integer programs solve problems test on real artificial data.