Bauso, D. and Reddy, P.V. (2010) Learning for allocations in the long-run average core of dynamical cooperative TU Games. In: 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. Forty-Eighth Annual Allerton Conference, September 29 - October 1, 2010, Illinois, USA. , 1165 - 1170. ISBN 9781424482146
Abstract
We consider repeated coalitional TU games characterized by unknown but bounded and time-varying coalitions' values. We build upon the assumption that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to learn on how to re-adjust the allocations among the players. As main result, we present an allocation rule based on the extra reward variable that converges with probability one to the core of the long-run average game. Analogies with stochastic stability theory are put in evidence. ©2010 IEEE.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2010 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission. |
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: | 29 Jan 2016 10:27 |
Last Modified: | 29 Jan 2016 10:34 |
Published Version: | http://dx.doi.org/10.1109/ALLERTON.2010.5707043 |
Status: | Published |
Refereed: | Yes |
Identification Number: | 10.1109/ALLERTON.2010.5707043 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:89730 |