Online Roommate Allocation Problem
Authors: Guangda Huzhang, Xin Huang, Shengyu Zhang, Xiaohui Bei
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We study the online allocation problem... We first show a polynomial-time online algorithm that achieves a constant competitive ratio for social welfare maximization. We then extend it... Finally, we show both positive and negative results in satisfying various stability conditions in this online setting. |
| Researcher Affiliation | Academia | 1,4School of Physical and Mathematical Sciences, Nanyang Technological University 2,3Department of Computer Science and Engineering, The Chinese University of Hong Kong |
| Pseudocode | Yes | Algorithm 1 ONLINEMATCHING(n, R) |
| Open Source Code | No | The paper does not provide any concrete access information for source code. |
| Open Datasets | No | The paper is theoretical and does not involve the use of datasets for training. |
| Dataset Splits | No | The paper is theoretical and does not involve dataset splits for validation. |
| Hardware Specification | No | The paper is theoretical and does not provide any specific hardware details used for running experiments. |
| Software Dependencies | No | The paper is theoretical and does not list any software dependencies with specific version numbers. |
| Experiment Setup | No | The paper is theoretical and does not contain specific experimental setup details or hyperparameter values. |