Related papers: The core of games on ordered structures and graphs
The success of modern civilization is built upon widespread cooperation in human society, deciphering the mechanisms behind has being a major goal for centuries. A crucial fact is, however, largely missing in most prior studies that games…
In this paper, we consider a sequence of transferable utility (TU) coalitional games where the coalitional values are unknown but vary within certain bounds. As a solution to the resulting family of games, we formalise the notion of "robust…
We study hedonic coalition formation games in which cooperation among the players is restricted by a graph structure: a subset of players can form a coalition if and only if they are connected in the given graph. We investigate the…
The concept of power among players can be expressed as a combination of their utilities. A player who obeys another takes into account the utility of the dominant one. Technically it is a matter of superimposing some weighted sum or product…
Agent-based modeling (ABM) is a powerful paradigm to gain insight into social phenomena. One area that ABM has rarely been applied is coalition formation. Traditionally, coalition formation is modeled using cooperative game theory. In this…
A new approach for the description of phenomena of social aggregation is suggested. On the basis of psychological concepts (as for instance social norms and cultural coordinates), we deduce a general mechanism for the social aggregation in…
We consider a team formation setting where agents have varying levels of expertise in a global set of required skills, and teams are ranked with respect to how well the expertise of teammates complement each other. We model this setting as…
We start with the well-known game below: Two players hold a sheet of paper to their forehead on which a positive integer is written. The numbers are consecutive and each player can only see the number of the other one. In each time step,…
Game theory-based approaches have recently gained traction in a wide range of applications, importantly in power and energy systems. With the onset of cooperation as a new perspective for solving power system problems, as well as the nature…
Minimal balanced collections are a generalization of partitions of a finite set of n elements and have important applications in cooperative game theory and discrete mathematics. However, their number is not known beyond n = 4. In this…
In repeated games, players choose actions concurrently at each step. We consider a parameterized setting of repeated games in which the players form a population of an arbitrary size. Their utility functions encode a reachability objective.…
The optimization of facility-based systems is considered. First, the congestion game is converted into a matrix form, so that the matrix approach is applicable. Then, a facility-based system with a system performance criterion is…
We consider transferable utility cooperative games with infinitely many players and the core understood in the space of bounded additive set functions. We show that, if a game is bounded below, then its core is non-empty if and only if the…
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 investigate Gately's solution concept for cooperative games with transferable utilities. Gately's conception introduced a bargaining solution that minimises the maximal quantified ``propensity to disrupt'' the negotiation process of the…
We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of…
We study the notion of efficiency for cooperative games on simplicial complexes. In such games, the grand coalition $[n]$ may be forbidden, and, thus, it is a non-trivial problem to study the total number of payoff $v_{\Delta}$ of a…
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided among the participants. Potential contracts and their surplus…
This paper introduces the class of cooperative games with generalized coalition configuration. This new class of games corresponds to cooperative games with coalition configuration and restricted cooperation. A coalition configuration is a…
This article presents an overview of computability logic -- the game-semantically constructed logic of interactive computational tasks and resources. There is only one non-overview, technical section in it, devoted to a proof of the…