Seyed Rasoul Etesami

Learn More
— We consider the Hegselmann-Krause model for opinion dynamics and study the evolution of the system under various settings. We first analyze the termination time of the synchronous Hegselmann-Krause dynamics in arbitrary finite dimensions and show that the termination time in general only depends on the number of agents involved in the dynamics. To the(More)
Advances in computing hardware and novel multimedia applications have urged the development of handheld mobile devices such as smartphones and tablets. Videos are accounting as the highest data traffic on handheld devices. With this significant increase of mobile video, one of the challenges is how to efficiently transmit the bulky video contents to(More)
We revisit the quantized consensus problem on undirected connected graphs, and obtain some strong results on expected time to convergence. This is unbiased consensus, because the edges emanating from a node have equal probability of being selected. The paper first develops an approach that bounds the expected convergence time of the underlying discrete-time(More)
3D tele-immersion improves the state of collaboration among geographically distributed participants. Unlike the traditional 2D videos, a 3D tele-immersive system employs multiple 3D cameras based in each physical site to cover a much larger field of view, generating a very large amount of stream data. One of the major challenges is how to efficiently(More)
— In this paper, we consider the competitive diffusion game, and study the existence of its pure-strategy Nash equilibrium when defined over general undirected networks. We first determine the set of pure-strategy Nash equilibria for two special but well-known classes of networks, namely the lattice and the hypercube. Characterizing the utility of the(More)
— We consider the quantized consensus problem on undirected connected graphs with n nodes, and devise a protocol with fast convergence time to the set of consensus points. Specifically, we show that when the edges of a static network are activated based on Poisson processes with Metropolis rates, the expected convergence time to the set of consensus points(More)
We consider the capacitated selfish replication game with binary preferences. We first devise an algorithm which can reach a pure Nash equilibrium on trees after n steps where n is the number of nodes (players) in the game. Introducing an ordinal potential function for such a game, we determine the convergence rate of the best response dynamics to a pure(More)