Skip to Main content Skip to Navigation
Conference papers

Repeated games over networks with vector payoffs: the notion of attainability

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-00644397
Contributor : Ist Rennes <>
Submitted on : Thursday, November 24, 2011 - 1:31:20 PM
Last modification on : Tuesday, October 30, 2018 - 5:04:09 PM
Long-term archiving on: : Friday, November 16, 2012 - 11:56:16 AM

File

15-PID2131857-LehrerSolanBauso...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00644397, version 1

Collections

Citation

Ehud Lehrer, Eilon Solan, Dario Bauso. Repeated games over networks with vector payoffs: the notion of attainability. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Telecom SudParis et Université Paris Descartes, Oct 2011, Paris, France. ⟨hal-00644397⟩

Share

Metrics

Record views

88

Files downloads

143