The sequence method for finding solutions to infinite games: A first demonstrating example
type: Item
instance of: scholarly article
title: The sequence method for finding solutions to infinite games: A first demonstrating example
zbMATH Open document ID: 0542.90107
DOI: 10.1007/BF00938764
published in: Journal of Optimization Theory and Applications
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A07
zbMATH DE Number: 3862970
zbMATH Keywords: computational procedure
zbMATH Keywords: discrete approximation
zbMATH Keywords: noncooperative infinite game
zbMATH Keywords: sequence of discrete games
zbMATH Keywords: existence of solutions
zbMATH Keywords: two-person game on the unit square
zbMATH Keywords: discontinuous payoff functions
author: Yuval Shilony
MaRDI profile type: Publication
cites work: Mixed pricing in oligopoly
full work available at URL: https://doi.org/10.1007/bf00938764
OpenAlex ID: W2330354639
description: scientific article; zbMATH DE number 3862970