Decentralized Edge Caching under Budget and Storage Constraints: A Game-Theoretic Approach
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918485092728832 |
|---|---|
| author | Sedghani, Hamta Seyedi, Zahra Passacantando, Mauro Ardagna, Danilo |
| author_facet | Sedghani, Hamta Seyedi, Zahra Passacantando, Mauro Ardagna, Danilo |
| contents | The rapid growth of mobile social networks (MSNs) has significantly increased the demand for low-latency and reliable content delivery, motivating the deployment of edge caching systems. In practice, multiple content providers (CPs) compete for the limited storage resources of edge devices (EDs), while facing heterogeneous budgets and operational costs. This paper investigates a decentralized multi-CP edge caching framework that jointly accounts for CP budget constraints, ED storage limitations, and strategic interactions among all entities. We formulate the interaction between CPs and EDs as a hierarchical game, combining a Stackelberg model for CP-ED interactions with a non-cooperative game among competing CPs. Under light storage constraints, we show that CP competition constitutes an exact potential game, ensuring the existence of a pure-strategy Nash equilibrium and enabling decentralized convergence. When storage constraints are binding, the resulting game loses this structure; nevertheless, extensive simulations demonstrate stable and efficient convergence in practice. Through a comprehensive numerical evaluation, we show that convergence behavior is primarily driven by CP competition rather than the scale of edge infrastructure. We further reveal that storage scarcity fundamentally alters economic outcomes, amplifying inequality among CPs while increasing the relative bargaining power of EDs. The proposed framework provides a scalable and economically grounded solution for decentralized resource allocation in multi-provider edge caching systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_04023 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Decentralized Edge Caching under Budget and Storage Constraints: A Game-Theoretic Approach Sedghani, Hamta Seyedi, Zahra Passacantando, Mauro Ardagna, Danilo Computer Science and Game Theory Performance The rapid growth of mobile social networks (MSNs) has significantly increased the demand for low-latency and reliable content delivery, motivating the deployment of edge caching systems. In practice, multiple content providers (CPs) compete for the limited storage resources of edge devices (EDs), while facing heterogeneous budgets and operational costs. This paper investigates a decentralized multi-CP edge caching framework that jointly accounts for CP budget constraints, ED storage limitations, and strategic interactions among all entities. We formulate the interaction between CPs and EDs as a hierarchical game, combining a Stackelberg model for CP-ED interactions with a non-cooperative game among competing CPs. Under light storage constraints, we show that CP competition constitutes an exact potential game, ensuring the existence of a pure-strategy Nash equilibrium and enabling decentralized convergence. When storage constraints are binding, the resulting game loses this structure; nevertheless, extensive simulations demonstrate stable and efficient convergence in practice. Through a comprehensive numerical evaluation, we show that convergence behavior is primarily driven by CP competition rather than the scale of edge infrastructure. We further reveal that storage scarcity fundamentally alters economic outcomes, amplifying inequality among CPs while increasing the relative bargaining power of EDs. The proposed framework provides a scalable and economically grounded solution for decentralized resource allocation in multi-provider edge caching systems. |
| title | Decentralized Edge Caching under Budget and Storage Constraints: A Game-Theoretic Approach |
| topic | Computer Science and Game Theory Performance |
| url | https://arxiv.org/abs/2605.04023 |