Metraipolis › archive › dc_e6ebf52026fc

Cold-Start Pricing of LLM Services under Two-Sided Learning — arXiv:2611.03199

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03199
License (as archived)
CC0-1.0
Archived
2026-11-03T18:28:52.155Z
SHA-256 of the archived text
fbc976ffaf264ea82bdef239d1b4904351e6df466fa06b54eb7b08a972981b0b
Stable URL of this page
https://metraipolis.com/documento/dc_e6ebf52026fc

How to cite

Cold-Start Pricing of LLM Services under Two-Sided Learning — arXiv:2611.03199 — arXiv (en), https://arxiv.org/abs/2611.03199 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e6ebf52026fc (Metraipolis archive dc_e6ebf52026fc, sha256 fbc976ffaf264ea82bdef239d1b4904351e6df466fa06b54eb7b08a972981b0b)
BibTeX
@misc{dce6ebf52026fc,
  title = {Cold-Start Pricing of LLM Services under Two-Sided Learning — arXiv:2611.03199},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03199},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e6ebf52026fc; sha256 fbc976ffaf264ea82bdef239d1b4904351e6df466fa06b54eb7b08a972981b0b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03199. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Online large language model (LLM) services face a pricing cold start: providers initially lack the historical data and user information needed for precise pricing, while users' willingness to pay evolves with repeated use. We formulate this challenge as a \emph{two-sided learning} problem between a provider and a user. The user learns from private usage experience, whereas the provider incurs a serving cost and dynamically adapts prices using only purchase decisions to maximize cumulative profit. The provider's central challenge is to learn to price against an evolving willingness to pay without observing the private experiences driving that evolution. We establish matching upper and lower bounds on the minimax regret over horizon $T$, identifying two cost-dependent regimes. When serving costs are sufficiently low, our Calibration-and-Tracking (CAT) algorithm achieves the optimal rate $\Theta(T^{1/3})$. In the higher-cost regime, where the provider must learn whether continued service is profitable, Calibration-and-Tracking with Retirement (CAT-R) attains the optimal rate $\Theta(\sqrt{T})$. This phase transition shows that serving costs affect not only profit margins but also the fundamental difficulty of learning to price LLM services. Simulations support the predicted regret scaling and show that our algorithms outperform standard online learning baselines in the evaluated settings.

Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno).
Categorie arXiv: Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2611.03199 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:11:22.759Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).