On Swap Convexity of Voting Rules
Authors: Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski1910-1917
AAAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we (1) propose several families of voting rules that are convex in the sense of Obraztsova et al.; (2) put forward a weaker notion of convexity that is satisfied by most common voting rules; (3) prove impossibility results for a variant of this definition that considers all, rather than some shortest paths. |
| Researcher Affiliation | Academia | Svetlana Obraztsova Nanyang Technological University Singapore svetlana.obraztsova@gmail.com Edith Elkind University of Oxford Oxford, UK elkind@cs.ox.ac.uk Piotr Faliszewski AGH University of Science and Technology Krakow, Poland faliszew@agh.edu.pl |
| Pseudocode | No | The paper provides mathematical definitions, theorems, and proofs, but does not include any pseudocode or algorithm blocks. |
| Open Source Code | No | The paper is theoretical and does not describe a software-based methodology, thus no open-source code is provided or mentioned. |
| Open Datasets | No | The paper is purely theoretical and does not utilize datasets for empirical evaluation. |
| Dataset Splits | No | The paper is purely theoretical and does not involve empirical validation with data splits. |
| Hardware Specification | No | The paper is theoretical and does not report on computational experiments, hence no hardware specifications are mentioned. |
| Software Dependencies | No | The paper is theoretical and does not mention any specific software dependencies or versions. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setups or hyperparameter configurations. |