Envy-Free Mechanisms with Minimum Number of Cuts
Authors: Reza Alijani, Majid Farhadi, Mohammad Ghodsi, Masoud Seddighin, Ahmad Tajik
AAAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We provide methods, namely expansion process and expansion process with unlocking, for dividing the cake under different assumptions on the valuation functions of the players. |
| Researcher Affiliation | Academia | Sharif University of Technology , Duke University , University of Michigan Ann Arbor , Institute for Research in Fundamental Sciences (IPM) School of Computer Science alijani@cs.duke.edu, {m farhadi, mseddighin}@ce.sharif.edu, ghodsi@sharif.edu, tajik@umich.edu |
| Pseudocode | Yes | Algorithm 1 EFISM algorithm |
| Open Source Code | No | The paper does not provide any concrete access information or links to open-source code for the methodology described. |
| Open Datasets | No | This is a theoretical paper that does not describe empirical experiments involving datasets or training. Therefore, it does not provide information about publicly available datasets used for training. |
| Dataset Splits | No | This is a theoretical paper that does not describe empirical experiments involving datasets. Therefore, it does not provide information about training/validation/test dataset splits. |
| Hardware Specification | No | The paper describes theoretical algorithms and does not report on empirical experiments, thus no hardware specifications are mentioned. |
| Software Dependencies | No | The paper describes theoretical algorithms and does not report on empirical experiments, thus no specific software dependencies with version numbers are mentioned. |
| Experiment Setup | No | The paper describes theoretical algorithms and does not report on empirical experiments, thus no experimental setup details like hyperparameters or system-level training settings are provided. |