Strategic Voting and Strategic Candidacy
Authors: Markus Brill, Vincent Conitzer
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We study the computational complexity of the latter case and show that computing the set of sophisticated outcomes is NP-complete. Due to space constraints, some proofs are omitted. |
| Researcher Affiliation | Academia | Markus Brill and Vincent Conitzer Department of Computer Science Duke University Durham, NC 27708, USA {brill,conitzer}@cs.duke.edu |
| Pseudocode | No | The paper does not contain any pseudocode or clearly labeled algorithm blocks. |
| Open Source Code | No | The paper does not provide any statements or links regarding the availability of open-source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not involve training models on datasets. It discusses theoretical concepts and examples. |
| Dataset Splits | No | The paper is theoretical and does not involve experimental validation with dataset splits. It provides proofs and theoretical analyses. |
| Hardware Specification | No | The paper is theoretical and does not involve computational experiments that would require specific hardware specifications. |
| Software Dependencies | No | The paper is theoretical and does not mention any specific software dependencies with version numbers for reproducibility of computational work. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details such as hyperparameters or training configurations. |