A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
The paper develops a novel computational framework for predicting communication flow in social networks based on several contextual features. The problem is important because pred...
Munmun De Choudhury, Hari Sundaram, Ajita John, Do...
We consider a model of content contribution in peer-to-peer networks with linear quadratic payoffs and very general interaction patterns. We find that Nash equilibria of this gam...
Motivated by the growth of various networked systems as potential market places, we study market models wherein, owing to the size of the markets, transactions take place between l...
Atish Das Sarma, Deeparnab Chakrabarty, Sreenivas ...