Accession Number : AD0746553
Title : Constrained n-Person Games.
Descriptive Note : Research rept.,
Corporate Author : TEXAS UNIV AUSTIN CENTER FOR CYBERNETIC STUDIES
Personal Author(s) : Charnes,A. ; Sorensen,S.
Report Date : JAN 1972
Pagination or Media Count : 18
Abstract : The paper is one of a series in which external principles are employed to develop new classes of games and/or notions of solution. Herein extension from two-person games and the study of properties of 'constrained n-person games' is begun. An extremal (linear programming) principle method is developed to calculate the characteristic function for the normal form of such n-person games. Theorems giving the properties of the characteristic function follow immediately from the formulation. The linear programs can include constraints on the strategies of individual players or coalitions. Interestingly, the characteristic function resulting from such a constrained game is not necessarily superadditive. The core-stem (hierarchical) notions and the convex-nucleus notions seem to be the most promising (other standard ones are not applicable) for developing solution notions for such constrained n-person games. (Author)
Descriptors : (*GAME THEORY, LINEAR PROGRAMMING), CONVEX SETS, INEQUALITIES, MATRICES(MATHEMATICS), THEOREMS
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE