Related papers: Forming Probably Stable Communities with Limited I…
We analyze a network formation game in a strategic setting where payoffs of individuals depend only on their immediate neighbourhood. We call these payoffs as localized payoffs. In this game, the payoff of each individual captures (1) the…
This paper develops a game-theoretic model and an agent-based model to study group formation driven by resource pooling, spatial cohesion, and heterogeneity. We focus on cross-sector partnerships (CSPs) involving public, private, and…
Most of previous studies concerning the Public Goods Game assume either participation is unconditional or the number of actual participants in a competitive group changes over time. How the fixed group size, prescribed by social…
Motivated by the study of social insects, we introduce a stochastic model based on interacting particle systems in order to understand the effect of communication on the division of labor. Members of the colony are located on the vertex set…
We study a subclass of the May-Leonard stochastic model with an arbitrary, even number of species, leading to the arising of two competing partnerships where individuals are indistinguishable. By carrying out a series of accurate numerical…
Federated learning is a setting where agents, each with access to their own data source, combine models from local data to create a global model. If agents are drawing their data from different distributions, though, federated learning…
Hedonic games are a prominent model of coalition formation, in which each agent's utility only depends on the coalition she resides. The subclass of hedonic games that models the formation of general partnerships, where output is shared…
The detection of communities is an important tool used to analyze the social graph of mobile phone users. Within each community, customers are susceptible of attracting new ones, retaining old ones and/or accepting new products or services…
Mutualistic interactions, which are beneficial for both interacting species, are recurrently present in ecosystems. Observations of natural systems showed that, if we draw mutualistic relationships as binary links between species, the…
It is often observed that agents tend to imitate the behavior of their neighbors in a social network. This imitating behavior might lead to the strategic decision of adopting a public behavior that differs from what the agent believes is…
We propose a notion of a stable partition in a coalitional game that is parametrized by the concept of a defection function. This function assigns to each partition of the grand coalition a set of different coalition arrangements for a…
This chapter discusses the interplay between structure and dynamics in complex networks. Given a particular network with an endowed dynamics, our goal is to find partitions aligned with the dynamical process acting on top of the network. We…
Considering a clique as a conservative definition of community structure, we examine how graph partitioning algorithms interact with cliques. Many popular community-finding algorithms partition the entire graph into non-overlapping…
Recent empirical studies suggest that heavy-tailed distributions of human activities are universal in real social dynamics [Muchnik, \emph{et al.}, Sci. Rep. \textbf{3}, 1783 (2013)]. On the other hand, community structure is ubiquitous in…
In various economic environments, people observe other people with whom they strategically interact. We can model such information-sharing relations as an information network, and the strategic interactions as a game on the network. When…
Understanding which system structure can sustain stable dynamics is a fundamental step in the design and analysis of large scale dynamical systems. Towards this goal, we investigate here the structural stability of systems with a random…
A model of Boolean game with only one free parameter $p$ that denotes the strength of herd behavior is proposed where each agent acts according to the information obtained from his neighbors in network and those in the minority are…
We live and cooperate in networks. However, links in networks only allow for pairwise interactions, thus making the framework suitable for dyadic games, but not for games that are played in groups of more than two players. Here, we study…
In this paper we analyse two-player games by their response graphs. The response graph has nodes which are strategy profiles, with an arc between profiles if they differ in the strategy of a single player, with the direction of the arc…
We study stable matching problems in networks where players are embedded in a social context, and may incorporate friendship relations or altruism into their decisions. Each player is a node in a social network and strives to form a good…