We propose a fully asynchronous networked aggregative game (Asy-NAG) where each player minimizes local cost function that depends on its own action and the aggregate of all players’ actions. In sharp contrast to existing NAGs, in our Asy-NAG can compute an estimate at any wall-clock time by only using (possibly stale) information from neighboring players directed network. Such update does not r...

network environments always can be invaded by intruder agents. in networks where nodes are performing some computations, intruder agents might contaminate some nodes. therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. in this paper, we present a distributed asynchronous local algorithm for decontaminating a network. in mos...