Lehrer, E., Solan, E. and Bauso, D. (2011) Repeated games over networks with vector payoffs: the notion of attainability. In: NetGCoop. 2011 5th International Conference on Network Games, Control and Optimization (NetGCooP), 12-14 Oct 2011, Paris, France. IEEE , 1 - 5. ISBN 978-1-4673-0383-5
Abstract
We introduce the concept of strongly attainable sets of payoffs in two-player repeated games with vector payoffs in continuous time. A set of payoffs is called strongly attainable if player 1 has a strategy guaranteeing, even in the worst case, that the distance between the set and the cumulative payoff shrinks with time to zero. We characterize when any vector is strongly attainable and illustrate the motivation of our study on a multiinventory application.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2011 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:20 |
Last Modified: | 19 Dec 2022 13:32 |
Published Version: | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?... |
Status: | Published |
Publisher: | IEEE |
Refereed: | Yes |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:89725 |