Information Design with Unknown Prior
Ce Li and
Tao Lin
Papers from arXiv.org
Abstract:
Information designers, such as online platforms, often do not know the beliefs of their receivers. We design learning algorithms so that the information designer can learn the receivers' prior belief from their actions through repeated interactions. Our learning algorithms achieve no regret relative to the optimality for the known prior at a fast speed, achieving a tight regret bound $\Theta(\log T)$ in general and a tight regret bound $\Theta(\log \log T)$ in the important special case of binary actions.
Date: 2024-10, Revised 2025-09
New Economics Papers: this item is included in nep-des, nep-gth and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://arxiv.org/pdf/2410.05533 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:2410.05533
Access Statistics for this paper
More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().