Abstract

A sequential stochastic game among an arbitrary number of players in which all players' payoffs are identical is analyzed. The players are unaware that they are in a game and hence they have no knowledge of other players' strategies or the payoff structure. At each instant the players use a simple learning algorithm to update their mixed strategy choices based entirely on the response of a random environment. It is shown that the expected change in each player's payoff is nonnegative at every instant, so that the group improves its performance monotonically. This result appears to have important implications in decentralized decision-making in large complex systems.

Keywords

Stochastic gameInstantMathematical economicsSimple (philosophy)Computer scienceMonotonic functionRepeated gameSymmetric gameStrategyNon-cooperative gameMathematical optimizationNormal-form gameMathematicsGame theory

Affiliated Institutions

Related Publications

Equilibrium points in <i>n</i> -person games

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 ea...

1950 Proceedings of the National Academy o... 7066 citations

Publication Info

Year
1983
Type
article
Volume
SMC-13
Issue
6
Pages
1154-1158
Citations
22
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

22
OpenAlex

Cite This

Kumpati S. Narendra, Richard M. Wheeler (1983). An N-player sequential stochastic game with identical payoffs. IEEE Transactions on Systems Man and Cybernetics , SMC-13 (6) , 1154-1158. https://doi.org/10.1109/tsmc.1983.6313193

Identifiers

DOI
10.1109/tsmc.1983.6313193