On equilibria in finite games

We are concerned with Nash equilibrium points forn-person games. It is proved that, given any real algebraic numberα, there exists a 3-person game with rational data which has a unique equilibrium point andα is the equilibrium payoff for some player. We also present a method which allows us to reduce an arbitraryn-person game to a 3-person one, so that a number of questions about generaln-person games can be reduced to consideration of the special 3-person case. Finally, a completely mixed game, where the equilibrium set is a manifold of dimension one, is constructed.     

Games with Ordered Outcomes

We present a brief review of the most important concepts and results concerning games in which the goal structure is formalized by binary relations called preference relations. The main part of the work is devoted to games with ordered outcomes, i.e., game-theoretic models in which preference relations of players are given by partial orders on the set of outcomes. We discuss both antagonistic games and n-person games with ordered outcomes. Optimal solutions in games with ordered outcomes are strategies of players, situations, or outcomes of the game. In the paper, we consider noncooperative and certain cooperative solutions. Special attention is paid to an extension of the order on the set of probabilistic measures since this question is substantial for constructing the mixed extension of the game with ordered outcomes. The review covers works published from 1953 until now.     

Conflict dissolution by reframing game payoffs using linear perturbations

Human beings have a prevailing drive to achieve their self-interest goals or equilibrium states, which may subsume their social interests. An ideal working environment or cooperative game situation would be one in which each participant or player maximizes his/her own interest while maximizing his/her contribution to the collective group interest. This paper addresses the feasibility, methods, and bounds for reframing a generaln-person game into an ideal game in which full cooperation or a targeted solution can be induced and maintained by the players' self-interest maximization. Criteria for good reframing are introduced. Monotonic games, self-interest cooperative and noncooperative games, and a decomposition theory of general games are also introduced to facilitate the study. It is shown that everyn-person game can be written as the sum of a self-interest cooperative game and a self-interest noncooperative game. Everyn-person game can be reframed so that full cooperation can be achieved by the players' self-interest maximization. Everyn-person game can be reframed so that a targeted solution can be obtained and maintained through the players' self-interest maximization.     

On implementation via demand commitment games

A simple version of the Demand Commitment Game is shown to implement the Shapley value as the unique subgame perfect equilibrium outcome for any n-person characteristic function game. This improves upon previous models devoted to this implementation problem in terms of one or more of the following: a) the range of characteristic function games addressed, b) the simplicity of the underlying noncooperative game (it is a finite horizon game where individuals make demands and form coalitions rather than make comprehensive allocation proposals and c) the general acceptability of the noncooperative equilibrium concept. A complete characterization of an equilibrium strategy generating the Shapley value outcomes is provided. Furthermore, for 3 player games, it is shown that the Demand Commitment Game can implement the core for games which need not be convex but have cores with nonempty interiors. Received March 1995/Final version February 1997     

Solution concepts ofk-convexn-person games

For any positive integersk andn, the subclass ofk-convexn-person games is considered. In casek=n, we are dealing with convexn-person games. Three characterizations ofk-convexn-person games, formulated in terms of the core and certain adapted marginal worth vectors, are given. Further it is shown that fork-convexn-person games the intersection of the (pre)kernel with the core consists of a unique point (namely the nucleolus), but that the (pre)kernel may contain points outside the core. For certain 1-convex and 2-convexn-person games the part of the bargaining set outside the core is even disconnected with the core. The Shapley value of ank-convexn-person game can be expressed in terms of the extreme points of the core and a correction-vector whenever the game satisfies a certain symmetric condition. Finally, theτ-value of ank-convexn-person game is given.     

N-person Nim andn-person Moore's Games

We present one way of definingn-person perfect information games so that there is a reasonable outcome for every game. In particular, the theory of Nim and Moore's games is generalized ton-person games.     

Characterizations ofk-Convex Games

The paper deals with the class of k-convex n-person transferable utility games which has clear affinities to the well-known class of convex n-person TU-games. Five new characterizations of a k-convex n-person game are presented in terms of the following key notions:(1) the unanimity coordinates, as determined by the algebraic representation of the game with respect to the particular basis consisting of all n-person unanimity games; (2) the second order partial derivatives of Owen's multilinear extension of the game; (3) the coremembership of the adjusted marginal worth vectors of the game (taking into account even or odd orderings of players); (4) a min-modular decomposition of an appropriately chosen cover-game (the decomposition of which is based on the adjusted marginal worth vectors of the initial game); (5) the concavity of the Lovász extension of the associated cover-game     

The simplified modified nucleolus of a cooperative TU-game

In the present paper, we introduce a new solution concept for TU-games, the simplified modified nucleolus or the SM-nucleolus. It is based on the idea of the modified nucleolus (the modiclus) and takes into account both the constructive power and the blocking power of a coalition. The SM-nucleolus inherits this convenient property from the modified nucleolus, but it avoids its high computational complexity. We prove that the SM-nucleolus of an arbitrary n-person TU-game coincides with the prenucleolus of a certain n-person constant-sum game, which is constructed as the average of the game and its dual. Some properties of the new solution are discussed. We show that the SM-nucleolus coincides with the Shapley value for three-person games. However, this does not hold for general n-person cooperative TU-games. To confirm this fact, a counter example is presented in the paper. On top of this, we give several examples that illustrate similarities and differences between the SM-nucleolus and well-known solution concepts for TU-games. Finally, the SM-nucleolus is applied to the weighted voting games.     

拟凸对策的解

本文先引入拟凸对策的概念作为凸对策的推广,然后研究这种对策的各种解的性质。我们主要证得,当局中人数小于6或者对策的复盖严格凸时,谈判集与核心重合,核是单点集。另外,存在一个6人拟凸对策,其谈判集与核心不同。     

