Learning to Design Information

Ce Li and Tao Lin

Papers from arXiv.org

Abstract: Information designers, such as large language models and online platforms, often do not know the subjective beliefs of their receivers or users. We construct learning algorithms enabling the designer to learn the belief of a strategic receiver through repeated interactions. Our learning algorithms are robust to the receiver's strategic manipulation of the learning process of the designer. We study regret relative to two benchmarks to measure the performance of the algorithms. The static benchmark is $T$ times the single-period optimum for the designer under a known belief. The dynamic benchmark, which is stronger, characterizes global dynamic optimality for the designer under a known belief. Our learning algorithms allow the designer to achieve no regret against both benchmarks at fast convergence speeds of $O(\frac{\log^2 T}{T})$, significantly faster than other approaches in the literature.

Date: 2026-11
References: Add references at CitEc
Citations:

Downloads: (external link)
https://arxiv.org/pdf/2611.05701 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2611.05701

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().