AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Multi-Receiver Online Bayesian Persuasion

ICML 2021 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 6 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use OGD-APO with an approximate projection oracle for submodular sender utilitiesMulti-receiver online Bayesian persuasion · Adversarial sequence of receiver type profiles(1 - 1/e)-regret: R^T_{1-\frac{1}{e}} \leq O \left( \sqrt{T} \, |\mathcal{K}^T| \right)Helped
Use a matroid-based approximate separation oracle for submodular sender utilitiesOffline and online multi-receiver Bayesian persuasion · Submodular sender utilityapproximation factor: 1-\frac{1}{e}Helped
Require polynomial-time no-α-regret for supermodular sender utilitiesMulti-receiver online Bayesian persuasion · Supermodular sender utilitypolynomial-time no-α-regret algorithm existence: 0 < \alpha \leq 1Hurt
Require polynomial-time no-α-regret for anonymous sender utilitiesMulti-receiver online Bayesian persuasion · Anonymous sender utilitypolynomial-time no-α-regret algorithm existence: 0 < \alpha \leq 1Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy