Solution for a class of repeated games without a recursive structure (Q794937): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: O. A. Malafeyev / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: O. A. Malafeyev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repeated games with absorbing states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal strategies in repeated games with incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repeated games of incomplete information: The symmetric case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The value of two-person zero-sum repeated games. The extensive case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The value of two-person zero-sum repeated games with lack of information on both sides / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a repeated game without a recursive structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax and maxmin of repeated games with incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general minimax theorems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:09, 14 June 2024

scientific article
Language Label Description Also known as
English
Solution for a class of repeated games without a recursive structure
scientific article

    Statements

    Solution for a class of repeated games without a recursive structure (English)
    0 references
    1983
    0 references
    There are two 2\(\times 2\) payoff matrices from which the referee choses with a probability P the true one before the game begins. Both players do not know this choice, but to every payoff matrix a matrix of signals matches so that at every stage of the game both players receive a signal corresponding to their strategic choices. The referee accumulates player 1's gains in the course of the game but does not inform the players of these gains. They can know the total sum only after the game is finished. A solution of the game is described.
    0 references
    infinitely repeated two-person zero-sum games
    0 references
    information matrices
    0 references
    two- person game
    0 references
    arbitration
    0 references
    chance move
    0 references
    incomplete information
    0 references

    Identifiers