No-Regret Bayesian Recommendation to Homogeneous Users

References

• Alonso R, Camara O (2016) Bayesian persuasion with heterogeneous priors. J. Econom. Theory 165:672–706.Crossref, Google Scholar
• Arieli I, Babichenko Y, Smorodinsky R, Yamashita T (2023) Optimal persuasion via bi-pooling. Theoretical Econom. 18(1):15–36.Crossref, Google Scholar
• Babichenko Y, Talgam-Cohen I, Xu H, Zabarnyi K (2021) Regret-minimizing Bayesian persuasion. Proc. 22nd ACM Conf. Econom. Comput. (ACM, New York), 128–128.Google Scholar
• Blum A, Mansour Y (2007) From external to internal regret. J. Machine Learn. Res. 8(47):1307–1324.Google Scholar
• Blum A, Haghtalab N, Procaccia AD (2014) Learning optimal commitment to overcome insecurity. Proc. 28th Internat. Conf. Neural Inform. Processing Systems, vol. 1 (MIT Press, Cambridge, MA), 1826–1834.Google Scholar
• Candogan O (2022) Persuasion in networks: Public signals and cores. Oper. Res. 70(4):2264–2298.Link, Google Scholar
• Candogan O, Strack P (2021) Optimal disclosure of information to a privately informed receiver. Proc. 22nd ACM Conf. Econom. Comput. (ACM, New York), 263–263.Google Scholar
• Castiglioni M, Celli A, Marchesi A, Gatti N (2020) Online bayesian persuasion. Larochelle H, Ranzato M, Hadsell R, Balcan MF, Lin H, eds. Advances in Neural Information Processing Systems, vol. 33 (Curran Associates Inc., Red Hook, NY), 16188–16198.Google Scholar
• Castiglioni M, Marchesi A, Celli A, Gatti N (2021) Multi-receiver online Bayesian persuasion. Proc. Internat. Conf. Machine Learn. (PMLR, New York), 1314–1323.Google Scholar
• Chen Y, Liu Y, Podimata C (2020) Learning strategy-aware linear classifiers. Larochelle H, Ranzato M, Hadsell R, Balcan MF, Lin H, eds. Advances in Neural Information Processing Systems, vol. 33 (Curran Associates, Inc., Red Hook, NY), 15265–15276.Google Scholar
• Cohen MC, Lobel I, Leme RP (2020) Feature-based dynamic pricing. Management Sci. 66(11):4921–4943.Link, Google Scholar
• Debo LG, Parlour C, Rajan U (2012) Signaling quality via queues. Management Sci. 58(5):876–891.Link, Google Scholar
• Dong J, Roth A, Schutzman Z, Waggoner B, Wu ZS (2018) Strategic classification from revealed preferences. Proc. ACM Conf. Econom. Comput. (ACM, New York), 55–70.Google Scholar
• Dughmi S, Xu H (2017) Algorithmic persuasion with no externalities. Proc. ACM Conf. Econom. Comput. (ACM, New York), 351–368.Google Scholar
• Dughmi S, Xu H (2019) Algorithmic bayesian persuasion. SIAM J. Comput. 50(3):16–68.Google Scholar
• Dworczak P, Pavan A (2022) Preparing for the worst but hoping for the best: Robust (Bayesian) persuasion. Econometrica 90(5):2017–2051.Crossref, Google Scholar
• Gentzkow M, Kamenica E (2016) A rothschild-stiglitz approach to bayesian persuasion. Amer. Econom. Rev. 106(5):597–601.Crossref, Google Scholar
• Grötschel M, Lovász L, Schrijver A (2012) Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2 (Springer Berlin, Heidelberg).Google Scholar
• Hu J, Weng X (2021) Robust persuasion of a privately informed receiver. Econom. Theory 72(3):909–953.Crossref, Google Scholar
• Ifrach B, Maglaras C, Scarsini M, Zseleva A (2019) Bayesian social learning from consumer reviews. Oper. Res. 67(5):1209–1221.Link, Google Scholar
• Kamenica E, Gentzkow M (2011) Bayesian persuasion. Amer. Econom. Rev. 101(6):2590–2615.Crossref, Google Scholar
• Kleinberg R, Leighton T The value of knowing a demand curve: Bounds on regret for online posted-price auctions. Proc. 44th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 594–605.Google Scholar
• Knowledge Sourcing Intelligence LLP (2021) Social networking platforms market: Forecasts from 2021 to 2026. Accessed October 31, 2024, https://www.researchandmarkets.com/reports/5332678/social-networking-platforms-market-forecasts.Google Scholar
• Kolotilin A (2018) Optimal information disclosure: A linear programming approach. Theoretical Econom. 13(2):607–635.Crossref, Google Scholar
• Kolotilin A, Mylovanov T, Zapechelnyuk A, Li M (2017) Persuasion of a privately informed receiver. Econometrica 85(6):1949–1964.Crossref, Google Scholar
• Kosterina S (2018) Persuasion with unknown beliefs. Working paper, Princeton University, Princeton, NJ.Google Scholar
• Kremer I, Mansour Y, Perry M (2014) Implementing the “wisdom of the crowd.” J. Political Econom. 122(5):988–1012.Crossref, Google Scholar
• Lee YT, Sidford A, Vempala SS (2018) Efficient convex optimization with membership oracles. Proc. Conf. Learn. Theory (PMLR, New York), 1292–1294.Google Scholar
• Leme RP, Schneider J (2018) Contextual search via intrinsic volumes. Proc. IEEE 59th Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 268–282.Google Scholar
• Lingenbrink D, Iyer K (2019) Optimal signaling mechanisms in unobservable queues. Oper. Res. 67(5):1397–1416.Link, Google Scholar
• Liu A, Leme RP, Schneider J (2021) Optimal contextual pricing and extensions. Proc. ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1059–1078.Google Scholar
• Lobel I, Leme RP, Vladu A (2018) Multidimensional binary search for contextual decision-making. Oper. Res. 66(5):1346–1361.Link, Google Scholar
• Mansour Y, Slivkins A, Syrgkanis V (2015) Bayesian incentive-compatible bandit exploration. Proc. 16th ACM Conf. Econom. Comput. (ACM, New York), 565–582.Google Scholar
• Mansour Y, Slivkins A, Syrgkanis V, Wu ZS (2021) Bayesian exploration: Incentivizing exploration in Bayesian games. Oper. Res. 70(2):1105–1127.Link, Google Scholar
• Renault J, Solan E, Vieille N (2017) Optimal dynamic information provision. Games Econom. Behav. 104:329–349.Crossref, Google Scholar
• Shin D, Vaccari S, Zeevi A (2023) Dynamic pricing with online reviews. Management Sci. 69(2):824–845.Link, Google Scholar
• Zu Y, Iyer K, Xu H (2021) Learning to persuade on the fly: Robustness against ignorance. Proc. 22nd ACM Conf. Econom. Comput. (ACM, New York), 927–928.Google Scholar