activity
20092024
most citedCoalitional Game Theory for Communication Networks: A Tutorial

1.1k citations · 3.4k across the 144 of their papers we have counts for

collaborators
Showing 2014 · eess.SYShow all

7 papers · 2 filters

eess.SY2014

Formation Control with Triangulated Laman Graphs

Xudong Chen, M. -A. Belabbas, Tamer Basar

Formation control deals with the design of decentralized control laws that stabilize agents at prescribed distances from each other. We call any configuration that satisfies the in…

eess.SY2014★ 2 cited

Controllability of Formations over Time-varying Graphs

Xudong Chen, M. -A. Belabbas, Tamer Basar

In this paper, we investigate the controllability of a class of formation control systems. Given a directed graph, we assign an agent to each of its vertices and let the edges of t…

eess.SY2014

Stability of Epidemic Models over Directed Graphs: A Positive Systems Approach

Ali Khanafer, Tamer Başar, Bahman Gharesifard

We study the stability properties of a susceptible-infected-susceptible (SIS) diffusion model, so-called the -intertwined Markov model, over arbitrary directed network topologie…

eess.SY2014★ 1 cited

Robust Distributed Averaging: When are Potential-Theoretic Strategies Optimal?

Ali Khanafer, Tamer Başar

We study the interaction between a network designer and an adversary over a dynamical network. The network consists of nodes performing continuous-time distributed averaging. The a…

eess.SY2014★ 1 cited

On the Existence of Optimal Policies for a Class of Static and Sequential Dynamic Teams

Abhishek Gupta, Serdar Yuksel, Tamer Basar +1

In this paper, we identify sufficient conditions under which static teams and a class of sequential dynamic teams admit team-optimal solutions. We first investigate the existence o…

eess.SY2014★ 36 cited

Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks

Seyed Rasoul Etesami, Tamer Basar

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…