Selfish caching in distributed systems

DOI10.1145/1011767.1011771zbMath1321.68068OpenAlexW2102969037MaRDI QIDQ5501481

Marco Barreno, John D. Kubiatowicz, Kamalika Chaudhuri, Byung-Gon Chun, Hoeteck Wee, Christos H. 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

zbMATH Keywords

distributed systemsNash equilibriacachingprice of anarchygame-theoretic modelspeer-to-peer systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Other game-theoretic models (91A40) Distributed systems (68M14)

Related Items

Inverse Game Theory: Learning Utilities in Succinct Games, 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, Equilibria in Online Games, Cache me if you can: capacitated selfish replication games in networks, Promoting cooperation in selfish computational grids, Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks