Loyalty in Cardinal Hedonic Games

Authors: Martin Bullinger, Stefan Kober

IJCAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We investigate axioms of group stability and efficiency for different degrees of loyalty. Specifically, we consider the problem of finding coalition structures in the core and of computing best coalitions, obtaining both positive and intractability results. In particular, the limit game possesses Pareto optimal coalition structures in the core. (Abstract) and Theorem 2. Let k 1. Then, Best Coalition is NP-complete for the k-fold loyal variant of symmetric FOHGs.
Researcher Affiliation Academia Martin Bullinger and Stefan Kober Technical University of Munich bullinge@in.tum.de, stefan.kober@tum.de
Pseudocode No The paper contains theoretical definitions, theorems, and proofs, but no pseudocode or algorithm blocks are provided.
Open Source Code No The paper is a theoretical work and does not mention releasing open-source code for its described methodology.
Open Datasets No The paper is theoretical and does not involve empirical experiments or datasets, so no dataset availability information is provided.
Dataset Splits No The paper is theoretical and does not involve empirical experiments or datasets, so no dataset split information for training, validation, or testing is provided.
Hardware Specification No The paper is theoretical and does not describe any computational experiments, thus no hardware specifications are mentioned.
Software Dependencies No The paper is theoretical and does not describe any computational implementations, thus no software dependencies with version numbers are listed.
Experiment Setup No The paper is theoretical and does not describe any computational experiments or their setup, so no experimental setup details like hyperparameters are provided.