Efficient chip strategies in repeated games

DOI10.3982/TE2434zbMath1419.91085OpenAlexW2898482624WikidataQ129048854 ScholiaQ129048854MaRDI QIDQ4612459

Wojciech Olszewski, Mikhail Safronov

Publication date: 31 January 2019

Published in: Theoretical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3982/te2434

zbMATH Keywords

repeated games

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20)

Related Items (2)

Prior‐free dynamic allocation under limited liability ⋮ Efficient cooperation by exchanging favors

Cites Work

• Bid rotation and collusion in repeated auctions.
• Efficient collusion in repeated auctions with communication
• Endogenous bid rotation in repeated auctions
• Efficiency in Games With Markovian Private Information
• Overcoming Incentive Constraints by Linking Decisions
• Collusion With Persistent Cost Shocks
• Repeated Principal-Agent Games with Discounting
• The Folk Theorem with Imperfect Public Information
• Communication with tokens in repeated games on networks
• Truthful Equilibria in Dynamic Bayesian Games
• Collusion and Price Rigidity
• An Efficient Dynamic Mechanism

This page was built for publication: Efficient chip strategies in repeated games