Winning a Tournament by Any Means Necessary
Authors: Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | For this problem, our contribution is fourfold. First, we present two operations that obfuscate deceit : given one solution, they produce another solution. Second, we present a combinatorial result, stating that there is always a solution with all reversals incident to w and elite players . Third, we give a closed formula for the case where D is a DAG. Finally, we present exact exponential-time and parameterized algorithms for the general case. |
| Researcher Affiliation | Academia | University of Bergen, Bergen, Norway The Institute of Mathematical Sciences, HBNI, Chennai, India Ben-Gurion University, Beersheba, Israel |
| Pseudocode | No | The paper describes algorithms in prose but does not include any structured pseudocode or algorithm blocks. |
| Open Source Code | No | No statement or link regarding the release of source code for the described methodology was found in the paper. |
| Open Datasets | No | The paper is theoretical and does not use datasets for training or other experimental purposes. |
| Dataset Splits | No | The paper focuses on theoretical results and does not describe any experimental setup that would involve dataset splits. |
| Hardware Specification | No | The paper is purely theoretical and does not mention any hardware used for experiments. |
| Software Dependencies | No | The paper is theoretical and does not describe any software dependencies or versions used for experimental setup. |
| Experiment Setup | No | The paper is purely theoretical and does not describe any experimental setup details such as hyperparameters or training settings. |