Searcharxiv⌕ Search

arXiv · 2610.38088

What Can Firms Do in the Face of Model Distillation?

Abstract

Model distillation has become a major concern in the rapidly growing generative AI discourse. In its simplest form, distillation is the phenomenon where smaller firms can use data distilled from transcripts of conversations with powerful proprietary closed-weight models to train their own models, thus achieving reasonably high model quality but at much lower costs. Besides the legitimate safety and security concerns associated with distillation, another major issue is how it can also distort marketplace outcomes. This motivates us to initiate an exploration of the problem from an economic theory lens. We consider a setting with two players: an incumbent and a distilling competitor and characterize how the incumbent's model characteristics drive the incentives around how much the competitor should distill. We also consider the impact of distillation on key market outcomes like user-side surplus and the incumbent's utility. Our key contribution, however, is to study interventions for preventing or limiting distillation attacks. In this context, we study two settings: i) when it is possible, with a certain probability (which grows in the extent of distillation conducted), to detect an attack on the incumbent's model; and ii) when a distillation attack cannot be reliably detected. In the first setting, we show that penalty-based regulations can be very effective in completely deterring distillation, although it can have potentially adverse effects on market competition and user surplus. In the latter setting, we show that the incumbent can use self-distillation as a mitigation strategy. Importantly, the effectiveness of self-distillation depends on how cost-efficiently the incumbent can deploy a new self-distilled model on the market. On the positive side, self-distillation can preserve market competition thus protecting user surplus to some extent.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Diptangshu Sen, Jibang Wu, Juba Ziani. 2026-10-28. What Can Firms Do in the Face of Model Distillation?. https://arxiv.org/abs/2610.38088

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Project Submission Games in Participatory Budgeting

We introduce the framework of project submission games, capturing the behavior of project proposers in participatory budgeting (and multiwinner elections). Here, each proposer submits a subset of project proposals, aiming at maximizing the total cost of those that get funded. We focus on finding conditions under which pure Nash equilibria (NE) exist in our games, and on the complexity of checking whether they exist. We also seek algorithms for computing best responses for the proposers

cs.GT↗

Domination-Avoiding Learning Agents Cannot Collude

An influential paper of Calvano et al. empirically demonstrated that Q-learning agents spontaneously collude when placed as sellers that compete on prices in a natural market model. More recent results of Fish et al. empirically demonstrated that similar collusion happens with commercial LLMs. We formally prove that such collusion can also happen with external-regret-minimizing agents. We identify a very general class of agents, which we term Domination-Avoiding agents, that provably do not collude in such markets. This class contains all Mean-Based agents and all internal-regret-minimizing agents, as well as others such as Multiplicative-Weight agents with variable learning rate and contextual variants thereof. More generally we show that, in any game, this class of agents is guaranteed to jointly learn to almost never play strategies that are eliminated by repeated elimination of purely dominated strategies.

cs.GT↗

Settling the Complexity of Hylland--Zeckhauser Equilibria

The Hylland--Zeckhauser (HZ) mechanism is a foundational framework for allocating indivisible goods in one-sided matching markets via lotteries supported by competitive prices and equal artificial budgets. We resolve the exact computational complexity of the HZ scheme by proving that computing an exact HZ equilibrium is FIXP-complete, thereby settling a conjecture of Vazirani and Yannakakis. Notably, this hardness persists even when computing the equilibrium allocation alone. We establish our hardness result via a reduction that encodes quadratic fixed-point equations into a reciprocal variational inequality. On the algorithmic side, we present a deterministic polynomial-time approximation algorithm that achieves an additive error of $0.0755211 + δ$ for any $δ> 0$, significantly improving upon the previous $1/e$ guarantee.

cs.GT↗