Majorized Bayesian Persuasion and Fair Selection
Siddhartha Banerjee, Kamesh Munagala, Yiheng Shen, Kangning Wang
Abstract
We address the fundamental problem of selection under uncertainty by modeling it from the perspective of Bayesian persuasion. In our model, a decision maker with imperfect information always selects the option with the highest expected value. We seek to achieve fairness among the options by revealing additional information to the decision maker and hence influencing its subsequent selection. To measure fairness, we adopt the notion of majorization, aiming at simultaneously approximately maximizing all symmetric, monotone, concave functions over the utilities of the options. As our main result, we design a novel information revelation policy that achieves a logarithmic-approximation to majorization in polynomial time. On the other hand, no policy, regardless of its running time, can achieve a constant-approximation to majorization. Our work is the first non-trivial majorization result in the Bayesian persuasion literature with multi-dimensional information sets.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on5
- Fairness in Ranking under UncertaintyAshudeep Singh, David Kempe, Thorsten JoachimsNeurIPS 2021 · 62 citations
- Maxmin-Fair Ranking: Individual Fairness under Group-Fairness ConstraintsDavid García-Soriano, Francesco BonchiKDD 2021 · 30 citations
- Algorithmic Price DiscriminationRachel Cummings, Nikhil R. Devanur, Zhiyi Huang, Xiangning WangSODA 2020 · 21 citations
- Stability and Multigroup Fairness in Ranking with Uncertain PredictionsSiddartha Devic, Aleksandra Korolova, David Kempe, Vatsal SharanICML 2024 · 9 citations
- Fair Price DiscriminationSiddhartha Banerjee, Kamesh Munagala, Yiheng Shen, Kangning WangSODA 2024 · 6 citations
Related papers
- Computational Aspects of Bayesian Persuasion under Approximate Best ResponseKunhe Yang, Hanrui ZhangNeurIPS 2024 · 10 citations
- Algorithmic Bayesian Persuasion with Combinatorial ActionsKaito Fujii, Shinsaku SakaueAAAI 2022 · 3 citations
- Bayesian Persuasion for Algorithmic RecourseKeegan Harris, Valerie Chen, Joon Sik Kim, Ameet Talwalkar et al.NeurIPS 2022 · 18 citations
- Multi-Receiver Online Bayesian PersuasionMatteo Castiglioni, Alberto Marchesi, Andrea Celli, Nicola GattiICML 2021 · 36 citations
- Bayesian Persuasion with Externalities: Exploiting Agent TypesJonathan Shaki, Jiarui Gan, Sarit KrausAAAI 2025
