A parallel algorithm for non-cooperative resource allocation games
type: Item
instance of: scholarly article
zbMATH Open document ID: 0985.91002
author: I. N. Fokin
author: L. M. Bregman
publication date: 2002-04-09T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 1698890
zbMATH Keywords: noncooperative game
zbMATH Keywords: matrix game
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: resource allocation
MaRDI profile type: Publication
title: A parallel algorithm for non-cooperative resource allocation games
review text: 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].
reviewed by: Milan Mareš
description: scientific article; zbMATH DE number 1698890