Online Pricing for Multi-User Multi-Item Markets

Authors: Yigit Efe Erginbas, Thomas Courtade, Kannan Ramchandran, Soham Phade

NeurIPS 2023 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Experimental In this section, we demonstrate the efficacy of our proposed algorithms through a numerical study. We provide our results in Figures 3 and 4.
Researcher Affiliation Collaboration 1University of California, Berkeley 2Wayve Technologies
Pseudocode Yes Algorithm 1 Offerings with incremental search prices
Open Source Code No The paper does not include any explicit statements or links indicating that source code for the described methodology is publicly available.
Open Datasets No The paper describes how the data for the numerical experiments is generated synthetically ("each vui independently from Beta(2, 2)", "Fui as the cdf of Beta(αui, βui)"), but it does not use or provide access to a publicly available or open dataset.
Dataset Splits No The paper describes the synthetic data generation and simulation parameters for its numerical experiments but does not provide specific training/validation/test dataset splits in the conventional sense for model evaluation.
Hardware Specification No The paper does not provide any specific hardware details (e.g., CPU, GPU models, memory, or cloud instances) used for running the numerical experiments.
Software Dependencies No The paper does not specify any software dependencies with version numbers used for implementing or running the experiments.
Experiment Setup Yes At each round t [T], the provider is endowed with each item i I (i.e. i Et) independently with probability 0.5. On the other hand, each user u N has a random demand dt u with uniform probability over {0, 1, 2}. For the case of fixed valuations, we choose each vui independently from Beta(2, 2). For other two models, we set each Fui as the cdf of Beta(αui, βui) where αui and βui are uniformly and independently chosen over [1, 5].