Achieving Envy-freeness and Equitability with Monetary Transfers
Authors: Haris Aziz5102-5109
AAAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We present a sufficient condition and an algorithm to achieve envyfreeness and equitability when monetary transfers are allowed. ... For the case of additive valuations, we present a characterization of allocations that can simultaneously be made equitable and envy-free via payments. We then present a distributed algorithm to compute an approximately envy-free outcome for any class of valuations. ... The running time of the algorithm is O(n3f(I) C ϵ ). |
| Researcher Affiliation | Academia | Haris Aziz UNSW Sydney and Data61 CSIRO haris.aziz@unsw.edu.au |
| Pseudocode | Yes | Algorithm 1 Envy-freeness and equitability with payments; Algorithm 2 Generalized Bertsekas Envy Swap (GBES) Algorithm |
| Open Source Code | No | The paper does not provide an explicit statement or link to open-source code for the described methodology. |
| Open Datasets | No | The paper presents theoretical contributions and algorithms, and does not mention the use of datasets for training, validation, or testing. |
| Dataset Splits | No | The paper presents theoretical contributions and algorithms, and does not mention the use of datasets for training, validation, or testing, or any dataset splits. |
| Hardware Specification | No | The paper describes theoretical algorithms and proofs, and does not report on empirical experiments that would require specific hardware specifications. |
| Software Dependencies | No | The paper focuses on theoretical algorithms and proofs and does not list any specific software dependencies with version numbers for experimental reproducibility. |
| Experiment Setup | No | The paper describes theoretical algorithms and their properties; it does not detail an experimental setup with hyperparameters or training settings. |