# Resource Allocation Polytope Games: Uniqueness of Equilibrium, Price of Stability, and Price of Anarchy

## Keywords:

Resource allocation, polytope games, Nash equilibrium, common coupled constraints, price of stability, price of anarchy## Abstract

We consider a two-player resource allocation polytope game, in which the strategy of a player is restricted by the strategy of the other player, with common coupled constraints. With respect to such a game, we formally introduce the notions of independent optimal strategy profile, which is the profile when players play optimally in the absence of the other player; and common contiguous set, which is the set of top nodes in the preference orderings of both the players that are exhaustively invested on in the independent optimal strategy profile. We show that for the game to have a unique PSNE, it is a necessary and sufficient condition that the independent optimal strategies of the players do not conflict, and either the common contiguous set consists of at most one node or all the nodes in the common contiguous set are invested on by only one player in the independent optimal strategy profile. We further derive a socially optimal strategy profile, and show that the price of anarchy cannot be bound by a common universal constant. We hence present an efficient algorithm to compute the price of anarchy and the price of stability, given an instance of the game. Under reasonable conditions, we show that the price of stability is 1. We encounter a paradox in this game that higher budgets may lead to worse outcomes.

## Downloads

## Published

## How to Cite

*Proceedings of the AAAI Conference on Artificial Intelligence*,

*32*(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/11434