Selfish caching in distributed systems, a game-theoretic analysis
From MaRDI portal
Publication:5501481
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
Cited in
(12)- A game-theoretic approach for balancing the tradeoffs between data availability and query delay in multi-hop cellular networks
- Cache me if you can: capacitated selfish replication games
- Allocating objects in a network of caches: centralized and decentralized analyses
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- 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
- Inverse game theory: learning utilities in succinct 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)