Pages that link to "Item:Q5501481"
From MaRDI portal
The following pages link to Selfish caching in distributed systems (Q5501481):
Displayed 7 items.
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game (Q503156) (← links)
- Promoting cooperation in selfish computational grids (Q1042195) (← links)
- Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← links)
- Equilibria in Online Games (Q2796211) (← links)
- Inverse Game Theory: Learning Utilities in Succinct Games (Q3460806) (← links)
- Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)