short-paper

On a selfish caching game

Authors:

Pietro Michiardi,

Carla-Fabiana Chiasserini,

Claudio Casetti,

Chi-Anh La,

Marco FioreAuthors Info & Claims

PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing

Pages 284 - 285

https://doi.org/10.1145/1582716.1582767

Published: 10 August 2009 Publication History

Get Access

Abstract

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.

References

[1]

B. G. Chun and K. Chaudhuri and H. Wee and M. Barreno and C.H. Papadimitriou and J. Kubiatowicz, "Selfish caching in distributed systems: a game-theoretic analysis", ACM PODC, 2004.

Digital Library

Google Scholar

[2]

W. L. Tan, F. Lam and W. C. Lau, "An Empirical Study on the Capacity and Performance of 3G Networks", IEEE Transactions on Mobile Computing, 2007

Digital Library

Google Scholar

[3]

P. Gupta and P. R. Kumar, "The Capacity of Wireless Networks," IEEE Transactions on Information Theory, 2000.

Google Scholar

Cited By

View all

Li JLiu WYue K(2012)A game-theoretic approach for balancing the tradeoffs between data availability and query delay in multi-hop cellular networksProceedings of the 9th Annual international conference on Theory and Applications of Models of Computation10.1007/978-3-642-29952-0_46(487-497)Online publication date: 16-May-2012
https://dl.acm.org/doi/10.1007/978-3-642-29952-0_46
La CMichiardi PCasetti CChiasserini CFiore M(2010)A Lightweight Distributed Solution to Content Replication in Mobile Networks2010 IEEE Wireless Communication and Networking Conference10.1109/WCNC.2010.5506349(1-6)Online publication date: Apr-2010
https://doi.org/10.1109/WCNC.2010.5506349
Li JZhou Shi Wei-Yi Liu Kun Yue Rui-Jie Chen (2010)No-regret learning for cost constrained resource selection game2010 Sixth International Conference on Natural Computation10.1109/ICNC.2010.5582356(2921-2925)Online publication date: Aug-2010
https://doi.org/10.1109/ICNC.2010.5582356

Index Terms

On a selfish caching game
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles
        Organizing principles for web applications

Recommendations

Differences between the iterated prisoner's dilemma and the chicken game under noisy conditions
SAC '02: Proceedings of the 2002 ACM symposium on Applied computing

The prisoner's dilemma has evolved into a standard game for analyzing the success of cooperative strategies in repeated games. With the aim of investigating the behavior of strategies in some alternative games we analyzed the outcome of iterated games ...
Prosocial Learning Agents Solve Generalized Stag Hunts Better than Selfish Ones
AAMAS '18: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems

Real world interactions are full of coordination problems [2, 3, 8, 14, 15] and thus constructing agents that can solve them is an important problem for artificial intelligence research. One of the simplest, most heavily studied coordination problems is ...
Adjoining to (K,s,t)-Wythoff’s game its P-generators as moves
Abstract
( K , s , t )-Wythoff’s game is a generalization of the classical ( s , t )-Wythoff’s game, where a player is allowed to remove a multiple of K tokens in each move (K is a fixed positive integer). In this paper, we ...

Comments

Information & Contributors

Information

Published In

PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing

August 2009

356 pages

ISBN:9781605583969

DOI:10.1145/1582716

General Chair:
Srikanta Tirthapura
Iowa State University, USA
,
Program Chair:
Lorenzo Alvisi
The University of Texas at Austin, USA

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 August 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

PODC '09

Sponsor:

PODC '09: ACM Symposium on Principles of Distributed Computing

August 10 - 12, 2009

AB, Calgary, Canada

Acceptance Rates

PODC '09 Paper Acceptance Rate 27 of 110 submissions, 25%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
281
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li JLiu WYue K(2012)A game-theoretic approach for balancing the tradeoffs between data availability and query delay in multi-hop cellular networksProceedings of the 9th Annual international conference on Theory and Applications of Models of Computation10.1007/978-3-642-29952-0_46(487-497)Online publication date: 16-May-2012
https://dl.acm.org/doi/10.1007/978-3-642-29952-0_46
La CMichiardi PCasetti CChiasserini CFiore M(2010)A Lightweight Distributed Solution to Content Replication in Mobile Networks2010 IEEE Wireless Communication and Networking Conference10.1109/WCNC.2010.5506349(1-6)Online publication date: Apr-2010
https://doi.org/10.1109/WCNC.2010.5506349
Li JZhou Shi Wei-Yi Liu Kun Yue Rui-Jie Chen (2010)No-regret learning for cost constrained resource selection game2010 Sixth International Conference on Natural Computation10.1109/ICNC.2010.5582356(2921-2925)Online publication date: Aug-2010
https://doi.org/10.1109/ICNC.2010.5582356

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Differences between the iterated prisoner's dilemma and the chicken game under noisy conditions

Prosocial Learning Agents Solve Generalized Stag Hunts Better than Selfish Ones

Adjoining to (K,s,t)-Wythoff’s game its P-generators as moves

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations