<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Alexander Wolitzky | Macro Paper Warehouse</title><link>https://macropaperwarehouse.com/authors/alexander-wolitzky/</link><description>Alexander Wolitzky</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><atom:link href="https://macropaperwarehouse.com/authors/alexander-wolitzky/index.xml" rel="self" type="application/rss+xml"/><item><title>Collusion with Optimal Information Disclosure</title><link>https://macropaperwarehouse.com/papers/collusion-with-optimal-information-disclosure/</link><guid>https://macropaperwarehouse.com/papers/collusion-with-optimal-information-disclosure/</guid><description>&lt;p&gt;This paper asks how a third-party intermediary (an &amp;ldquo;algorithm&amp;rdquo;) that observes market demand or costs superior to competing firms should optimally disclose that information to maximize the firms&amp;rsquo; collusive profit in a repeated Bertrand competition setting. The motivation is the rise of algorithmic pricing intermediaries such as RealPage in apartment rentals, A2i Systems in retail gasoline, and Rainmaker in hotel rooms, as well as offline cartel facilitators like AC-Treuhand.&lt;/p&gt;
&lt;p&gt;The model extends the canonical Rotemberg–Saloner (1986) repeated Bertrand framework with stochastic demand. The key technical assumption is that firm profit is affine in the unknown state s, so expected profit depends only on the expected state. This holds for binary states, linear demand with unknown intercept (D(p,s) = s − p), and linear demand with unknown per-unit cost. The algorithm observes s and commits to a known disclosure policy mapping s to a public signal. The solution concept is pure-strategy subgame-perfect equilibrium, and the paper solves for the disclosure policy and equilibrium that jointly maximize collusive profit.&lt;/p&gt;</description></item></channel></rss>