Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation

DOI10.1613/jair.1.11211zbMath1452.91050OpenAlexW3021716563WikidataQ129512259 ScholiaQ129512259MaRDI QIDQ4580266

Gianpiero Monaco, Vittorio Bilò, Michele Flammini, Angelo Fanelli, Luca Moscardelli

Publication date: 14 August 2018

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11211

zbMATH Keywords

bipartite graphssocial welfaretree graphsfractional hedonic gamesNash stable outcomes

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Related Items (15)

Distance hedonic games ⋮ Additively separable hedonic games with social context ⋮ Hedonic diversity games: a complexity picture with more than two colors ⋮ Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games ⋮ Stability and welfare in (dichotomous) hedonic diversity games ⋮ Unnamed Item ⋮ Maximizing Social Welfare in Score-Based Social Distance Games ⋮ On the price of stability of some simple graph-based hedonic games ⋮ Generalized graph \(k\)-coloring games ⋮ Modified Schelling games ⋮ Price of Pareto optimality in hedonic games ⋮ Topological Influence and Locality in Swap Schelling Games. ⋮ Strategyproof mechanisms for friends and enemies games ⋮ Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games ⋮ Topological price of anarchy bounds for clustering games on networks

This page was built for publication: Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation