# A game theoretic approach to a network cloud storage problem

## TL;DR

This paper introduces a game theoretic algorithm for peer-to-peer cloud storage allocation, demonstrating its convergence, efficiency, and scalability through theoretical analysis and extensive simulations.

## Contribution

It presents a novel game theoretic approach for decentralized cloud storage allocation, with proven convergence and practical performance evaluation.

## Key findings

- Algorithm converges to a stable allocation
- Scalable and efficient in large networks
- Produces structured, optimal backup arrangements

## Abstract

The use of game theory in the design and control of large scale networked systems is becoming increasingly more important. In this paper, we follow this approach to efficiently solve a network allocation problem motivated by peer-to- peer cloud storage models as alternatives to classical centralized cloud storage services. To this aim, we propose an allocation algorithm that allows the units to use their neighbors to store a back up of their data. We prove convergence, characterize the final allocation, and corroborate our analysis with extensive numerical simulation that shows the good performance of the algorithm in terms of scalability, complexity and structure of the solution.