Vote trading and subset sums

Sebastian Bervoets, Vincent Merlin () and Gerhard J. Woeginger ()
Additional contact information
Gerhard J. Woeginger: Department of mathematics and computing science [Eindhoven] - TU/e - Eindhoven University of Technology [Eindhoven]

Post-Print from HAL

Abstract: 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.

Keywords: Vote swapping; vote trading; manipulation; subset sum problem (search for similar items in EconPapers)
Date: 2015-01
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Published in Operations Research Letters, 2015, 43 (1), pp.99-102. ⟨10.1016/j.orl.2014.12.007⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:halshs-01102568

DOI: 10.1016/j.orl.2014.12.007

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().