On finite approximation of a game solution with mixed strategies (Q749460): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0893-9659(90)90054-f / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985931117 / rank
 
Normal rank

Latest revision as of 09:31, 30 July 2024

scientific article
Language Label Description Also known as
English
On finite approximation of a game solution with mixed strategies
scientific article

    Statements

    On finite approximation of a game solution with mixed strategies (English)
    0 references
    0 references
    1990
    0 references
    The possibility of a finite approximation of the value for a general antagonistic game over the product of compact metric spaces \(Q_ 1\) and \(Q_ 2\) of pure strategies with continuous payoff function is studied. It is well known that such a game has a solution in mixed strategies. Let \(A_ 1,A_ 2\) be compact subsets of the sets \(Q_ 1,Q_ 2\) respectively, and denote by \(V(A_ 1,A_ 2)\) the value of the reduced subgame over \(A_ 1\times A_ 2\) with the same payoff function. At first, the continuity of the function V(.,.) with respect to the Hausdorff metric is proved. As a corollary (in the case of \(A_ 1,A_ 2\) being finite approximations in the Hausdorff sense of the sets \(Q_ 1,Q_ 2\) resp.) a positive answer to the problem under consideration is obtained.
    0 references
    0 references
    0 references
    finite approximation of the value
    0 references
    continuous payoff function
    0 references
    0 references