Selfish caching in distributed systems, a game-theoretic analysis
DOI10.1145/1011767.1011771zbMATH Open1321.68068OpenAlexW2102969037MaRDI QIDQ5501481FDOQ5501481
Authors: Byung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno, John D. Kubiatowicz, Christos Papadimitriou 
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011771
Recommendations
- Cache me if you can: capacitated selfish replication games in networks
- Cache me if you can: capacitated selfish replication games
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
- Selfish load balancing and atomic congestion games
- Allocating objects in a network of caches: centralized and decentralized analyses
Other game-theoretic models (91A40) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cited In (9)
- Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks
- Inverse Game Theory: Learning Utilities in Succinct Games
- Dogfish: decentralized optimistic game-theoretic file sharing
- Promoting cooperation in selfish computational grids
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
- Cache me if you can: capacitated selfish replication games in networks
- Mistreatment-resilient distributed caching
- Equilibria in online games
This page was built for publication: Selfish caching in distributed systems, a game-theoretic analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501481)
