Premium
Localization of optimal strategies in certain games
Author(s) -
Benjamin Arthur T.,
Goldman A. J.
Publication year - 1994
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199408)41:5<669::aid-nav3220410508>3.0.co;2-b
Subject(s) - mathematical economics , computer science , normal form game , sequential game , strategy , mathematical optimization , matrix (chemical analysis) , game theory , index (typography) , repeated game , mathematics , world wide web , materials science , composite material
Assume the payoffs of a matrix game are concave in the index of the maximizing player. That player is shown to have an optimal strategy which uses at most two consecutive pure strategies, identifiable through approximate solution of a related continuous game. Generalizations are given, and the results are applied to a motivating hidden‐target model due to Shapley. © 1994 John Wiley & Sons, Inc.