Bounding payoffs in repeated games with private monitoring: \(n\)-player games

DOI10.1016/j.jet.2018.01.007zbMath1422.91093OpenAlexW2793334073MaRDI QIDQ1753681

Takuo Sugaya, Alexander Wolitzky

Publication date: 29 May 2018

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jet.2018.01.007

zbMATH Keywords

repeated gamesconcave gamesrecursive methodsprivate monitoring

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Multistage and repeated games (91A20)

Related Items (1)

Self-rejecting mechanisms

Cites Work

• Unnamed Item
• Unnamed Item
• When is the lowest equilibrium payoff in a repeated game equal to the minmax payoff?
• Public information in Markov games
• Tacit collusion in differentiated Cournot games
• Extremal equlibria of oligopolistic supergames
• Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
• The graph of Prisoners' Dilemma supergame payoffs as a function of the discount factor
• Recursive structure and equilibria in games with private monitoring
• Introduction to repeated games with private monitoring
• Existence of nontrivial equilibria in repeated games with imperfect private monitoring.
• On the microeconomic foundations of linear demand for differentiated products
• Robust Predictions in Games With Incomplete Information
• Multistage Games with Communication
• An Approach to Communication Equilibria
• Optimal Penal Codes in Price-setting Supergames with Capacity Constraints
• On the Theory of Infinitely Repeated Games with Discounting
• On Repeated Games with Complete Information
• Toward a Theory of Discounted Repeated Games with Imperfect Monitoring
• The Folk Theorem with Imperfect Public Information
• Bounding equilibrium payoffs in repeated games with private monitoring
• An Inequality for Rearrangements

This page was built for publication: Bounding payoffs in repeated games with private monitoring: \(n\)-player games