Resilient Source Coding - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Resilient Source Coding

Mael Le Treust
Samson Lasaulce

Résumé

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.
Fichier principal
Vignette du fichier
25-PID2139511.pdf (584.84 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00644102 , version 1 (23-11-2011)

Identifiants

  • HAL Id : hal-00644102 , version 1

Citer

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⟩
135 Consultations
49 Téléchargements

Partager

Gmail Facebook X LinkedIn More