Fair Allocation of Indivisible Goods and Chores
Authors: Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, Toby Walsh
IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We show that whereas some of the positive axiomatic and computational results extend to this more general setting, others do not. We present several new and efficient algorithms for finding fair allocations in this general setting. We also point out several gaps in the literature regarding the existence of allocations satisfying certain fairness and efficiency properties and further study the complexity of computing such allocations. |
| Researcher Affiliation | Academia | 1UNSW Sydney and Data61 CSIRO, Australia 2University of Patras, Greece 3University of Tokyo, Japan 4TU Berlin, Germany |
| Pseudocode | Yes | Algorithm 1 Double Round Robin Algorithm |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. It only states that the full version of the paper is available on arXiv. |
| Open Datasets | No | This is a theoretical paper focusing on algorithm design and proofs, and as such, it does not use a public dataset for empirical training or evaluation. |
| Dataset Splits | No | As a theoretical paper, it does not involve empirical validation and therefore does not specify dataset splits for training, validation, or testing. |
| Hardware Specification | No | As a theoretical paper, it does not describe experimental setups that would require specific hardware, and thus no hardware specifications are provided. |
| Software Dependencies | No | As a theoretical paper, it does not provide details on software dependencies with specific version numbers for replication of any empirical work. |
| Experiment Setup | No | As a theoretical paper, it does not describe empirical experiments or provide details on hyperparameters, training configurations, or system-level settings. |