Related papers: Swap Stability in Schelling Games on Graphs
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take part in a two-player game over a network of nodes whose…
Learning processes in games explain how players grapple with one another in seeking an equilibrium. We study a natural model of learning based on individual gradients in two-player continuous games. In such games, the arguably natural…
We study a game-theoretic variant of the maximum circulation problem. In a flow allocation game, we are given a directed flow network. Each node is a rational agent and can strategically allocate any incoming flow to the outgoing edges.…
In the game theory literature, there appears to be little research on equilibrium selection for normal-form games with an infinite strategy space and discontinuous utility functions. Moreover, many existing selection methods are not…
The classical house allocation problem involves assigning $n$ houses (or items) to $n$ agents according to their preferences. A key criterion in such problems is satisfying some fairness constraints such as envy-freeness. We consider a…
We study an evolutionary version of the Prisoner's Dilemma game, played by agents placed in a small-world network. Agents are able to change their strategy, imitating that of the most successful neighbor. We observe that different…
The network coloring game has been proposed in the literature of social sciences as a model for conflict-resolution circumstances. The players of the game are the vertices of a graph with $n$ vertices and maximum degree $\Delta$. The game…
Despite many distributed resource allocation (DRA) algorithms have been reported in literature, it is still unknown how to allocate the resource optimally over multiple interacting coalitions. One major challenge in solving such a problem…
We consider a coalition formation setting where each agent belongs to one of the two types, and agents' preferences over coalitions are determined by the fraction of the agents of their own type in each coalition. This setting differs from…
In this paper, we study finite-agent linear-quadratic games on graphs. Specifically, we propose a comprehensive framework that extends the existing literature by incorporating heterogeneous and interpretable player interactions. Compared to…
Human societies engage in a number of games which use tokens as a means to allocate, issue and access gated resources and property rights: The notion of exchanging tokens that represent and carry value from the past into the future to…
The behaviour of multi-agent learning in many player games has been shown to display complex dynamics outside of restrictive examples such as network zero-sum games. In addition, it has been shown that convergent behaviour is less likely to…
We study the dynamics of individual agents in some kinetic models of wealth exchange, particularly, the models with savings. For the model with uniform savings, agents perform simple random walks in the "wealth space". On the other hand, we…
In this paper, we study proximal type dynamics in the context of noncooperative multi-agent network games. These dynamics arise in different applications, since they describe distributed decision making in multi-agent networks, e.g., in…
Schelling's model of segregation is one of the first and most influential models in the field of social simulation. There are many variations of the model which have been proposed and simulated over the last forty years, though the present…
Distributed decision making in multi-agent networks has recently attracted significant research attention thanks to its wide applicability, e.g. in the management and optimization of computer networks, power systems, robotic teams, sensor…
We study the problem of assigning agents to the vertices of a graph such that no pair of neighbors can benefit from swapping assignments -- a property we term neighborhood stability. We further assume that agents' utilities are based solely…
In this paper, we present a framework for multi-agent learning in a nonstationary dynamic network environment. More specifically, we examine projected gradient play in smooth monotone repeated network games in which the agents'…
Network Creation Games are an important framework for understanding the formation of real-world networks. These games usually assume a set of indistinguishable agents strategically buying edges at a uniform price leading to a network among…
Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic autonomous biologic entities. The…