The sequence method for finding solutions to infinite games: A first demonstrating example (Q795757)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The sequence method for finding solutions to infinite games: A first demonstrating example |
scientific article; zbMATH DE number 3862970
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The sequence method for finding solutions to infinite games: A first demonstrating example |
scientific article; zbMATH DE number 3862970 |
Statements
The sequence method for finding solutions to infinite games: A first demonstrating example (English)
0 references
1985
0 references
A noncooperative infinite game can be approached by a sequence of discrete games. For each game in the sequence, a Nash solution can be found as well as their limit. This idea and procedure was used before as a theoretical device to prove existence of solutions to games with continuous payoffs and recently even for a class of games with discontinuous ones [see \textit{P. Dasgupta} and \textit{E. Maskin}, ''The existence of equilibrium in discontinuous economic games, I: Theory'', ICERD Discussion Paper, London (1982)]. No one, however, used the method for the actual solution of a game. Here, an example demonstrates the methods' usefulness in finding a solution to a two-person game on the unit square with discontinuous payoff functions.
0 references
computational procedure
0 references
discrete approximation
0 references
noncooperative infinite game
0 references
sequence of discrete games
0 references
existence of solutions
0 references
two-person game on the unit square
0 references
discontinuous payoff functions
0 references