This is not the latest version of this item. The latest version can be found here.
A Note on the Complexity of Manipulating Weighted Schulze Voting
A Note on the Complexity of Manipulating Weighted Schulze Voting
No Thumbnail Available
Files
There are no files associated with this item.
Date
2018
Authors
Müller, Julian
Kosub, Sven
Editors
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
ArXiv-ID
International patent number
Link to the license
oops
EU project number
Project
Open Access publication
Collections
Title in another language
Publication type
Working Paper/Technical Report
Publication status
Published
Published in
Abstract
We prove that the constructive weighted coalitional manipulation problem for the Schulze voting rule can be solved in polynomial time for an unbounded number of candidates and an unbounded number of manipulators.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690
BibTex
RDF
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes