Robustness against Agent Failure in Hedonic Games
Authors: Ayumi Igarashi, Kazunori Ota, Yuko Sakurai, Makoto Yokoo
IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we propose a novel criterion that reshapes stability form robustness aspect. We prove that we can efficiently decide the existence of robust outcomes... We also prove that symmetric additively separable games always admit an individual stable outcome... Our complexity results are summarized in Table 1. |
| Researcher Affiliation | Academia | 1University of Tokyo, Tokyo, Japan, 2Kyusu University, Fukuoka, Japan, 3National Institute of Advanced Industrial Science and Technology, Tokyo, Japan |
| Pseudocode | No | No pseudocode or algorithm blocks were found. |
| Open Source Code | No | The paper is theoretical and does not mention releasing open-source code for any methodology. The link to arXiv is for the full paper version, not code. |
| Open Datasets | No | The paper is theoretical and does not involve training models on datasets. |
| 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 describe experiments requiring hardware specifications. |
| Software Dependencies | No | The paper is theoretical and does not describe software implementations with specific version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe experimental setups or hyperparameters. |