Assignment and Pricing in Roommate Market
Authors: Pak Chan, Xin Huang, Zhengyang Liu, Chihao Zhang, Shengyu Zhang
AAAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Various solution concepts on stability and envy-freeness are proposed, with their existence studied and the computational complexity of the corresponding search problems analyzed. In particular, we show that maximizing the social welfare is NP-hard, and we give a polynomial-time algorithm that achieves at least 2/3 of the maximum social welfare. |
| Researcher Affiliation | Academia | Pak Hay Chan The Chinese University of Hong Kong, HK Xin Huang The Chinese University of Hong Kong, HK Zhengyang Liu Shanghai Jiao Tong University, China Chihao Zhang Shanghai Jiao Tong University, China Shengyu Zhang The Chinese University of Hong Kong, HK |
| Pseudocode | Yes | Algorithm 1 Double-Matching |
| Open Source Code | No | The paper does not include any statement or link regarding the release of open-source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not use or reference any datasets. |
| Dataset Splits | No | The paper is theoretical and does not involve data processing, thus no dataset splits are mentioned. |
| Hardware Specification | No | The paper is theoretical, focusing on algorithm design and complexity analysis, and does not describe any computational experiments that would require specific hardware specifications. |
| Software Dependencies | No | The paper is theoretical and does not mention any specific software dependencies with version numbers required for replication. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details such as hyperparameters or training configurations. |