A note on the complexity of manipulating weighted Schulze voting

DOI10.1016/j.ipl.2020.105989zbMath1466.91110arXiv1808.09226MaRDI QIDQ2203580

Sven Kosub, Julian Müller

Publication date: 7 October 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.09226

zbMATH Keywords

computational complexity; computational social choice; Schulze voting

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

91B14: Social choice

91B86: Mathematical economics and fuzziness