Maximin Share Allocations on Cycles
Authors: Zbigniew Lonc, Miroslaw Truszczynski
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We present cases when maximin share allocations of goods on cycles exist and provide results on allocations guaranteeing each agent a certain portion of her maximin share. We also study algorithms for computing maximin share allocations of goods on cycles. |
| Researcher Affiliation | Academia | 1 Warsaw University of Technology, Poland 2 University of Kentucky, USA |
| Pseudocode | No | The paper describes algorithms in prose but does not include any structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not mention providing open-source code for its methodology. |
| Open Datasets | No | The paper is theoretical and does not use or reference any datasets for training purposes. The figures provide illustrative examples, not empirical data. |
| Dataset Splits | No | The paper is theoretical and does not describe any dataset splits for validation. |
| Hardware Specification | No | The paper does not specify any hardware used for experiments as it is a theoretical work. |
| Software Dependencies | No | The paper does not specify any 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. |