Algorithmic Persuasion Through Simulation

Market structure and equilibrium

Heinrich Von Stackelberg. 1934 · 1934

Earlier work this paper cites.

Persuasion of a privately informed receiver

Anton Kolotilin, Tymofiy Mylovanov, Andriy Zapechelnyuk, and Ming Li. 2017 · 1964

Earlier work this paper cites.

Disclosure laws and takeover bids

Sanford J Grossman and Oliver D Hart. 1980 · 1980

Earlier work this paper cites.

Strategic information transmission

Vincent P Crawford and Joel Sobel. 1982 · 1982

Earlier work this paper cites.

The sample complexity of exploration in the multi-armed bandit problem

Shie Mannor and John N. Tsitsiklis. 2004 · 2004

Earlier work this paper cites.

Computing the optimal strategy to commit to. In Proceedings of the 7th ACM conference on Electronic commerce . 82–90

Vincent Conitzer and Tuomas Sandholm. 2006 · 2006

Earlier work this paper cites.

Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems

Eyal Even-Dar, Shie Mannor, and Yishay Mansour. 2006 · 2006

Earlier work this paper cites.

Learning and approximating the optimal strategy to commit to. In Algorithmic Game Theory: Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings 2 . Springer, 250–262

Joshua Letchford, Vincent Conitzer, and Kamesh Munagala. 2009 · 2009

Earlier work this paper cites.

Best Arm Identification in Multi-Armed Bandits. In 23rd Conf. on Learning Theory (COLT) . 41–53

Jean-Yves Audibert, Sébastien Bubeck, and Rémi Munos. 2010 · 2010

Earlier work this paper cites.

Pure Exploration in Multi-Armed Bandit Problems

Sébastien Bubeck, Rémi Munos, and Gilles Stoltz. 2011 · 2011

Earlier work this paper cites.

Bayesian persuasion

Emir Kamenica and Matthew Gentzkow. 2011 · 2011

Cited alongside, same era.

Iterative methods in combinatorial optimization . Vol. 46

Lap Chi Lau, Ramamoorthi Ravi, and Mohit Singh. 2011 · 2011

Cited alongside, same era.

Learning optimal commitment to overcome insecurity

Avrim Blum, Nika Haghtalab, and Ariel D Procaccia. 2014 · 2014

Cited alongside, same era.

Commitment without regrets: Online learning in stackelberg security games. In Proceedings of the sixteenth ACM conference on economics and computation . 61–78

Maria-Florina Balcan, Avrim Blum, Nika Haghtalab, and Ariel D Procaccia. 2015 · 2015

Cited alongside, same era.

Information Design: A Unified Perspective

Dirk Bergemann and Stephen Morris. 2019 · 2019

Cited alongside, same era.

Bayesian persuasion and information design

Emir Kamenica. 2019 · 2019

Cited alongside, same era.

Robust persuasion of a privately informed receiver

Ju Hu and Xi Weng. 2021 · 2021

Later among the works it cites.

Learning to persuade on the fly: Robustness against ignorance. In Proceedings of the 22nd ACM Conference on Economics and Computation . 927–928

You Zu, Krishnamurthy Iyer, and Haifeng Xu. 2021 · 2021

Later among the works it cites.

Persuasion with unknown beliefs

Svetlana Kosterina. 2022 · 2022

Later among the works it cites.

Persuasion without Priors

Alexei Parakhonyak and Anton Sobolev. 2022 · 2022

Later among the works it cites.

Optimal rates and efficient algorithms for online Bayesian persuasion. In International Conference on Machine Learning . PMLR, 2164–2183

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Francesco Trovò, and Nicola Gatti. 2023 · 2023

Closest in time.

Game theory with simulation of other players