Allocating objects in a network of caches: centralized and decentralized analyses

DOI10.1287/MNSC.1080.0923MaRDI QIDQ3117773zbMATH OpenOpenAlexFDO

Authors Mohit Tawarmalani, Karthik N. Kannan, Prabuddha De

Publication date 29 February 2012

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b8929e514f8308fc3aa43fe3ea9762fa69545634

zbMATH Keywords

collaborative cache managementgame theorymathematical programmingpeer-to-peer networkresource sharing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) General equilibrium theory (91B50)

Recommendations

• Selfish caching in distributed systems, a game-theoretic analysis
• scientific article; zbMATH DE number 1305451
• Placement algorithms for hierarchical cooperative caching
• Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
• The worst-case efficiency of cost sharing methods in resource allocation games

Cited in

(4)

• An enhanced logarithmic method for signomial programming with discrete variables
• Decentralized task coordination
• Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach
• Selfish caching in distributed systems, a game-theoretic analysis

This page was built for publication: Allocating objects in a network of caches: centralized and decentralized analyses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3117773)