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.
Type de document :
Communication dans un congrès
Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. IEEE, 2011
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00644102
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 23 novembre 2011 - 15:45:01
Dernière modification le : jeudi 5 avril 2018 - 12:30:04
Document(s) archivé(s) le : vendredi 24 février 2012 - 02:30:06

Fichier

25-PID2139511.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00644102, version 1

Citation

Mael Le Treust, Samson Lasaulce. Resilient Source Coding. Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. IEEE, 2011. 〈hal-00644102〉

Partager

Métriques

Consultations de la notice

330

Téléchargements de fichiers

103