Equilibrium Points in N-Person Games.

@article{Nash1950EquilibriumPI,
  title={Equilibrium Points in N-Person Games.},
  author={John F. Nash},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  year={1950},
  volume={36 1},
  pages={
          48-9
        }
}
  • J. Nash
  • Published 1950
  • Economics
  • Proceedings of the National Academy of Sciences of the United States of America
One may define a concept of an n -person game in which each player has a finite set of pure strategies and in which a definite set of payments to the n players corresponds to each n -tuple of pure strategies, one strategy being taken for each player. For mixed strategies, which are probability distributions over the pure strategies, the pay-off functions are the expectations of the players, thus becoming polylinear forms … 

Existence of Nash equilibrium for chance-constrained games

An ε-equilibrium point in an n-person game with constraints

Abstract In this paper, an e-noncooperative equilibrium point with e ≥0 in a constrained n-person game is investigated. We show that there exists an e-equilibrium point in the n-person game if and

Non-Cooperative Games with Many Players

In this survey article, we report results on the existence of pure-strategy Nash equilibria in games with an atomless continuum of players, each with an action set that is not necessarily finite. We

Stay-in-a-set games

TLDR
There exists a Nash equilibrium for every n-person stochastic game with a finite state space and finite action sets for the players if the payoff to each player i is one when the process of states remains in a given set of states and is zero otherwise.

Dynamic Selection in Normal-Form Games

TLDR
This paper investigates a class of dynamic selection processes for n-person normal-form games which includes the Brown-von Neumann-Nash dynamics, and finds that under these dynamics the unique Nash-component of a zero-sum game is minimal asymptotically stable.

General sum games with joint chance constraints

AN ALGORITHM FOR DETERMINING A CLASS OF TWO-PERSON GAMES HAVING A PURE-STRATEGY NASH EQUILIBRIUM

Sato and Kawasaki (Preprint) introduced a class of n-person games called partially monotone games, and showed that any partially monotone game has a purestrategy Nash equilibrium. Further, they

Nash Equilibria of 2-Player Finite Simultaneous Move Games

By the theory of measure and linear algebra, this paper shows that the following property holds for almost all 2-player finite simultaneous games: for any Nash equilibrium, the numbers of pure

HYBRID EQUILIBRIUM IN N-PERSON GAMES

. How can we combine altruism of Berge equilibrium with selfishness of Nash equilibrium? The positive answer to this question will be given below. In short, they can be combined but in the class of
...

References

SHOWING 1-3 OF 3 REFERENCES

Some Relations Between Homology and Homotopy Groups

CONTENTS INTRODUCTION. CHAPTER I. MAIN CONCEPTS AND RESULTS. PAGE 1. Set systems 429 2. Group systems 430 3. The complex S(s) 430 4. The complex K(W) 432 5. The chain transformation K 433 6. The main