Cache Me If You Can: Capacitated Selfish Replication Games
From MaRDI portal
Publication:2894485
DOI10.1007/978-3-642-29344-3_36zbMath1353.68131OpenAlexW65909423MaRDI QIDQ2894485
Rajmohan Rajaraman, Ravi Sundaram, Naga Naresh Karuturi, C. Pandu Rangan, Dimitrios Kanoulas, Ragavendran Gopalakrishnan
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
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Network design and communication in computer systems (68M10) Games involving graphs (91A43)
Related Items
Compliant Control for Walking Robots with the Use of a Virtual Spring-Damper System ⋮ 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 ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks