Almost Group Envy-free Allocation of Indivisible Goods and Chores
Authors: Haris Aziz, Simon Rey
IJCAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We then present a clear taxonomy of the fairness concepts. We study which fairness concepts guarantee the existence of a fair allocation under which preference domain. For two natural classes of additive utilities, we design polynomial-time algorithms to compute a GEF1 allocation. We also prove that checking whether a given allocation satisfies GEF1 is co NP-complete when there are either only goods, only chores or both. We prove that checking whether a given allocation satisfies GEF1 is co NP-complete for the cases of only goods, only chores and both (Section 6). |
| Researcher Affiliation | Collaboration | Haris Aziz1,2 and Simon Rey3 1UNSW Sydney 2Data61 CSIRO 3Institute for Logic, Language and Computation (ILLC), University of Amsterdam |
| Pseudocode | Yes | Algorithm 1 The Egal-Sequential Algorithm and Algorithm 2 The Ternary Flow Algorithm |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. |
| Open Datasets | No | This paper is theoretical and does not conduct empirical studies involving datasets, training, or evaluation. |
| Dataset Splits | No | This paper is theoretical and does not describe empirical experiments that would involve dataset splits for validation. |
| Hardware Specification | No | The paper is theoretical and does not describe any experimental setup or mention specific hardware used. |
| Software Dependencies | No | The paper is theoretical and does not mention specific software dependencies with version numbers required for replication. |
| Experiment Setup | No | The paper is theoretical and does not provide details about experimental setup, hyperparameters, or system-level training settings. |