Homogeneous games as anti step functions

In this paper the class of homogeneousn-person games “without dummies and steps” is characterized by two algebraic axioms. Each of these games induces a natural vector of lengthn, called incidence vector of the game, and vice versa. A geometrical interpretation of incidence vectors allows to construct all of these games and to enumerate them recursively with respect to the number of persons. In addition an algorithm is defined, which maps each directed game to a minimal representation of a homogeneous game. Moreover both games coincide, if the initial game is homogeneous.     

Minimarg and maximarg operators

Two operators on the set ofn-person cooperative games are introduced, the minimarg operator and the maximarg operator. These operators can be seen as dual to each other. Some nice properties of these operators are given, and classes of games for which these operators yield convex (respectively, concave) games are considered. It is shown that, if these operators are applied iteratively on a game, in the limit one will yield a convex game and the other a concave game, and these two games will be dual to each other. Furthermore, it is proved that the convex games are precisely the fixed points of the minimarg operator and that the concave games are precisely the fixed points of the maximarg operator.     

Common behaviour of power indices

The variations ensuing in a weighted majority game are studied when a player increases his weight in prejudice of others or decreases in favor, or trades shares outside the game (in particular when an-person game becomes an (n+1)-person one). An invariant behaviour for different game values is found for all these cases. Possible applications to politics, shareholdings and large games are pointed out.     

Cone Concavity and Multiple-Payoff Constrained n-Person Games

This paper investigates special cases of abstract economies, i.e., n-person games with multiple payoff functions. Dominances with certain convex cones and interactive strategies are introduced in such game settings. Gradients of payoff functions are involved to establish certain Lagrange or Kuhn–Tucker conditions which may lead to some algorithms to actually compute an equilibrium. Sufficient and necessary conditions for such multiple payoff constrained n-person games are obtained.     

<Emphasis Type="Italic">n</Emphasis>-Person Second-Order Games: A Paradigm Shift in Game Theory

In this paper, we present a new approach to n-person games based on the Habitual domain theory. Unlike the traditional game theory models, the constructed model captures the fact that the underlying changes in the psychological aspects and mind states of the players over the arriving events are the key factors, which determine the dynamic process of coalition formation. We introduce two new concepts of solution for games: strategically stable mind profile and structurally stable mind profile. The theory introduced in this paper overcomes the dichotomy of non-cooperative/cooperative games, prevailing in the existing game theory, which makes game theory more applicable to real-world game situations.     

On coalition formation: a game-theoretical approach

This paper deals with the question of coalition formation inn-person cooperative games. Two abstract game models of coalition formation are proposed. We then study the core and the dynamic solution of these abstract games. These models assume that there is a rule governing the allocation of payoffs to each player in each coalition structure called a payoff solution concept. The predictions of these models are characterized for the special case of games with side payments using various payoff solution concepts such as the individually rational payoffs, the core, the Shapley value and the bargaining set M₁ ⁽ⁱ⁾. Some modifications of these models are also discussed.     

Some interesting properties of maximin strategies

Since the seminal paper of Nash (1950) game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in non-zero-sum strategic games that possess (completely) mixed Nash equilibria. We find that under certain conditions maximin strategies have several interesting properties, some of which extend beyond 2-person strategic games. In particular, for n-person games we specify necessary and sufficient conditions for maximin strategies to yield the same expected payoffs as Nash equilibrium strategies. We also show how maximin strategies may facilitate payoff comparison across Nash equilibria as well as refine some Nash equilibrium strategies.     

Harsanyi power solutions for graph-restricted games

We consider cooperative transferable utility games, or simply TU-games, with limited communication structure in which players can cooperate if and only if they are connected in the communication graph. Solutions for such graph games can be obtained by applying standard solutions to a modified or restricted game that takes account of the cooperation restrictions. We discuss Harsanyi solutions which distribute dividends such that the dividend shares of players in a coalition are based on power measures for nodes in corresponding communication graphs. We provide axiomatic characterizations of the Harsanyi power solutions on the class of cycle-free graph games and on the class of all graph games. Special attention is given to the Harsanyi degree solution which equals the Shapley value on the class of complete graph games and equals the position value on the class of cycle-free graph games. The Myerson value is the Harsanyi power solution that is based on the equal power measure. Finally, various applications are discussed.     

A note on polymatrix games

This work is concerned with the class ofn-person games called polymatrix games (Yanovskaya (1968)). The structure of the set of Nash equilibrium points in a polymatrix game is studied and characterizations of these games are given.     

Constrainedn-person games

The usual properties of a characteristic function game were derived byvon Neumann andMorgenstern from the properties of a game in normal form. In this paper we give a linear programming principle for the calculation of the characteristic function. The principle is a direct application ofCharnes' linear programming method for the calculation of the optimal strategies and the value of a two-person zero-sum game. The linear programming principle gives another method for proving the standard properties of a characteristic function when it is derived from a game in normal form. Using an idea originated byCharnes for two person games, we develop the concept of a constrainedn-person game as a simple, practical extension of ann-person game. However the characteristic function for a constrainedn-person game may not satisfy properties, such as superadditivity, usually associated with a characteristic function.     

Switching surfaces inN-person differential games

Switching surfaces inN-person differential games are essentially similar to those encountered in optimal control and two-person, zero-sum differential games. The differences between the Nash noncooperative solution and the saddle-point solution are reflected in the dispersal surfaces. These are discussed through classification and construction procedures for switching surfaces. A simple example of a two-person, nonzero-sum game is considered. A complete solution of this game will be presented in a companion paper (Ref. 1).