Related papers: Topological Distance Games
A community needs to be partitioned into disjoint groups; each community member has an underlying preference over the groups that they would want to be a member of. We are interested in finding a stable community structure: one where no…
Economic ensembles can be modeled as networks of interacting agents whose be-haviors are described in terms of game theory. The evolutionary paradigm has been applied to two-person games to discover strategies in this context.…
We consider a sequence of transferable utility (TU) games where, at each time, the characteristic function is a random vector with realizations restricted to some set of values. The game differs from other ones in the literature on dynamic,…
We consider zero-sum games in which players move between adjacent states, where in each pair of adjacent states one state dominates the other. The states in our game can represent positional advantages in physical conflict such as high…
We consider a group of strategic agents who must each repeatedly take one of two possible actions. They learn which of the two actions is preferable from initial private signals, and by observing the actions of their neighbors in a social…
Hedonic games provide a natural model of coalition formation among self-interested agents. The associated problem of finding stable outcomes in such games has been extensively studied. In this paper, we identify simple conditions on…
In this Letter we present a new perspective for the study of the Public Goods games on complex networks. The idea of our approach is to consider a realistic structure for the groups in which Public goods games are played. Instead of…
A critical aspect in strategic modeling of transportation systems is user heterogeneity. In many real-world scenarios, e.g., when tolls are charged and drivers have different trade-offs between time and money, or when they get informed…
Control of multi-agent systems via game theory is investigated. Assume a system level object is given, the utility functions for individual agents are designed to convert a multi-agent system into a potential game. First, for fixed…
One of the natural objectives of the field of the social networks is to predict agents' behaviour. To better understand the spread of various products through a social network arXiv:1105.2434 introduced a threshold model, in which the nodes…
This work investigates the problem of multi-agents trajectory prediction. Prior approaches lack of capability of capturing fine-grained dependencies among coordinated agents. In this paper, we propose a spatial-temporal trajectory…
In optimizing the topology of wireless networks built of a dynamic set of spatially embedded agents, there are many trade-offs to be dealt with. The network should preferably be as small (in the sense that the average, or maximal,…
Underlying relationships among multi-agent systems (MAS) in hazardous scenarios can be represented as Game-theoretic models. We measure the performance of MAS achieving tasks from the perspective of balancing success probability and system…
In multiplayer games with sequential decision-making, self-interested players form dynamic coalitions to achieve most-preferred temporal goals beyond their individual capabilities. We introduce a novel procedure to synthesize strategies…
We consider the following problem - a group of mobile agents perform some task on a terrain modeled as a graph. In a given moment of time an adversary gets an access to the graph and positions of the agents. Shortly before adversary's…
We investigate the effects of social interactions in task al- location using Evolutionary Game Theory (EGT). We propose a simple task-allocation game and study how different learning mechanisms can give rise to specialised and non-…
We study how strategic interaction can arise from controlled quantum dynamics rather than being imposed as an external mathematical structure. We introduce a class of interaction-defined quantum games in which players are represented by…
We put forward a new model of congestion games where agents have uncertainty over the routes used by other agents. We take a non-probabilistic approach, assuming that each agent knows that the number of agents using an edge is within a…
Complex networks are a great tool for simulating the outcomes of different strategies used within the iterated prisoners' dilemma game. However, because the strategies themselves rely on the connection between nodes, then initial network…
The Unique Games Conjecture (UGC) constitutes a highly dynamic subarea within computational complexity theory, intricately linked to the outstanding P versus NP problem. Despite multiple insightful results in the past few years, a proof for…