Author
Listed:
- Markus Mobius
- Luca Braghieri
- Sarah Eichmeyer
- Daniel G. Goldstein
- Nicole Immorlica
- Oliver Kiss
- Ro'ee Levy
- Brendan Lucier
- Ishan Mahajan
- Jingyi Qiu
- Tanya Rosenblat
- David M. Rothschild
- Andras Sari
- Alexsandrs Slivkins
- Colin Watson
Abstract
We propose a publisher content marketplace that allocates payments for information used in AI-generated answers. The unit of attribution is a ``lego block:'' a distinct fact or piece of commentary that may appear in articles from multiple publishers. A simple news-reading model connects three payment rules: equal sharing among all publishers reporting on a block, rewarding the publisher who reported a block first, and rewarding indispensable contributions. Each can be represented within a Shapley-value framework. We evaluate the framework using answers to 1,974 search-engine queries about a heavily covered news episode. When attribution considers only the articles retrieved for an individual query, most cited blocks appear unique, and the rules produce nearly identical allocations. A global index covering the full news corpus reveals overlap across publishers, making the choice of payment rule consequential. Premium publishers, defined as established outlets with substantial newsgathering operations, receive 42% of allocated value under equal sharing, compared with 46-50% under a first-publication rule, depending on the treatment of publication timestamps. These findings highlight the importance of a shared global index that records which publishers provide each block and when they published it. Attribution restricted to the sources retrieved for an individual answer lacks the information needed to distinguish these payment policies.
Suggested Citation
Markus Mobius & Luca Braghieri & Sarah Eichmeyer & Daniel G. Goldstein & Nicole Immorlica & Oliver Kiss & Ro'ee Levy & Brendan Lucier & Ishan Mahajan & Jingyi Qiu & Tanya Rosenblat & David M. Rothschi, 2026.
"Paying for Information, Not for Clicks: A Block-Level Publisher Content Marketplace for AI Answers,"
Papers
2610.30324, arXiv.org.
Handle:
RePEc:arx:papers:2610.30324
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2610.30324. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.