On the Complexity of Chore Division
Authors: Alireza Farhadi, MohammadTaghi Hajiaghayi
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we show that chore division and cake cutting problems are closely related to each other and provide a tight lower bound for proportional chore division. |
| Researcher Affiliation | Academia | Alireza Farhadi1 , Mohammad Taghi Hajiaghayi1 , 1 University of Maryland, College Park farhadi@cs.umd.edu, hajiagha@cs.umd.edu |
| Pseudocode | No | The paper does not contain any pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any statements or links regarding the availability of open-source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not involve empirical training on datasets. No information about publicly available datasets is provided. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical experiments with data splits for training, validation, or testing. |
| Hardware Specification | No | The paper is theoretical and does not discuss hardware used for experiments. |
| Software Dependencies | No | The paper is theoretical and does not mention any 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. |