Vote trading and subset sums - Université de Rennes Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2015

Vote trading and subset sums

Résumé

We analyze the complexity of vote trading problems with equal-sized voting districts.For two allied vote-swapping parties, the problem is polynomially solvable.For three parties, the problem is NP-complete.

Dates et versions

halshs-01102568 , version 1 (13-01-2015)

Identifiants

Citer

Sebastian Bervoets, Vincent Merlin, Gerhard J. Woeginger. Vote trading and subset sums. Operations Research Letters, 2015, 43 (1), pp.99-102. ⟨10.1016/j.orl.2014.12.007⟩. ⟨halshs-01102568⟩
85 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More