How Similar Are Two Elections?
Authors: Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanisław Szufa, Nimrod Talmon1909-1916
AAAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We establish the complexity of our problems (including their inapproximability) and provide initial experiments regarding the ability to solve them in practice. ... We describe an ILP formulation of the d Spear ISOMORPHISM DISTANCE problem. We evaluate experimentally on what sizes of elections the state-of-the-art ILP solvers are capable of solving our ILP. We also propose a heuristic algorithm and evaluate its performance. ... We report on experiments regarding the ILPs and the heuristic described above. ... We give the results of our experiments in Figure 1. |
| Researcher Affiliation | Academia | 1AGH University, Krak ow, Poland, 2University of Warsaw, Poland, 3University of Auckland, New Zealand 4Jagiellonian University, Krak ow, Poland, 5Ben-Gurion University, Be er Sheva, Israel |
| Pseudocode | No | The paper describes algorithms in textual, numbered steps, but does not present them in a formalized pseudocode block or algorithm environment. |
| Open Source Code | No | The paper does not include any statement or link indicating that the source code for the described methodology is publicly available. |
| Open Datasets | Yes | often using the Pref Lib database (Mattei and Walsh 2013). ... We consider the following distributions over elections. In the Impartial Culture model (IC)... In the Euclidean models... 1D Interval model... 2D Disc model... |
| Dataset Splits | No | The paper describes data generation and evaluation metrics but does not specify explicit train/validation/test splits, percentages, or methodology for partitioning datasets. |
| Hardware Specification | No | The paper mentions running experiments "on our machine" but does not provide specific details about the hardware components (e.g., CPU, GPU model, memory). |
| Software Dependencies | No | The paper mentions using "state-of-the-art ILP solvers" and specifically the "CPLEX solver," but it does not provide version numbers for these software dependencies. |
| Experiment Setup | Yes | We also propose a heuristic algorithm... The heuristic is a local search on the candidate matching ˆσ, which we try to improve in each step: 1. ... 2. We perform S iterations as follows (S is a parameter of the algorithm). ... we use S = 50 iterations) and compare them... We consider elections with 6 candidates and between 6 and 16 voters... |