Resilient Source Coding

Abstract : This paper provides a source coding theorem for multi-dimensional information signals when, at a given instant, the distribution associated with one arbitrary component of the signal to be compressed is not known and a side information is available at the destination. This new framework appears to be both of information-theoretical and game-theoretical interest : it provides a new type of constraints to compress an information source; it is useful for designing certain types of mediators in games and characterize utility regions for games with signals. Regarding the latter aspect, we apply the derived source coding theorem to the prisoner's dilemma and the battle of the sexes.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00644102
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, November 23, 2011 - 3:45:01 PM
Last modification on : Thursday, April 5, 2018 - 12:30:04 PM
Long-term archiving on : Friday, February 24, 2012 - 2:30:06 AM

File

25-PID2139511.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00644102, version 1

Citation

Mael Le Treust, Samson Lasaulce. Resilient Source Coding. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Telecom SudParis et Université Paris Descartes, Oct 2011, Paris, France. ⟨hal-00644102⟩

Share

Metrics

Record views

353

Files downloads

112