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
2020
Authors
Editors
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
DOI (citable link)
ArXiv-ID
International patent number
Link to the license
EU project number
Project
Open Access publication
Collections
Title in another language
Publication type
Journal article
Publication status
Published
Published in
Information Processing Letters ; 162 (2020). - 105989. - Elsevier. - ISSN 0020-0190. - eISSN 1872-6119
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
Computational social choice; Schulze voting; Computational complexity
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690
MÜLLER, Julian, Sven KOSUB, 2020. A note on the complexity of manipulating weighted Schulze voting. In: Information Processing Letters. Elsevier. 162, 105989. ISSN 0020-0190. eISSN 1872-6119. Available under: doi: 10.1016/j.ipl.2020.105989BibTex
@article{Muller2020compl-44939.2, year={2020}, doi={10.1016/j.ipl.2020.105989}, title={A note on the complexity of manipulating weighted Schulze voting}, volume={162}, issn={0020-0190}, journal={Information Processing Letters}, author={Müller, Julian and Kosub, Sven}, note={Article Number: 105989} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/44939.2"> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44939.2"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:title>A note on the complexity of manipulating weighted Schulze voting</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-09-11T09:08:25Z</dcterms:available> <dc:creator>Müller, Julian</dc:creator> <dc:creator>Kosub, Sven</dc:creator> <dc:contributor>Müller, Julian</dc:contributor> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> <dcterms:issued>2020</dcterms:issued> <dc:language>eng</dc:language> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-09-11T09:08:25Z</dc:date> <dc:rights>terms-of-use</dc:rights> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:contributor>Kosub, Sven</dc:contributor> </rdf:Description> </rdf: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
Refereed
Unknown