Frugal Bribery in Voting
Authors: Palash Dey, Neeldhara Misra, Y. Narahari
AAAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We show that both the FRUGAL-BRIBERY and the FRUGAL$BRIBERY problems are intractable for many commonly used voting rules for weighted as well as unweighted elections. These intractability results demonstrate that bribery is a hard computational problem, in the sense that several special cases of this problem continue to be computationally intractable. |
| Researcher Affiliation | Academia | Palash Dey Indian Institute of Science Bangalore, India palash@csa.iisc.ernet.in Neeldhara Misra Indian Institute of Technology Gandhinagar, India mail@neeldhara.com Y. Narahari Indian Institute of Science Bangalore, India hari@csa.iisc.ernet.in |
| Pseudocode | No | The paper does not contain any pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not mention providing open-source code for the described methodology. |
| Open Datasets | No | This is a theoretical paper and does not mention using or providing access to datasets for training. |
| Dataset Splits | No | This is a theoretical paper and does not mention training/validation/test dataset splits. |
| Hardware Specification | No | The paper does not mention any specific hardware used for its research or computations. |
| Software Dependencies | No | The paper does not mention specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe an experimental setup with hyperparameters or system-level training settings. |