Bauso, D. and Notarstefano, G. (2012) Distributed n-player approachability via time and space average consensus. In: Estimation and Control of Networked Systems. 3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems (2012) IFAC , 198 - 203. ISBN 9783902823229
Abstract
In this paper we consider repeated coalitional games with transferable utilities (TU) over networks. Namely, we consider a set of n players that have to distribute among themselves a vector of rewards (one for each player). In our network version there is no coordinator allocating the rewards, but the agents have to agree on a common time-averaged vector by updating the local estimates of the reward vector. The common time-averaged reward vector has to approach a suitable constraint set, called core of the game, that guarantees that no agents benefit from quitting the grand coalition. We propose a doubly (over time and space) averaging distributed algorithm. At every iteration, each agent first computes a weighted average of its own time-averaged estimate and those of his neighbors and then generates a new reward vector 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' estimates reach consensus on the true time-averaged reward vector, and ii) the estimates (and thus the true time-averaged reward vector) 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. © 2012 IFAC.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2012 IFAC. |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 05 Feb 2016 14:13 |
Last Modified: | 11 Mar 2016 00:23 |
Published Version: | http://dx.doi.org/10.3182/20120914-2-US-4030.00011 |
Status: | Published |
Publisher: | IFAC |
Refereed: | Yes |
Identification Number: | 10.3182/20120914-2-US-4030.00011 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:89707 |