A parallel algorithm for non-cooperative resource allocation games (Q2768009)

The referred paper deals with a generalization of a so-called Blotto game as a noncooperative game with a finite set of players. Each of them owns integer capacity and allocates his resources among a finite set of terrains. The payoffs of the players are additive. The main goal of the paper is to construct a method for finding a Nash equilibrium in such a game. For this purpose a transformation of the game in a special matrix game is used. The method of construction avoids the problem of enormously huge order of such a matrix by operating with vectors of matrices with much smaller size supported by the fact that the rank of the large game matrix is much smaller than its order.NEWLINENEWLINEFor the entire collection see [Zbl 0971.00058].