Algorithms for Persuasion with Limited Communication

References

• [1] Alizamir S, de Véricourt F, Wang S (2020) Warning against recurring risks: An information design approach. Management Sci. 66(10): 4612–4629.Link, Google Scholar
• [2] Alonso R, Câmara O (2016) Persuading voters. Amer. Econom. Rev. 106(11):3590–3605.Crossref, Google Scholar
• [3] Anunrojwong J, Iyer K, Manshadi V (2020) Information design for congested social services: Optimal need-based persuasion. Preprint, submitted May 14, https://arxiv.org/abs/2005.07253.Google Scholar
• [4] Arieli I, Babichenko Y (2019) Private Bayesian persuasion. J. Econom. Theory 182:185–217.Crossref, Google Scholar
• [5] Au PH, Kawai K (2020) Competitive information disclosure by multiple senders. Games Econom. Behav. 119:56–78.Crossref, Google Scholar
• [6] Aumann R, Maschler M (1966) Game theoretic aspects of gradual disarmament. Report 80, U.S. Arms Control and Disarmament Agency, Washington, DC, 1–55.Google Scholar
• [7] Aybas Y, Turkel E (2019) Persuasion with limited signal spaces. Preprint, submitted October 29, https://arxiv.org/abs/1910.13547.Google Scholar
• [8] Babichenko Y, Barman S (2017) Algorithmic aspects of private Bayesian persuasion. Proc. Eighth Sympos. Innovations Theoret. Comput. Sci. (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 34:1–34:16.Google Scholar
• [9] Badanidiyuru A, Bhawalkar K, Xu H (2018) Targeting and signaling in ad auctions. Czumaj A, ed. Proc. 29th ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 2545–2563.Google Scholar
• [10] Bahar G, Smorodinsky R, Tennenholtz M (2016) Economic recommendation systems: One page abstract. Conitzer V, Bergemann D, Chen Y, eds. Proc. 17th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 757.Google Scholar
• [11] Bergemann D, Morris S (2019) Information design: A unified perspective. J. Econom. Lit. 57(1):44–95.Crossref, Google Scholar
• [12] Bhaskar U, Cheng Y, Ko YK, Swamy C (2016) Hardness results for signaling in Bayesian zero-sum and network routing games. Conitzer V, Bergemann D, Chen Y, eds. Proc. 17th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 479–496.Google Scholar
• [13] Candogan O (2019) Persuasion in networks: Public signals and k-cores. Tardos É, Elkind E, Vohra R, eds. Proc. 20th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 133–134.Google Scholar
• [14] Candogan O (2020) Information design in operations. Pushing the Boundaries: Frontiers in Impactful OR/OM Research. Druehl C, Elmaghraby W, eds. TutORials in Operations Research (INFORMS, Catonsville, MD), 176–201.Google Scholar
• [15] Candogan O, Drakopoulos K (2020) Optimal signaling of content accuracy: Engagement vs. misinformation. Oper. Res. 68(2):497–515.Abstract, Google Scholar
• [16] de Véricourt F, Gurkan H, Wang S (2021) Informing the public about a pandemic. Management Sci. 67(10):6350–6357.Google Scholar
• [17] Drakopoulos K, Jain S, Randhawa R (2021) Persuading customers to buy early: The value of personalized information provisioning. Management Sci. 67(2):828–853.Link, Google Scholar
• [18] Dughmi S (2017) Algorithmic information structure design: A survey. ACM SIGecom Exchanges 15(2):2–24.Crossref, Google Scholar
• [19] Dughmi S, Xu H (2016) Algorithmic Bayesian persuasion. Wichs D, Mansour Y, eds. Proc. 48th Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 412–425.Google Scholar
• [20] Dughmi S, Xu H (2017) Algorithmic persuasion with no externalities. Daskalakis C, Babaioff M, Moulin H, eds. Proc. 18th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 351–368.Google Scholar
• [21] Dughmi S, Kempe D, Qiang R (2016) Persuasion with limited communication. Conitzer V, Bergemann D, Chen Y, eds. Proc. 17th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 663–680.Google Scholar
• [22] Dughmi S, Niazadeh R, Psomas A, Weinberg SM (2019) Persuasion and incentives through the lens of duality. Caragiannis I, Mirrokni V, Nikolova E, eds. Proc. 15th Internat. Conf. Web Internet Econom. (Springer, Cham, Switzerland), 142–155.Google Scholar
• [23] Emek Y, Feldman M, Gamzu I, Leme RP, Tennenholtz M (2014) Signaling schemes for revenue maximization. ACM Trans. Econom. Comput. 2(2):5.Google Scholar
• [24] Forges F (2020) Games with incomplete information: From repetition to cheap talk and persuasion. Ann. Econom. Stat. 137:3–30.Crossref, Google Scholar
• [25] Gentzkow M, Kamenica E (2017) Bayesian persuasion with multiple senders and rich signal spaces. Games Econom. Behav. 104:411–429.Crossref, Google Scholar
• [26] Gentzkow M, Kamenica E (2017) Competition in persuasion. Rev. Econom. Stud. 84(1):300–322.Crossref, Google Scholar
• [27] Goldstein I, Leitner Y (2018) Stress tests and information disclosure. J. Econom. Theory 177:34–69.Crossref, Google Scholar
• [28] Gradwohl R, Hahn N, Hoefer M, Smorodinsky R (2022) Reaping the informational surplus in Bayesian persuasion. Amer. Econom. J. Microeconomics. Forthcoming. https://www.aeaweb.org/articles?id=10.1257/mic.20200399&&from=f.Google Scholar
• [29] Gradwohl R, Hahn N, Hoefer M, Smorodinsky R (2021) Algorithms for persuasion with limited communication. Marx D, ed. Proc. 32nd ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 637–652.Google Scholar
• [30] Gur Y, Macnamara G, Saban D (2020) On the disclosure of promotion value in platforms with learning sellers. Preprint, submitted November 21, https://arxiv.org/abs/1911.09256.Google Scholar
• [31] Hahn N, Hoefer M, Smorodinsky R (2020) Prophet inequalities for Bayesian persuasion. Bessiere C, ed. Proc. 29th Internat. Joint Conf. Artificial Intelligence (International Joint Conferences on Artificial Intelligence Organization), 175–181.Google Scholar
• [32] Hahn N, Hoefer M, Smorodinsky R (2020) The secretary recommendation problem. Biró P, Hartline JD, Ostrovsky M, Procaccia AD, eds. Proc. 21st ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 189.Google Scholar
• [33] Kamenica E (2019) Bayesian persuasion and information design. Annu. Rev. Econom. 11(1):249–272.Crossref, Google Scholar
• [34] Kamenica E, Gentzkow M (2011) Bayesian persuasion. Amer. Econom. Rev. 101(6):2590–2615.Crossref, Google Scholar
• [35] Kellerer H, Pferschy U, Pisinger D (2013) Knapsack Problems (Springer, Berlin).Google Scholar
• [36] Kolotilin A (2015) Experimental design to persuade. Games Econom. Behav. 90:215–226.Crossref, Google Scholar
• [37] Krause A, Golovin D (2014) Submodular function maximization. Bordeaux L, Hamadi Y, Kohli P, eds. Tractability: Practical Approaches to Hard Problems (Cambridge University Press, Cambridge, UK), 71–104.Crossref, Google Scholar
• [38] Kremer I, Mansour Y, Perry M (2014) Implementing the “wisdom of the crowd.” J. Political Econom. 122(5):988–1012.Crossref, Google Scholar
• [39] Küçükgül C, Özer Ö, Wang S (2022) Engineering social learning: Information design of time-locked sales campaigns for online platforms. Management Sci., ePub ahead of print November 19, https://pubsonline.informs.org/doi/abs/10.1287/mnsc.2021.4151.Google Scholar
• [40] Le Treust M, Tomala T (2019) Persuasion with limited communication capacity. J. Econom. Theory 184:104940.Crossref, Google Scholar
• [41] Li F, Norman P (2018) On Bayesian persuasion with multiple senders. Econom. Lett. 170:66–70.Crossref, Google Scholar
• [42] Lingenbrink D, Iyer K (2018) Signaling in online retail: Efficacy of public signals. Preprint, submitted May 26, http://dx.doi.org/10.2139/ssrn.3179262.Google Scholar
• [43] Lingenbrink D, Iyer K (2019) Optimal signaling mechanisms in unobservable queues. Oper. Res. 67(5):1397–1416.Link, Google Scholar
• [44] Nemhauser G, Wolsey L, Fisher M (1978) An analysis of approximations for maximizing submodular set functions—I. Math. Programming 14:265–294.Crossref, Google Scholar
• [45] Papanastasiou Y, Bimpikis K, Savva N (2018) Crowdsourcing exploration. Management Sci. 64(4):1727–1746.Link, Google Scholar
• [46] Rabinovich Z, Jiang AX, Jain M, Xu H (2015) Information disclosure as a means to security. Weiss G, Yolum P, Bordini RH, Elkind E, eds. Proc. 14th Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 645–653.Google Scholar
• [47] Rubinstein A (2017) Honest signaling in zero-sum games is hard, and lying is even harder. Chatzigiannakis I, Indyk P, Kuhn F, Muscholl A, eds. Proc. 44th Internat. Colloquium Automata, Languages, Programming (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 77:1–77:13.Google Scholar
• [48] Wardrop JG (1952) Road paper. Some theoretical aspects of road traffic research. Proc. Inst. Civil Engineers 1(3):325–362.Crossref, Google Scholar
• [49] Xu H (2020) On the tractability of public persuasion with no externalities. Chawla S, ed. Proc. 30th ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 2708–2727.Google Scholar
• [50] Xu H, Rabinovich Z, Dughmi S, Tambe M (2015) Exploring information asymmetry in two-stage security games. Bonet B, Koenig S, eds. Proc. 29th Conf. Artificial Intelligence (Association for the Advancement of Artificial Intelligence, Menlo Park, CA), 1057–1063.Google Scholar
• [51] Xu H, Freeman R, Conitzer V, Dughmi S, Tambe M (2016) Signaling in Bayesian Stackelberg games. Jonker CM, Marsella S, Thangarajah J, Tuyls K, eds. Proc. 15th Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 150–158.Google Scholar