Your paper timeline
Scroll AI takes the way you would scroll a great paper aggregator: quick signal first, deeper critique when something earns your attention, and challenges when a claim feels off.
2 papers in econ.TH
Trending mixes fresh papers with community signal.
0
econ.THecon.TH Brett Hemenway Falk, Gerry Tsoukalas · Mar 21, 2026

The paper identifies a demand-side externality in AI-driven automation: when firms displace workers, they capture full cost savings but externalize the demand destruction to rivals. In competitive markets, this creates a Prisoner's Dilemma where rational firms over-automate beyond the collective optimum, generating deadweight losses for both workers and owners. The analysis shows that only a Pigouvian tax on automation can correct this failure, while UBI, capital taxes, and worker equity programs cannot.

If AI displaces human workers faster than the economy can reabsorb them, it risks eroding the very consumer demand firms depend on. We show that knowing this is not enough for firms to stop it. In a competitive task-based model, demand externalities trap rational firms in an automation arms race, displacing workers well beyond what is collectively optimal. The resulting loss harms both workers and firm owners. More competition and "better" AI amplify the excess; wage adjustments and free entry cannot eliminate it. Neither can capital income taxes, worker equity participation, universal basic income, upskilling, or Coasian bargaining. Only a Pigouvian automation tax can. The results suggest that policy should address not only the aftermath of AI labor displacement but also the competitive incentives that drive it.
0
cs.LGcs.AIcs.GT Yurong Chen, Zhiyi Huang, Michael I. Jordan et al. · Mar 23, 2026

The paper studies calibeating—post-processing external forecasts online to minimize cumulative losses while matching an informativeness-based benchmark. Unlike prior work that used loss-specific arguments, the authors reduce calibeating to standard online learning primitives, showing it is minimax-equivalent to regret minimization. This yields optimal rates for general proper losses and improves bounds for simultaneous calibration and calibeating.

We study calibeating, the problem of post-processing external forecasts online to minimize cumulative losses and match an informativeness-based benchmark. Unlike prior work, which analyzed calibeating for specific losses with specific arguments, we reduce calibeating to existing online learning techniques and obtain results for general proper losses. More concretely, we first show that calibeating is minimax-equivalent to regret minimization. This recovers the $O(\log T)$ calibeating rate of Foster and Hart [FH23] for the Brier and log losses and its optimality, and yields new optimal calibeating rates for mixable losses and general bounded losses. Second, we prove that multi-calibeating is minimax-equivalent to the combination of calibeating and the classical expert problem. This yields new optimal multi-calibeating rates for mixable losses, including Brier and log losses, and general bounded losses. Finally, we obtain new bounds for achieving calibeating and calibration simultaneously for the Brier loss. For binary predictions, our result gives the first calibrated algorithm that at the same time also achieves the optimal $O(\log T)$ calibeating rate.