Recognizing Top-Monotonic Preference Profiles in Polynomial Time
Authors: Krzysztof Magiera, Piotr Faliszewski
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We provide the first polynomial-time algorithm for recognizing if a profile of (possibly weak) preference orders is top-monotonic. Our algorithm proceeds by reducing the recognition problem to the SAT-2CNF problem. |
| Researcher Affiliation | Academia | Krzysztof Magiera and Piotr Faliszewski AGH University, Krakow, Poland krzys.magiera@gmail.com, faliszew@agh.edu.pl |
| Pseudocode | No | The paper does not contain any structured pseudocode or clearly labeled algorithm blocks. |
| Open Source Code | No | The paper does not include any statement or link indicating that the source code for the described methodology is openly available. |
| Open Datasets | No | This paper is theoretical and does not involve the use of a dataset for training or evaluation. |
| Dataset Splits | No | This paper is theoretical and does not involve the use of dataset splits for validation or training. |
| Hardware Specification | No | The paper does not provide any specific details about the hardware used for computations or experiments. |
| Software Dependencies | No | The paper does not provide specific software dependencies (e.g., library or solver names with version numbers). |
| Experiment Setup | No | This is a theoretical paper and does not include details on an experimental setup, hyperparameters, or training configurations. |