On a repeated game with state dependent signalling matrices (Q1072461): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: The Big Match / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitely repeated games of incomplete information: Symmetric case with random signals / 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: Stochastic games / 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: ``Big Match'' with lack of information on one side. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Big match'' with lack of information on one side. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution for a class of repeated games without a recursive structure / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01769311 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072278461 / rank
 
Normal rank

Latest revision as of 10:48, 30 July 2024

scientific article
Language Label Description Also known as
English
On a repeated game with state dependent signalling matrices
scientific article

    Statements

    On a repeated game with state dependent signalling matrices (English)
    0 references
    0 references
    1985
    0 references
    The author considers the case of repeated games with lack of information on both sides, generally not being solved up to now. It is assumed in the paper that there are four possible states of nature described as elements of a product set \(\{0,1\}^ 2\), and a product probability \(\pi\) on it. According to that, a state (\(\mu\),\(\nu)\) is chosen at stage 0, and players I and II are informed about the \(\mu\) and \(\nu\), respectively. Further, according to (\(\mu\),\(\nu)\) there are four \(2\times 2\) payoff matrices \({\mathcal A}(\mu,\nu)\) and four signalling matrices \({\mathcal M}(\mu,\nu)\) (common to the players), all depended on the state. The information the players get after each stage n, \(n=1,2,..\). is the (i,j)- th element \(h_{ij}(\mu,\nu)\) of the matrix \({\mathcal M}(\mu,\nu)\), where i and j are moves players I and II at stage n, respectively, and (\(\mu\),\(\nu)\) is the state of nature choosen at stage 0. As a payoff function the expectation of the Cesaro mean of the payoffs on each stage is defined. The main result of the paper is: for any \(\pi\) the maxmin and the minmax exist in the game. New in the model is the consideration a repeated game with non-symmetric information structure and with signalling matrices depended on the state of nature.
    0 references
    information matrix
    0 references
    incomplete information
    0 references
    repeated games
    0 references
    lack of information on both sides
    0 references
    signalling matrices
    0 references

    Identifiers