How bad is the merger paradox?

DOI10.1016/j.tcs.2023.114157OpenAlexW4386303597MaRDI QIDQ6050129

Yehonatan Mizrahi, Liad Blumrosen

Publication date: 12 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114157

zbMATH Keywords

approximationNash equilibriumCournot oligopolymarket structureindustrial organizationmergers and acquisitions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Efficiency loss in a Cournot oligopoly with convex market demand
• The merger-paradox: a tournament-based solution
• Contributions to Cournot oligopoly theory
• Beyond myopic best response (in Cournot competition)
• Profit loss in Cournot oligopolies
• No Regret Learning in Oligopolies: Cournot vs. Bertrand
• How bad is selfish routing?
• The Limits of Monopolization Through Acquisition
• Algorithms, games, and the internet
• Competition and Efficiency of Coalitions in Cournot Games With Uncertainty
• Price Duopoly and Capacity Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How bad is the merger paradox?