Variations on the Hotelling-Downs Model

Authors: Michal Feldman, Amos Fiat, Svetlana Obraztsova

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

Reproducibility Variable Result LLM Response
Research Type Theoretical We analyze the resulting model and show that pure Nash equilibria always exist (see Section 3); With respect to the measure of client participation, we consider bounds on the Price of Anarchy (PoA). We provide detailed bounds as a function of the size of the attraction interval of an agent, and the agent utility function.
Researcher Affiliation Academia Michal Feldman and Amos Fiat Department of Computer Science Tel-Aviv University, Israel Svetlana Obraztsova I-CORE Hebrew University of Jerusalem, Israel
Pseudocode No The paper is theoretical and presents mathematical models, theorems, and proofs, but it does not include any pseudocode or algorithm blocks.
Open Source Code No The paper does not provide any statement or link indicating that source code for the described models or analyses is publicly available.
Open Datasets No The paper refers to a theoretical distribution of clients ("a continuum of clients are distributed along the interval [0, 1] according to a known density function f(x)") rather than an empirical dataset, and therefore does not provide access information for a publicly available dataset.
Dataset Splits No The paper is theoretical and does not involve empirical datasets or their partitioning into train/validation/test splits.
Hardware Specification No The paper is theoretical and does not describe computational experiments that would require hardware specifications. Therefore, no hardware details are provided.
Software Dependencies No The paper is theoretical and does not describe computational experiments that would require specific software dependencies or version numbers for replication.
Experiment Setup No The paper is theoretical and does not describe empirical experiments, therefore it does not include details about an "experiment setup" or hyperparameters.