Distortion in Voting with Top-t Preferences
Authors: Allan Borodin, Daniel Halpern, Mohamad Latifian, Nisarg Shah
IJCAI 2022 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Our main goal is to study distortion with top-t preferences under the original utilitarian framework. ... We identify a tight bound of Θ(max( m, m/t)). ... For the case of full rankings (t = m), this matches the lower bound of Caragiannis et al. [2017], closing a m1/6 gap they left open. This resolves the optimal distortion for committee selection as Θ(min(m/k, m)). |
| Researcher Affiliation | Academia | Allan Borodin1 , Daniel Halpern2 , Mohamad Latifian1 , and Nisarg Shah1 1University of Toronto 2Harvard University |
| Pseudocode | No | The paper describes algorithms and rules in natural language but does not present them in structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper is theoretical and does not mention releasing any source code for its methodology. |
| Open Datasets | No | The paper is theoretical and does not conduct experiments involving datasets. |
| Dataset Splits | No | The paper is theoretical and does not report on empirical experiments that would involve dataset splits. |
| Hardware Specification | No | The paper is theoretical and does not report on empirical experiments, therefore no hardware specifications are mentioned. |
| Software Dependencies | No | The paper is theoretical and does not report on empirical experiments, therefore no software dependencies are mentioned. |
| Experiment Setup | No | The paper is theoretical and does not report on empirical experiments, therefore no experimental setup details are provided. |