Graduate School and Research Center in Digital Sciences

On a selfish caching game

Michiardi, Pietro; Chiasserini, Carla-Fabiana; Casetti, Claudio; La, Chi Anh; Fiore, Marco

PODC 2009, 28th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, August 10-12, 2009, Calgary, Canada

In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast the caching problem as an anti-coordination game. We start by defining the social optimum in the general case and then focus on a two-player game to obtain insights into the design of efficient caching strategies. Based the theoretical findings, our current work focuses on the development of strategies to be implemented in a practical network setting.

Document Doi Bibtex

Title:On a selfish caching game
Keywords:Algorithms, Design, Economics
Type:Conference
Language:English
City:Calgary
Country:CANADA
Date:
Department:Data Science
Eurecom ref:2759
Copyright: © ACM, 2009. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in PODC 2009, 28th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, August 10-12, 2009, Calgary, Canada http://dx.doi.org/10.1145/1582716.1582767
Bibtex: @inproceedings{EURECOM+2759, doi = {http://dx.doi.org/10.1145/1582716.1582767}, year = {2009}, title = {{O}n a selfish caching game}, author = {{M}ichiardi, {P}ietro and {C}hiasserini, {C}arla-{F}abiana and {C}asetti, {C}laudio and {L}a, {C}hi {A}nh and {F}iore, {M}arco}, booktitle = {{PODC} 2009, 28th {A}nnual {ACM} {SIGACT}-{SIGOPS} {S}ymposium on {P}rinciples of {D}istributed {C}omputing, {A}ugust 10-12, 2009, {C}algary, {C}anada}, address = {{C}algary, {CANADA}}, month = {08}, url = {http://www.eurecom.fr/publication/2759} }
See also: