Related papers: Hedonic Games with Graph-restricted Communication
We are concerned with the stability of a coalitional game, i.e., a transferable-utility (TU) cooperative game. First, the concept of core can be weakened so that the blocking of changes is limited to only those with multilateral backings.…
We investigate the difficulty of finding economically efficient solutions to coordination problems on graphs. Our work focuses on two forms of coordination problem: pure-coordination games and anti-coordination games. We consider three…
Temporal graphs are a popular modelling mechanism for dynamic complex systems that extend ordinary graphs with discrete time. Simply put, time progresses one unit per step and the availability of edges can change with time. We consider the…
This paper explores a PAC (probably approximately correct) learning model in cooperative games. Specifically, we are given $m$ random samples of coalitions and their values, taken from some unknown cooperative game; can we predict the…
With increasing game size, a problem of computational complexity arises. This is especially true in real world problems such as in social systems, where there is a significant population of players involved in the game, and the complexity…
Many popular puzzle and matching games have been analyzed through the lens of computational complexity. Prominent examples include Sudoku, Candy Crush, and Flood-It. A common theme among these widely played games is that their generalized…
A matching game is a cooperative profit game defined on an edge-weighted graph, where the players are the vertices and the profit of a coalition is the maximum weight of matchings in the subgraph induced by the coalition. A population…
We study strategic games on weighted directed graphs, where the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy augmented by a fixed non-negative bonus for picking a given…
We introduce friend- and enemy-oriented hedonic games with strangers (FOHGS and EOHGS respectively), two classes of hedonic games wherein agents are classified as friends, enemies, or strangers under the assumption that strangers will…
The paper is devoted to game-theoretic methods for community detection in networks. The traditional methods for detecting community structure are based on selecting denser subgraphs inside the network. Here we propose to use the methods of…
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it…
This paper studies the formation of the grand coalition of a cooperative game by investigating its possible internal dynamics. Each coalition is capable of forcing all players to reconsider the current state of the game when it does not…
We consider the coalition formation games with an additional component, `noisy preferences'. Moreover, such noisy preferences are available only for a sample of coalitions. We propose a multiplicative noise model and obtain the prediction…
We introduce a new class of network allocation games called graphical distance preservation games. Here, we are given a graph, called a topology, and a set of agents that need to be allocated to its vertices. Moreover, every agent has an…
An edge-weighted, vertex-capacitated graph G is called stable if the value of a maximum-weight capacity-matching equals the value of a maximum-weight fractional capacity-matching. Stable graphs play a key role in characterizing the…
Additively separable hedonic games (ASHGs) are a prominent model of coalition formation where agents' preferences are derived from their individual valuations of peers. While social welfare maximization in ASHGs has traditionally focused…
In recent years, there has been a growing interest in games on graphs within the research community, fueled by their relevance in applications such as economics, politics, and epidemiology. This paper aims to comprehensively detail the…
We show that a cooperative game may be decomposed into a sum of component games, one for each player, using the combinatorial Hodge decomposition on a graph. This decomposition is shown to satisfy certain efficiency, null-player, symmetry,…
We present the notion of separable game with respect to a forward directed hypergraph (FDH-graph), which refines and generalizes that of graphical game. First, we show that there exists a minimal FDH-graph with respect to which a game is…
This paper aims to reduce the communication and computation costs of the Nash equilibrium seeking strategy for the $N$-coalition noncooperative games proposed in [1]. The objective is achieved in two manners: 1. An interference graph is…