PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 15, 2026The Quarterly Journal of Economics1 citations

Collusion with Optimal Information Disclosure

View Full Paper
TSTakuo SugayaWaseda UniversityAWAlexander WolitzkyMassachusetts Institute of Technology

Key Points

  • The study aims to explore how third-party pricing algorithms influence collusion in repeated Bertrand competition.
  • Analyzed repeated Bertrand competition under information disclosure policies.
  • Examined the effects of algorithm accuracy on collusion and consumer surplus.
  • Extended analysis to include product differentiation and capacity constraints.
  • Identified optimal upper censorship disclosure policy leading to price rigidity.
  • Showed that improving algorithm accuracy negatively impacts expected consumer surplus under monopoly pricing.
  • Revealed that algorithms disclose more information when recent demand declines.

Abstract

Abstract Motivated by recent concerns surrounding the use of third-party pricing algorithms by competing firms, we study repeated Bertrand competition where market demand or the cost of serving the market is observed by an intermediary (or “algorithm”) that selectively discloses demand or cost information to maximize firms’ collusive profit. We show that an upper censorship disclosure policy is optimal, which leads to price rigidity and supra-monopoly prices in some states. Improving the algorithm’s accuracy reduces expected consumer surplus whenever it does so under monopoly pricing. When the state is positively correlated over time, the algorithm discloses more information when recent demand was lower or costs were higher. The analysis extends to a generalized model that accommodates product differentiation and capacity constraints. We relate our findings to recent antitrust cases.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Sugaya et al. (2026) studied this question.

synapsesocial.com/papers/69df2c50e4eeef8a2a6b160dhttps://doi.org/10.1093/qje/qjag020
Ask AI
Helpful
Bookmark
Share
View Full Paper