Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty and potential bias; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in [1].
Hedonic Games with Ordinal Preferences and Thresholds
Authors: Anna Maria Kerkmann, Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend
JAIR 2020 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We propose a new representation setting for hedonic games, where each agent partitions the set of other agents into friends, enemies, and neutral agents, with friends and enemies being ranked. Under the assumption that preferences are monotonic (respectively, antimonotonic) with respect to the addition of friends (respectively, enemies), we propose a bipolar extension of the responsive extension principle, and use this principle to derive the (partial) preferences of agents over coalitions. Then, for a number of solution concepts, we characterize partitions that necessarily or possibly satisfy them, and we study the related problems in terms of their complexity. ... Our contribution mostly consists in defining a new framework for hedonic games that comes with a representation language that offers a trade-off between expressivity and succinctness, and to study various stability notions in this setting. ... We have analyzed the computational complexity of the existence and the verification problem of well-known stability concepts for the induced hedonic games. |
| Researcher Affiliation | Academia | Anna Maria Kerkmann EMAIL Heinrich-Heine-Universit at D usseldorf 40225 D usseldorf, Germany. J erˆome Lang EMAIL LAMSADE, CNRS, Universit e Paris-Dauphine, PSL 75775 Paris Cedex 16, France. Anja Rey EMAIL Technische Universit at Dortmund 44221 Dortmund, Germany. J org Rothe EMAIL Hilmar Schadrack EMAIL Lena Schend EMAIL Heinrich-Heine-Universit at D usseldorf 40225 D usseldorf, Germany. |
| Pseudocode | Yes | Algorithm 1: Computing a necessarily perfect partition for G according to Proposition 26. ... Algorithm 2: NECESSARY-NASH-STABILITY-VERIFICATION. ... Algorithm 3: NECESSARY-INDIVIDUAL-STABILITY-VERIFICATION. ... Algorithm 4: NECESSARY-CONTRACTUALLY-INDIVIDUAL-STABILITY-VERIFICATION. ... Algorithm 5: POSSIBLE-NASH-STABILITY-VERIFICATION. ... Algorithm 6: POSSIBLE-INDIVIDUAL-STABILITY-VERIFICATION. ... Algorithm 7: POSSIBLE-CONTRACTUALLY-INDIVIDUAL-STABILITY-VERIFICATION. |
| Open Source Code | No | The paper does not contain any explicit statements about releasing source code for the described methodology, nor does it provide links to code repositories. |
| Open Datasets | No | The paper is theoretical in nature and focuses on defining a new framework for hedonic games and analyzing computational complexity. It does not involve empirical studies or the use of any datasets, public or otherwise. |
| Dataset Splits | No | The paper is theoretical and does not involve experimental evaluation using datasets. Therefore, there is no mention of dataset splits. |
| Hardware Specification | No | The paper is theoretical and focuses on mathematical proofs and complexity analysis. It does not describe any experimental setup or mention specific hardware used for running experiments. |
| Software Dependencies | No | The paper is theoretical, presenting mathematical definitions, propositions, and algorithms. It does not describe any implementation details that would require specific software or library versions. |
| Experiment Setup | No | The paper is theoretical and does not conduct experiments. Therefore, it does not provide details on experimental setup, hyperparameters, or training configurations. |