Altruistic Hedonic Games
Authors: Anna Maria Kerkmann, Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend, Alessandra Wiechers
JAIR 2022 | Venue PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We study both the axiomatic properties of these games and the computational complexity of problems related to various common stability concepts. ... Axiomatically, we have defined desirable properties and have shown which of these are satisfied by which of our models and which are not. In particular, we have shown that all our altruistic preferences fulfill basic properties, such as reflexivity, transitivity, polynomial-time computability of utilities, and anonymity. Moreover, we have studied properties such as local unanimity, local friend dependence, and monotonicity. ... In terms of stability, altruistic hedonic games always admit, e.g., Nash stable coalition structures. ... the verification problems for core stability and strict core stability are computationally intractable, i.e., co NP-complete. |
| Researcher Affiliation | Academia | Anna Maria Kerkmann EMAIL Nhan-Tam Nguyen EMAIL Anja Rey EMAIL Lisa Rey EMAIL Jörg Rothe EMAIL Lena Schend EMAIL Alessandra Wiechers EMAIL Heinrich-Heine-Universität Düsseldorf, Universitätsstraße 1, 40225 Düsseldorf, Germany |
| Pseudocode | No | The paper presents theoretical concepts, definitions, theorems, and proofs. It does not include any blocks explicitly labeled "Pseudocode" or "Algorithm" with structured, code-like steps. Processes are described in natural language. |
| Open Source Code | No | The paper does not provide an explicit statement or link for the availability of source code for the methodology described. The "Future Work" section mentions that a "tool will be publicly available" as a future plan, not a current release. |
| Open Datasets | No | The paper uses abstract examples (e.g., "Consider a game with five agents where the network of friends forms a path as shown in Figure 4a") to illustrate theoretical concepts. It does not rely on or mention any specific publicly available datasets for empirical evaluation. |
| Dataset Splits | No | The paper is theoretical and does not use datasets for empirical evaluation. Therefore, no dataset splits (training/test/validation) are mentioned. |
| Hardware Specification | No | As a theoretical paper focusing on axiomatic properties and computational complexity in game theory, it does not describe any experimental setups or specify the hardware used to run experiments. |
| Software Dependencies | No | This is a theoretical paper focusing on mathematical models and complexity analysis. It does not describe any implementation details or mention specific software dependencies with version numbers. |
| Experiment Setup | No | As a theoretical paper, there is no discussion of experimental setup, hyperparameters, training configurations, or system-level settings in the main text. |