mlsanityData to 14 Oct 2026

Pricing Access to Dynamic Information Services

arXiv 2510.09859 ↗First posted 10 Oct 2025econ.TH cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

A provider sells a dynamic information service---a real-time, capacity-constrained process that resolves a customer's uncertainty---to customers who differ privately in urgency. I characterize the revenue-optimal mechanism: deploy a single, undistorted information process---the one a customer with unlimited access would most prefer---and screen entirely through a one-dimensional menu of service caps. The provider leaves the product itself undistorted, unlike a Mussa--Rosen monopolist; all screening is absorbed into the cap. The mechanism rationalizes a recurring contractual form---a flat fee for capped access to a common process---spanning AI service tiers, expert-network consultations, and analyst-inquiry retainers. I identify the economic force behind the result, a convexity-preservation property of urgency screening, and give conditions under which the per-unit price declines in the cap.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 51 references that are in the map. First posted on arXiv 10 Oct 2025.

Builds on

11 of 51 references.

References · 11

  1. 2017Attention Is All You Needcited by 60,361
  2. 2022Training language models to follow instructions with human feedbackcited by 15,971
  3. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  4. 2017Deep reinforcement learning from human preferencescited by 3,912
  5. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  6. 2022Constitutional AI: Harmlessness from AI Feedbackcited by 3,050
  7. 2020Learning to summarize from human feedbackcited by 2,588
  8. 2016Concrete Problems in AI Safetycited by 1,642
  9. 2018Incomplete Contracting and AI Alignmentcited by 62
  10. 2019Dynamically Aggregating Diverse Informationcited by 5
  11. 2018Optimal Dynamic Allocation of Attentioncited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.