Envy-Free Cake-Cutting in Two Dimensions

Authors: Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann

AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We provide algorithms for the problem for settings with two and three agents. [...] Our contribution in this paper is to calculate a lower bound on Prop E(Square, n, Squares) and Prop E(Plane, n, Squares) for n {2, 3}.
Researcher Affiliation Academia Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann Bar-Ilan University Ramat-Gan Israel 5290002
Pseudocode No The paper describes procedures using numbered steps within the text (e.g., in Section 4 and 5) but does not present them in a formalized pseudocode block or algorithm environment.
Open Source Code No The paper does not provide any statements about releasing open-source code for the described methodology, nor does it include links to a code repository.
Open Datasets No The paper is theoretical and does not use or refer to any datasets for training or evaluation. It deals with abstract concepts like a "cake C" and "family of shapes S" rather than empirical data.
Dataset Splits No The paper is theoretical and does not involve empirical experiments with data. Therefore, it does not discuss training, validation, or test dataset splits.
Hardware Specification No The paper is theoretical and does not describe any computational experiments that would require specific hardware. Therefore, no hardware specifications are mentioned.
Software Dependencies No The paper is theoretical and focuses on mathematical proofs and algorithms for fair division. It does not mention any specific software dependencies or versions required to implement or run any part of the work.
Experiment Setup No The paper is theoretical and does not describe an experimental setup with details such as hyperparameters, model initialization, or training configurations.