Cache me if you can: capacitated selfish replication games

DOI10.1007/978-3-642-29344-3_36MaRDI QIDQ2894485zbMATH OpenOpenAlexFDO

Authors Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram

Publication date 29 June 2012

Published in LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29344-3_36

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43) Network design and communication in computer systems (68M10)

Recommendations

• Cache me if you can: capacitated selfish replication games in networks
• Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
• Selfish caching in distributed systems, a game-theoretic analysis
• Near-optimal network design with selfish agents
• Near-optimal network design with selfish agents

Cited in

(7)

• Selfish caching in distributed systems, a game-theoretic analysis
• Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
• Compliant control for walking robots with the use of a virtual spring-damper system
• A Caching Game with Infinitely Divisible Hidden Material
• All or Nothing Caching Games with Bounded Queries
• 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

This page was built for publication: Cache me if you can: capacitated selfish replication games

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