#### Filter Results:

#### Publication Year

2013

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

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)

— 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… (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)

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)

— In this paper, the question of expected time to convergence is addressed for unbiased quantized consensus on undirected connected graphs, and some strong results are obtained. The paper first provides a tight expression for the expected convergence time of the unbiased quantized consensus over general but fixed networks. It is shown that the maximum… (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)

— 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)

A resource allocation game with identical preferences is considered where each player, as a node of an undirected unweighted network, tries to minimize her cost by caching an appropriate resource. Using a generalized ordinal potential function, a polynomial time algorithm is devised in order to obtain a pure-strategy Nash equilibrium (NE) when the number of… (More)