A note on the complexity of manipulating weighted Schulze voting
Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können kommenden Montag und Dienstag keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted next Monday and Tuesday.)
| Type of Publication: | Journal article |
| Publication status: | Published |
| Author: | Müller, Julian; Kosub, Sven |
| Year of publication: | 2020 |
| Published in: | Information Processing Letters ; 162 (2020). - 105989. - Elsevier. - ISSN 0020-0190. - eISSN 1872-6119 |
| ArXiv-ID: | arXiv:1808.09226 |
| DOI (citable link): | https://dx.doi.org/10.1016/j.ipl.2020.105989 |
| Summary: |
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.
|
| Subject (DDC): | 004 Computer Science |
| Keywords: | Computational social choice; Schulze voting; Computational complexity |
| Bibliography of Konstanz: | Yes |
| Refereed: | Unknown |
Cite This
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
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.105989
@article{Muller2020compl-44939.2, title={A note on the complexity of manipulating weighted Schulze voting}, year={2020}, doi={10.1016/j.ipl.2020.105989}, volume={162}, issn={0020-0190}, journal={Information Processing Letters}, author={Müller, Julian and Kosub, Sven}, note={Article Number: 105989} }
<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/rdf/resource/123456789/44939.2"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Kosub, Sven</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-09-11T09:08:25Z</dc:date> <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> <dc:rights>terms-of-use</dc:rights> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-09-11T09:08:25Z</dcterms:available> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>A note on the complexity of manipulating weighted Schulze voting</dcterms:title> <dc:creator>Müller, Julian</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:language>eng</dc:language> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:creator>Kosub, Sven</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44939.2"/> <dcterms:issued>2020</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Müller, Julian</dc:contributor> </rdf:Description> </rdf:RDF>
This item appears in the following Collection(s)
Version History
Search KOPS
Browse
My Account
