@article{1456,
  author = {Srinivasa K G, Sharath Kumar K, Shashank Kaushik U, Srinidhi S, Vignesh Shenvi, Kushagra Mishra},
  title = {Game Theoretic Resource Allocation in Cloud Computing},
  journal = {Journal of Data Processing},
  year = {2013},
  volume = {3},
  number = {4},
  doi = {},
  url = {http://www.dline.info/jdp/fulltext/v3n4/3.pdf},
  abstract = {Considering the proliferation in the number of cloud users on an everyday basis, the task of resource provisioning in order to support all these users becomes a challenging problem. When resource allocation is non-optimal, users may facehigh costs or performance issues. So, in order to maximize profit and resource utilization while satisfying all client requests, it is essential for Cloud Service Providers to come up with ways to allocate resources adaptively for diverse conditions. This is a constrained optimization problem. Each client that submits a request to the cloud has its own best interests in mind. But each of these clients competes with other clients in the quest to obtain required quantum of resources. Hence, every client is a participant in this competition. So, a preliminary analysis of the problem reveals that it can be modeled as a game between clients. A game theoretic modeling of this problem provides us an ability to find an optimal resource allocation by employing game theoretic concepts. Resource allocation problems are NP-Hard, involving VM allocation and migration within and possibly, among data centers. Owing to the dynamic nature and number of requests, static methods fail to surmount race conditions. Using a Min-Max Game approach, we propose an algorithm that can overcome the problems mentioned. We propose to employ a utility maximization approach to solve the resource provisioning and allocation problem. We implement a new factor into the game called the utility factor which considers the time and budget constraints of every user. Resources are provisioned for tasks having the highest utility for the corresponding resource.},
}