Publications

Ridge Distributions and Information Design in Simultaneous All-Pay Auction Contests (with Zhonghong Kuang and Jie Zheng). Games and Economic Behavior (2024).

Abstract

Two informed contestants compete in a contest, and the organizer ex-ante designs a public anonymous disclosure policy to maximize contestants’ total effort. We fully characterize ridge distributions, under which the organizer achieves the first best outcome in equilibrium: the allocation is efficient, and the entire surplus goes to the organizer. When the prior is more positively correlated than ridge distributions, the first-best outcome is achievable by the signal that solely generates ridge distributions as posteriors.

Working Papers

Algorithmic Collusion of Pricing and Advertising on E-commerce Platforms (Job Market Paper)

with Ron Berman.

Abstract

Online sellers have been adopting AI learning algorithms to automatically make product pricing and advertising decisions on e-commerce platforms. When sellers compete using such algorithms, one concern is that of tacit collusion—the algorithms learn to coordinate on higher than competitive prices which increase sellers’ profits, but hurt consumers. This concern, however, was raised primarily when sellers use algorithms to decide on prices. We empirically investigate whether these concerns are valid when sellers make pricing and advertising decisions together, i.e., two-dimensional decisions. Our empirical strategy is to analyze competition with multi-agent reinforcement learning, which we calibrate to a large-scale dataset collected from Amazon.com products. Our first contribution is to find conditions under which learning algorithms can facilitate win-win-win outcomes that are beneficial for consumers, sellers, and even the platform, when consumers have high search costs. In these cases the algorithms learn to coordinate on prices that are lower than competitive prices. The intuition is that the algorithms learn to coordinate on lower advertising bids, which lower advertising costs, leading to lower prices for consumers and enlarging the demand on the platform. Our second contribution is an analysis of a large-scale, high-frequency keyword-product dataset for more than 2 million products on Amazon.com. Our estimates of consumer search costs show a wide range of costs for different product keywords. Among these products, more than 50% show evidence that prices are lower when more sellers adopt algorithms to choose their prices and bids. In these product markets, consumers benefit from tacit collusion facilitated by algorithms. We also provide a proof that our results do not depend on the specific reinforcement-learning algorithm that we analyzed. They would generalize to any learning algorithm that uses price and advertising bid exploration. Finally, we analyze the platform’s strategic response through adjusting the ad auction reserve price or the sales commission rate. We find that reserve price adjustments will not increase profits for the platform, but commission adjustments will, while maintaining the beneficial outcomes for both sellers and consumers. Our analyses help alleviate some worries about the potentially harmful effects of competing learning algorithms, and can help sellers, platforms and policymakers to decide on whether to adopt or regulate such algorithms.

Analyzing Healthcare Price Transparency: Will Patients Shop for Services More Effectively?

with Ron Berman. Under Revision

Abstract

Recently, the US mandated healthcare price transparency to facilitate easier comparison of healthcare prices. However, the potential effectiveness of this policy is an open question. We use a large-scale health insurance claims dataset to estimate the potential maximum savings from price transparency. We focus on short-term, demand-side estimates, where patients can shop around and switch to cheaper providers. We analyze the set "shoppable" services whose price information must be reported online. Initially, our data points to a large potential for savings due to a large degree of price dispersion. However, when viewed from the consumer shopping perspective, even the most optimistic estimates of potential savings become limited. The reasons are that the location and insurance network of the patient, the structure of healthcare insurance payments, and the information made available by the transparency rule lower patients’ incentive to save. We find that the best-case scenario for patients’ out-of-pocket savings from price - shopping is 3% of the total cost on average. Our analysis suggests that the existing estimates in the literature might be overestimated, as they overlook the consumer shopping perspective. Hence, patients’ potential savings and the demand-side impact of the transparency rule might not be as impactful as initially hoped for.

Strategic Design of Recommendation Algorithms

with Ron Berman and Yi Zhu. Under Review at Management Science

Abstract

We analyze recommendation algorithms that firms can engineer to strategically provide information to consumers about products with uncertain matches to their tastes. Monopolists who cannot alter prices can design recommendation algorithms to oversell, i.e., that recommend products even if they are not a perfect fit, instead of algorithmically recommending perfectly matching products. However, when prices are endogenous or when competition is rampant, firms opt to reduce their overselling efforts and instead choose to fully reveal the product's match (i.e., maximize recall and precision). As competition strengthens, the algorithms will shift to demarket their products, i.e., under-recommend highly fitting products, in order to soften price competition. When a platform designs a recommendation algorithm for products sold by third-party sellers, we find that demarketing might be a more prevalent strategy of the platform. Additionally, we find that platforms bound by fairness constraints may gain lower profits compared to letting sellers compete, while discriminatory designs do not necessarily result in preferential outcomes for a specific seller.