Reputation-based Persuasion Platforms

05/26/2023
by   Itai Arieli, et al.
0

In this paper, we introduce a two-stage Bayesian persuasion model in which a third-party platform controls the information available to the sender about users' preferences. We aim to characterize the optimal information disclosure policy of the platform, which maximizes average user utility, under the assumption that the sender also follows its own optimal policy. We show that this problem can be reduced to a model of market segmentation, in which probabilities are mapped into valuations. We then introduce a repeated variation of the persuasion platform problem in which myopic users arrive sequentially. In this setting, the platform controls the sender's information about users and maintains a reputation for the sender, punishing it if it fails to act truthfully on a certain subset of signals. We provide a characterization of the optimal platform policy in the reputation-based setting, which is then used to simplify the optimization problem of the platform.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2018

Learning with Abandonment

Consider a platform that wants to learn a personalized policy for each u...
research
02/12/2022

Online Bayesian Recommendation with No Regret

We introduce and study the online Bayesian recommendation problem for a ...
research
05/24/2018

Optimal pricing for a peer-to-peer sharing platform under network externalities

In this paper, we analyse how a peer-to-peer sharing platform should pri...
research
10/14/2022

Continuous-in-time Limit for Bayesian Bandits

This paper revisits the bandit problem in the Bayesian setting. The Baye...
research
08/30/2022

Competition, Alignment, and Equilibria in Digital Marketplaces

Competition between traditional platforms is known to improve user utili...
research
09/16/2023

Improving Section 230, Preserving Democracy and Protecting Free Speech

This article proposes a framework for content moderation based on a dece...
research
02/24/2017

Bayes-Optimal Entropy Pursuit for Active Choice-Based Preference Learning

We analyze the problem of learning a single user's preferences in an act...

Please sign up or login with your details

Forgot password? Click here to reset