Altruism in Facility Location Problems

Authors: Houyu Zhou, Hau Chan, Minming Li

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

Reproducibility Variable Result LLM Response
Research Type Theoretical For each of these settings, we provide upper and lower bounds of approximation ratios of the mechanisms satisfying Pareto strategyproofness. and Table 1 summarizes our upper and lower bound results. and Due to the space limit, most of the proofs are omitted.
Researcher Affiliation Academia Houyu Zhou1, Hau Chan2, Minming Li1 1Department of Computer Science, City University of Hong Kong 2School of Computing, University of Nebraska-Lincoln
Pseudocode No The paper describes mechanisms through descriptive text but does not include formal pseudocode blocks or algorithms labeled as such.
Open Source Code No The paper does not provide any specific links or explicit statements about the release of open-source code for the described methodology.
Open Datasets No This paper is theoretical and does not use or refer to any datasets.
Dataset Splits No This paper is theoretical and does not describe any experimental setups that would require dataset splits.
Hardware Specification No This paper is theoretical and does not describe any experiments that would involve specific hardware. Therefore, no hardware specifications are mentioned.
Software Dependencies No This paper is theoretical and focuses on mathematical proofs and mechanism design, thus it does not list any software dependencies with version numbers.
Experiment Setup No This paper is theoretical and does not describe any experimental setups or specific parameters used for experiments.