Related papers: Limits on Relief through Constrained Exchange on R…
A long-standing goal of social network research has been to alter the properties of network to achieve the desired outcome. In doing so, DeGroot's consensus model has served as the popular choice for modeling the information diffusion and…
In this work we study the individual strategies carried out by agents undergoing transactions in wealth exchange models. We analyze the role of risk propensity in the behavior of the agents and find a critical risk, such that agents with…
We introduce the class of modified Schelling games in which there are different types of agents who occupy the nodes of a location graph; agents of the same type are friends, and agents of different types are enemies. Every agent is…
We model the transmission of information of a message on the Erd\"os-R\'eny random graph with parameters $(n,p)$ and limited resources. The vertices of the graph represent servers that may broadcast a message at random. Each server has a…
We propose a novel kinetic exchange model differing from previous ones in two main aspects. First, the basic dynamics is modified in order to represent economies where immediate wealth exchanges are carried out, instead of reshufflings or…
Using a model of wealth distribution where traders are characterized by quenched random saving propensities and trade among themselves by bipartite transactions, we mimic the enhanced rates of trading of the rich by introducing the…
We present a detailed numerical analysis of the modified version of a conservative self-organized extremal model introduced by Pianegonda et. al. for the distribution of wealth of the people in a society. Here the trading process has been…
The constrained consensus problem considered in this paper, denoted interval consensus, is characterized by the fact that each agent can impose a lower and upper bound on the achievable consensus value. Such constraints can be encoded in…
We consider $k$ mobile agents of limited energy that are initially located at vertices of an edge-weighted graph $G$ and have to collectively deliver data from a source vertex $s$ to a target vertex $t$. The data are to be collected by an…
We consider the problem of collective exploration of a known $n$-node edge-weighted graph by $k$ mobile agents that have limited energy but are capable of energy transfers. The agents are initially placed at an arbitrary subset of nodes in…
We consider an ideal closed stock market, in which 100 traders have economic activities. The assets of the traders change through buying and selling stocks. We simulate the assets under conservation of both total currency and total number…
Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…
We study the fair allocation of indivisible items subject to conflict constraints. In this framework, the items are represented as the vertices of a graph, with edges corresponding to conflicts between pairs of items. Each agent is assigned…
We introduce a new framework to model interactions among agents which seek to trade to minimize their risk with respect to some future outcome. We quantify this risk using the concept of risk measures from finance, and introduce a class of…
Consider a network of M >> 1 nodes connected by N >> 1 links, in which the distribution of the number of links per node follows a power law with exponent 0<\alpha <1. The power law is naturally truncated due to the fact that N is finite. A…
We study statistical properties of a zero-range process (ZRP) on random networks. We derive an analytic expression for the distribution of particles (also called node occupation distribution) in the steady state of the ZRP in the ensemble…
We provide a protocol for real-valued average consensus by networks of agents which exchange only a single message from the ternary alphabet {-1,0,1} between neighbors at each step. Our protocol works on time-varying undirected graphs…
We consider a problem where autonomous agents enter a dynamic and unknown environment described by a network of weighted arcs. These agents move within the network from node to node according to a decentralized policy using only local…
We consider multi-item exchange markets in which agents want to receive one of their target bundles of resources. The model encompasses well-studied markets for kidney exchange, lung exchange, and multi-organ exchange. We identify a general…
We study the problem of fair online resource allocation via non-monetary mechanisms, where multiple agents repeatedly share a resource without monetary transfers. Previous work has shown that every agent can guarantee $1/2$ of their ideal…