On the theory of repeated games with private information. II: Revelation through communication (Q810389): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal cartel equilibria with imperfect monitoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency in repeated games with imperfect monitoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Example of a Repeated Partnership Game with Discounting and with Uniformly Inefficient Equilibria / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:09, 24 June 2024

scientific article
Language Label Description Also known as
English
On the theory of repeated games with private information. II: Revelation through communication
scientific article

    Statements

    On the theory of repeated games with private information. II: Revelation through communication (English)
    0 references
    0 references
    1991
    0 references
    We consider repeated games with private information and with discounting, where we allow players to communicate, i.e., to give messages strategically. Similarly to \textit{D. Abreu}, \textit{D. Pearce} and \textit{E. Stacchetti} [J. Econ. Theory 39, 251-269 (1986; Zbl 0606.90019); Econometrica 58, No.5, 1041-1063 (1990; Zbl 0735.90086)], we can characterize supergame-equilibrium allocations with truthful revelation. In the two-player case, efficiency cannot be attained with supergame equilibria with truthful revelation.
    0 references
    repeated games with private information
    0 references
    discounting
    0 references
    supergame equilibria with truthful revelation
    0 references

    Identifiers