TY  - JOUR
AU  - Godoy, Aitor
AU  - Rubio Díez, Fernando
AU  - Rodríguez Laguna, Ismael
PY  - 2024
DO  - 10.1016/j.jocs.2024.102328
SN  - 1877-7503
UR  - https://hdl.handle.net/20.500.14352/104712
T2  - Journal of Computational Science
AB  - This paper studies the computational complexity of two voting problems where the goal is deciding how a given voter should vote to favour their personal stances. In the first problem, given (a) the voter stance towards each law that will be voted by...
LA  - eng
PB  - Elsevier
KW  - Computational complexity
KW  - Approximability
KW  - Polynomial reductions
KW  - NP-complete problems Political problems Electoral systems
KW  - Political problems
KW  - Electoral systems
TI  - Voting according to one’s political stances is difficult : Problems definition, computational hardness, and approximate solutions
TY  - journal article
VL  - 80C
ER  -