Additively Separable Hedonic Games with Social Context

被引:0
|
作者
Monaco, Gianpiero [1 ]
Moscardelli, Luca [2 ]
Velaj, Yllka [3 ]
机构
[1] Univ Aquila, Dept Informat Engn Comp Sci & Math, I-67100 Laquila, Italy
[2] Univ G dAnnunzio, Dept Econ Studies, Viale Pindaro 42, I-65125 Pescara, Italy
[3] Univ Vienna, Fac Comp Sci, A-1090 Vienna, Austria
来源
GAMES | 2021年 / 12卷 / 03期
关键词
coalition formation; hedonic games; nash equilibrium; price of anarchy; price of stability; social context; COALITION-FORMATION; STABILITY; NETWORKS;
D O I
10.3390/g12030071
中图分类号
F [经济];
学科分类号
02 ;
摘要
In hedonic games, coalitions are created as a result of the strategic interaction of independent players. In particular, in additively separable hedonic games, every player has valuations for all other ones, and the utility for belonging to a coalition is given by the sum of the valuations for all other players belonging to it. So far, non-cooperative hedonic games have been considered in the literature only with respect to totally selfish players. Starting from the fundamental class of additively separable hedonic games, we define and study a new model in which, given a social graph, players also care about the happiness of their friends: we call this class of games social context additively separable hedonic games (SCASHGs). We focus on the fundamental stability notion of Nash equilibrium, and study the existence, convergence and performance of stable outcomes (with respect to the classical notions of price of anarchy and price of stability) in SCASHGs. In particular, we show that SCASHGs are potential games, and therefore Nash equilibria always exist and can be reached after a sequence of Nash moves of the players. Finally, we provide tight or asymptotically tight bounds on the price of anarchy and the price of stability of SCASHGs.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games
    Flammini, Michele
    Kodric, Bojana
    Monaco, Gianpiero
    Zhang, Qiang
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2021, 70 : 1253 - 1279
  • [2] Computing desirable partitions in additively separable hedonic games
    Aziz, Hans
    Brandt, Felix
    Seedig, Hans Georg
    [J]. ARTIFICIAL INTELLIGENCE, 2013, 195 : 316 - 334
  • [3] Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
    Gairing, Martin
    Savani, Rahul
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2019, 44 (03) : 1101 - 1121
  • [4] Nash Stability in Additively Separable Hedonic Games and Community Structures
    Olsen, Martin
    [J]. THEORY OF COMPUTING SYSTEMS, 2009, 45 (04) : 917 - 925
  • [5] Nash Stability in Additively Separable Hedonic Games and Community Structures
    Martin Olsen
    [J]. Theory of Computing Systems, 2009, 45 : 917 - 925
  • [6] Single-Agent Dynamics in Additively Separable Hedonic Games
    Brandt, Felix
    Bullinger, Martin
    Tappe, Leo
    [J]. THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 4867 - 4874
  • [7] Nash stability in additively separable hedonic games is NP-Hard
    Olsen, Martin
    [J]. COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 598 - 605
  • [8] Stability based on single-agent deviations in additively separable hedonic games
    Brandt, Felix
    Bullinger, Martin
    Tappe, Leo
    [J]. ARTIFICIAL INTELLIGENCE, 2024, 334
  • [9] Separable Hedonic Games and Contractually Stabilities
    Tanaka, Masaya
    Sung, Shao-Chin
    [J]. PROCEEDINGS OF THE 20TH CZECH-JAPAN SEMINAR ON DATA ANALYSIS AND DECISION MAKING UNDER UNCERTAINTY, 2017, : 204 - 211
  • [10] Folk theorems in a class of additively separable games
    Delbono, Flavio
    Lambertini, Luca
    [J]. MATHEMATICAL SOCIAL SCIENCES, 2018, 92 : 10 - 15