Monday, 13:45 - 14:10 h, Room: MA 043


Dario Bauso
Time-averaged consensus and distributed approachability in large multi-agent networks

Coauthors: Giuseppe Notarstefano, Raffaele Pesenti


We consider a doubly (over time and space) distributed averaging algorithm in a large multi-agent network. At every iteration, each single agent first computes a weighted average of its own time-averaged estimate and those of his neighbors and then generates a new estimate in order to drive the time-averaged estimate towards a pre-assigned set. The main contribution of the paper is to prove that under certain assumptions, i) all agents reach consensus on time-averaged estimates, and ii) the estimates approach the pre-assigned set. Conditions for this to happen are related to the connectivity over time of the communication topology and to the approachability principle. Motivations arise in the context of repeated coalitional games with transferable utilities (TU). Here, the algorithm represents a distributed allocation process converging to the core of the game in the limit.


Talk 2 of the invited session Mon.2.MA 043
"Large games and networks: Control and approachability" [...]
Cluster 8
"Game theory" [...]


  online cash advance . One of the main advantages of Sovaldi is that it can be used by patients belonging to all 4 genotypes. Buy Sovaldi is a very strong drug, and as all of them, it has a number of side effects that can be caused.