Potential-based analysis of social, communication, and distributed networks

Etesami, Seyed Rasoul

Permalink

https://hdl.handle.net/2142/89028 Copy

Description

Title

Potential-based analysis of social, communication, and distributed networks

Author(s)

Etesami, Seyed Rasoul

Issue Date

2015-12-02

Director of Research (if dissertation) or Advisor (if thesis)

Basar, Tamer

Doctoral Committee Chair(s)

Basar, Tamer

Committee Member(s)

• Hajek, Bruce
• Srikant, Rayadurgam
• Nedich, Angelia
• Olshevsky, Alex

Department of Study

Electrical & Computer Engineering

Discipline

Electrical & Computer Engineering

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

Ph.D.

Degree Level

Dissertation

Keyword(s)

• Game Theory
• Potential Theory
• Social Networks
• Distributed Control
• Multi-agent Systems
• Resource Allocation
• Consensus
• Opinion Dynamics
• Computational Complexity
• Rate of Convergence
• Lyapunov function

Abstract

In recent years, there has been a wide range of studies on the role of social and distributed networks in various disciplinary areas. In particular, availability of large amounts of data from online social networks and advances in control of distributed systems have drawn the attention of many researchers to exploit the connection between evolutionary behaviors in social, communication and distributed networks. In this thesis, we first revisit several well-known types of social and distributed networks and review some relevant results from the literature. Building on this, we present a set of new results related to four different types of problems, and identify several directions for future research. The study undertaken and the approaches adopted allow us to analyze the evolution of certain types of social and distributed networks and also to identify local and global patterns of their dynamics using some novel potential-theoretic techniques. Following the introduction and preliminaries, we focus on analyzing a specific type of distributed algorithm for quantized consensus known as an unbiased quantized algorithm where a set of agents interact locally in a network in order to reach a consensus. We provide tight expressions for the expected convergence time of such dynamics over general static and time-varying networks. Following this, we introduce new protocols using a special class of Markov chains known as Metropolis chains and obtain the fastest (as of today) randomized quantized consensus protocol. The bounds provided here considerably improve the state of the art over static and dynamic networks. We make a bridge between two classes of problems, namely distributed control problems and game problems. We analyze a class of distributed averaging dynamics known as Hegselmann-Krause opinion dynamics. Modeling such dynamics as a non-cooperative game problem, we elaborate on some of the evolutionary properties of such dynamics. In particular, we answer an open question related to the termination time of such dynamics by connecting the convergence time to the spectral gap of the adjacency matrices of underlying dynamics. This not only allows us to improve the best known upper bound, but also removes the dependency of termination time from the dimension of the ambient space. The approach adopted here can also be leveraged to connect the rate of increase of a so-called kinetic-s-energy associated with multi-agent systems to the spectral gap of their underlying dynamics. We describe a richer class of distributed systems where the agents involved in the network act in a more strategic manner. More specifically, we consider a class of resource allocation games over networks and study their evolution to some final outcomes such as Nash equilibria. We devise some simple distributed algorithms which drive the entire network to a Nash equilibrium in polynomial time for dense and hierarchical networks. In particular, we show that such games benefit from having low price of anarchy, and hence, can be used to model allocation systems which suffer from lack of coordination. This fact allows us to devise a distributed approximation algorithm within a constant gap of any pure-strategy Nash equilibrium over general networks. Subsequently we turn our attention to an important problem related to competition over social networks. We establish a hardness result for searching an equilibrium over a class of games known as competitive diffusion games, and provide some necessary conditions for existence of a pure-strategy Nash equilibrium in such games. In particular, we provide some concentration results related to the expected utility of the players over random graphs. Finally, we discuss some future directions by identifying several interesting problems and justify the importance of the underlying problems.

Graduation Semester

2015-12

Type of Resource

text

Permalink

http://hdl.handle.net/2142/89028

Copyright and License Information

Copyright 2015 Seyed Rasoul Etesami

Owning Collections