@article{bogunovic2021misspecified,
  title={Misspecified gaussian process bandit optimization},
  author={Bogunovic, Ilija and Krause, Andreas},
  journal={Advances in Neural Information Processing Systems},
  volume={34},
  pages={3004--3015},
  year={2021}
}

@article{hvarfner2024self,
  title={Self-correcting bayesian optimization through bayesian active learning},
  author={Hvarfner, Carl and Hellsten, Erik and Hutter, Frank and Nardi, Luigi},
  journal={Advances in Neural Information Processing Systems},
  volume={36},
  year={2024}
}

@article{berkenkamp2019no,
  title={No-regret bayesian optimization with unknown hyperparameters},
  author={Berkenkamp, Felix and Schoellig, Angela P and Krause, Andreas},
  journal={Journal of Machine Learning Research},
  volume={20},
  number={50},
  pages={1--24},
  year={2019}
}

@article{balandat2020botorch,
  title={BoTorch: A framework for efficient Monte-Carlo Bayesian optimization},
  author={Balandat, Maximilian and Karrer, Brian and Jiang, Daniel and Daulton, Samuel and Letham, Ben and Wilson, Andrew G and Bakshy, Eytan},
  journal={Advances in neural information processing systems},
  volume={33},
  pages={21524--21538},
  year={2020}
}

@article{gemp2023approximating,
  title={Approximating Nash equilibria in normal-form games via stochastic optimization},
  author={Gemp, Ian and Marris, Luke and Piliouras, Georgios},
  journal={The Twelfth International Conference on Learning Representations},
  year={2024}
}

@book{lattimore2020bandit,
  title={Bandit algorithms},
  author={Lattimore, Tor and Szepesv{\'a}ri, Csaba},
  year={2020},
  publisher={Cambridge University Press}
}

@inproceedings{marchesi2020learning,
  title={Learning Probably Approximately Correct Maximin Strategies in Simulation-Based Games with Infinite Strategy Spaces},
  author={Marchesi, Alberto and Trov{\`o}, Francesco and Gatti, Nicola},
  booktitle={Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems},
  pages={834--842},
  year={2020}
}

@inproceedings{jafari2001no,
  title={On no-regret learning, fictitious play, and nash equilibrium},
  author={Jafari, Amir and Greenwald, Amy and Gondek, David and Ercal, Gunes},
  booktitle={ICML},
  volume={1},
  pages={226--233},
  year={2001}
}

@inproceedings{chowdhury2017kernelized,
  title={On kernelized multi-armed bandits},
  author={Chowdhury, Sayak Ray and Gopalan, Aditya},
  booktitle={International Conference on Machine Learning},
  pages={844--853},
  year={2017},
  organization={PMLR}
}

@article{al2018approximating,
  title={Approximating nash equilibria for black-box games: A bayesian optimization approach},
  author={Al-Dujaili, Abdullah and Hemberg, Erik and O'Reilly, Una-May},
  journal={arXiv preprint arXiv:1804.10586},
  year={2018}
}

@article{brenner2005hotelling,
  title={Hotelling games with three, four, and more players},
  author={Brenner, Steffen},
  journal={Journal of Regional Science},
  volume={45},
  number={4},
  pages={851--864},
  year={2005},
  publisher={Wiley Online Library}
}

@article{jordan1991bayesian,
  title={Bayesian learning in normal form games},
  author={Jordan, James S},
  journal={Games and Economic Behavior},
  volume={3},
  number={1},
  pages={60--81},
  year={1991},
  publisher={Elsevier}
}

@inproceedings{maehara2015budget,
  title={Budget allocation problem with multiple advertisers: A game theoretic view},
  author={Maehara, Takanori and Yabe, Akihiro and Kawarabayashi, Ken-ichi},
  booktitle={International Conference on Machine Learning},
  pages={428--437},
  year={2015},
  organization={PMLR}
}

@article{picheny2019bayesian,
  title={A Bayesian optimization approach to find Nash equilibria},
  author={Picheny, Victor and Binois, Mickael and Habbal, Abderrahmane},
  journal={Journal of Global Optimization},
  volume={73},
  number={1},
  pages={171--192},
  year={2019},
  publisher={Springer}
}

@article{vorobeychik2010probabilistic,
  title={Probabilistic analysis of simulation-based games},
  author={Vorobeychik, Yevgeniy},
  journal={ACM Transactions on Modeling and Computer Simulation (TOMACS)},
  volume={20},
  number={3},
  pages={1--25},
  year={2010},
  publisher={ACM New York, NY, USA}
}

@inproceedings{wellman2006methods,
  title={Methods for empirical game-theoretic analysis},
  author={Wellman, Michael P},
  booktitle={AAAI},
  volume={980},
  pages={1552--1556},
  year={2006}
}

@article{hart2000simple,
  title={A simple adaptive procedure leading to correlated equilibrium},
  author={Hart, Sergiu and Mas-Colell, Andreu},
  journal={Econometrica},
  volume={68},
  number={5},
  pages={1127--1150},
  year={2000},
  publisher={Wiley Online Library}
}

@article{hart2001general,
  title={A general class of adaptive strategies},
  author={Hart, Sergiu and Mas-Colell, Andreu},
  journal={Journal of Economic Theory},
  volume={98},
  number={1},
  pages={26--54},
  year={2001},
  publisher={Elsevier}
}

@inproceedings{Han2023LearningIO,
  title={Learning in online principal-agent interactions: The power of menus},
  author={Han, Minbiao and Albert, Michael and Xu, Haifeng},
  booktitle={Proceedings of the AAAI Conference on Artificial Intelligence},
  volume={38},
  number={16},
  pages={17426--17434},
  year={2024}
}

@inproceedings{NEURIPS2019_68521755,
 author = {Sessa, Pier Giuseppe and Bogunovic, Ilija and Kamgarpour, Maryam and Krause, Andreas},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {H. Wallach and H. Larochelle and A. Beygelzimer and F. d\textquotesingle Alch\'{e}-Buc and E. Fox and R. Garnett},
 pages = {},
 publisher = {Curran Associates, Inc.},
 title = {No-Regret Learning in Unknown Games with Correlated Payoffs},
 url = {},
 volume = {32},
 year = {2019}
}

@article{nash1950non,
  title={Non-cooperative games},
  author={Nash, John F},
  year={1950},
  publisher={Princeton University Princeton}
}

@inproceedings{10.1145/779928.779933,
author = {Lipton, Richard J. and Markakis, Evangelos and Mehta, Aranyak},
title = {Playing large games using simple strategies},
year = {2003},
isbn = {158113679X},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/779928.779933},
abstract = {We prove the existence of ε-Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash equilibrium can be ε-approximated by the payoffs to the players in some such logarithmic support ε-Nash equilibrium. These strategies are also uniform on a multiset of logarithmic size and therefore this leads to a quasi-polynomial algorithm for computing an ε-Nash equilibrium. To our knowledge this is the first subexponential algorithm for finding an ε-Nash equilibrium. Our results hold for any multiple-player game as long as the number of players is a constant (i.e., it is independent of the number of pure strategies). A similar argument also proves that for a fixed number of players m, the payoffs to all players in any m-tuple of mixed strategies can be ε-approximated by the payoffs in some m-tuple of constant support strategies.We also prove that if the payoff matrices of a two person game have low rank then the game has an exact Nash equilibrium with small support. This implies that if the payoff matrices can be well approximated by low rank matrices, the game has an ε-equilibrium with small support. It also implies that if the payoff matrices have constant rank we can compute an exact Nash equilibrium in polynomial time.},
booktitle = {Proceedings of the 4th ACM Conference on Electronic Commerce},
pages = {36–41},
numpages = {6},
keywords = {probabilistic method, nash equilibrium},
location = {San Diego, CA, USA},
series = {EC '03}
}

@article{2137c69e-3c1d-390b-9337-e9522a64edcf,
 ISSN = {00361445},
 abstract = {This paper concentrates on the problem of the existence of ε-equilibrium points in the Nash sense for noncooperative n-person games in normal form. Firstly, a survey of known ε-equilibrium point theorems and proof techniques is given. Then various new ε-equilibrium point theorems are derived, in which one of the players has a big strategy space and where nonbounded, payoff functions are allowed. To prove these theorems, results of Arzela-Ascoli are extended.},
 author = {Steve H. Tijs},
 journal = {SIAM Review},
 number = {2},
 pages = {225--237},
 publisher = {Society for Industrial and Applied Mathematics},
 title = {Nash Equilibria for Noncooperative n-Person Games in Normal Form},
 urldate = {2024-02-04},
 volume = {23},
 year = {1981}
}




@inproceedings{NIPS2017_68a97503,
 author = {Lowe, Ryan and WU, YI and Tamar, Aviv and Harb, Jean and Pieter Abbeel, OpenAI and Mordatch, Igor},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {I. Guyon and U. Von Luxburg and S. Bengio and H. Wallach and R. Fergus and S. Vishwanathan and R. Garnett},
 pages = {},
 publisher = {Curran Associates, Inc.},
 title = {Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments},
 url = {},
 volume = {30},
 year = {2017}
}


@article{Gan2023RobustSE,
  title={Robust Stackelberg Equilibria},
  author={Jiarui Gan and Minbiao Han and Jibang Wu and Haifeng Xu},
  journal={Proceedings of the 24th ACM Conference on Economics and Computation},
  year={2023}
}

@article{karandikar1998evolving,
  title={Evolving aspirations and cooperation},
  author={Karandikar, Rajeeva and Mookherjee, Dilip and Ray, Debraj and Vega-Redondo, Fernando},
  journal={journal of economic theory},
  volume={80},
  number={2},
  pages={292--331},
  year={1998},
  publisher={Elsevier}
}

@article{young2009learning,
  title={Learning by trial and error},
  author={Young, H Peyton},
  journal={Games and economic behavior},
  volume={65},
  number={2},
  pages={626--643},
  year={2009},
  publisher={Elsevier}
}

@article{marden2009payoff,
  title={Payoff-based dynamics for multiplayer weakly acyclic games},
  author={Marden, Jason R and Young, H Peyton and Arslan, G{\"u}rdal and Shamma, Jeff S},
  journal={SIAM Journal on Control and Optimization},
  volume={48},
  number={1},
  pages={373--396},
  year={2009},
  publisher={SIAM}
}

@article{foster2006regret,
  title={Regret testing: Learning to play Nash equilibrium without knowing you have an opponent},
  author={Foster, Dean and Young, Hobart Peyton},
  journal={Theoretical Economics},
  volume={1},
  number={3},
  pages={341--367},
  year={2006}
}

@article{germano2014global,
  title={Global Nash convergence of Foster and Young’s regret testing (2005)},
  author={Germano, F and Lugosi, G},
  journal={URL http://www. econ. upf. edu/\~{} lugosi/nash. pdf},
  year={2014}
}

@article{foster1999regret,
  title={Regret in the on-line decision problem},
  author={Foster, Dean P and Vohra, Rakesh},
  journal={Games and Economic Behavior},
  volume={29},
  number={1-2},
  pages={7--35},
  year={1999},
  publisher={Elsevier}
}

@article{fearnley2015learning,
  title={Learning Equilibria of Games via Payoff Queries},
  author={Fearnley, John and Gairing, Martin and Goldberg, Paul W and Savani, Rahul},
  journal={Journal of Machine Learning Research},
  volume={16},
  pages={1305--1344},
  year={2015}
}

@inproceedings{jordan2008searching,
  title={Searching for approximate equilibria in empirical games},
  author={Jordan, Patrick R and Vorobeychik, Yevgeniy and Wellman, Michael P},
  booktitle={Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems-Volume 2},
  pages={1063--1070},
  year={2008}
}

@article{wellman2008bidding,
  title={Bidding strategies for simultaneous ascending auctions},
  author={Wellman, Michael P and Osepayshvili, Anna and MacKie-Mason, Jeffrey K and Reeves, Daniel},
  journal={The BE Journal of Theoretical Economics},
  volume={8},
  number={1},
  year={2008},
  publisher={De Gruyter}
}

@inproceedings{vorobeychik2006empirical,
  title={Empirical mechanism design: Methods, with application to a supply-chain scenario},
  author={Vorobeychik, Yevgeniy and Kiekintveld, Christopher and Wellman, Michael P},
  booktitle={Proceedings of the 7th ACM conference on Electronic commerce},
  pages={306--315},
  year={2006}
}

@techreport{vorobeychik2009game,
  title={Game theoretic methods for analysis of combat simulations},
  author={Vorobeychik, Yevgeniy and Porche, Isaac},
  year={2009},
  institution={Working paper}
}

@inproceedings{vorobeychik2008stochastic,
  title={Stochastic search methods for nash equilibrium approximation in simulation-based games.},
  author={Vorobeychik, Yevgeniy and Wellman, Michael P},
  booktitle={AAMAS (2)},
  pages={1055--1062},
  year={2008}
}

@article{mathesen2021scaling,
  title={Scaling Bayesian Optimization With Game Theory},
  author={Mathesen, Logan and Pedrielli, Giulia and Smith, Robert L},
  journal={arXiv preprint arXiv:2110.03790},
  year={2021}
}

@article{bacsar1987relaxation,
  title={Relaxation techniques and asynchronous algorithms for on-line computation of non-cooperative equilibria},
  author={Basar, Tamer},
  journal={Journal of Economic Dynamics and Control},
  volume={11},
  number={4},
  pages={531--549},
  year={1987},
  publisher={Elsevier}
}

@article{daskalakis2009complexity,
  title={The complexity of computing a Nash equilibrium},
  author={Daskalakis, Constantinos and Goldberg, Paul W and Papadimitriou, Christos H},
  journal={Communications of the ACM},
  volume={52},
  number={2},
  pages={89--97},
  year={2009},
  publisher={ACM New York, NY, USA}
}

@article{li1987distributed,
  title={Distributed algorithms for the computation of noncooperative equilibria},
  author={Li, Shu and Basar, Tamer},
  journal={Automatica},
  volume={23},
  number={4},
  pages={523--533},
  year={1987},
  publisher={Elsevier}
}

@article{uryas1994relaxation,
  title={On relaxation algorithms in computation of noncooperative equilibria},
  author={URYAs' Ev, STANIsLAV and Rubinstein, Reuven Y},
  journal={IEEE Transactions on Automatic Control},
  volume={39},
  number={6},
  pages={1263--1267},
  year={1994},
  publisher={IEEE}
}

@article{aprem2021bayesian,
  title={A Bayesian Optimization Approach to Compute Nash Equilibrium of Potential Games Using Bandit Feedback},
  author={Aprem, Anup and Roberts, Stephen},
  journal={The Computer Journal},
  volume={64},
  number={12},
  pages={1801--1813},
  year={2021},
  publisher={Oxford University Press}
}

@article{monderer1996potential,
  title={Potential games},
  author={Monderer, Dov and Shapley, Lloyd S},
  journal={Games and economic behavior},
  volume={14},
  number={1},
  pages={124--143},
  year={1996},
  publisher={Elsevier}
}

@article{myerson1999nash,
  title={Nash equilibrium and the history of economic theory},
  author={Myerson, Roger B},
  journal={Journal of Economic Literature},
  volume={37},
  number={3},
  pages={1067--1082},
  year={1999}
}

@techreport{von2004leadership,
  title={Leadership with commitment to mixed strategies},
  author={Von Stengel, Bernhard and Zamir, Shmuel},
  year={2004},
  institution={Citeseer}
}

@book{mockus2012bayesian,
  title={Bayesian approach to global optimization: theory and applications},
  author={Mockus, Jonas},
  volume={37},
  year={2012},
  publisher={Springer Science \& Business Media}
}

@book{garnett2023bayesian,
  title={Bayesian Optimization},
  author={Garnett, Roman},
  year={2023},
  publisher={Cambridge University Press}
}

@article{farkas1902ober,
  title={Ober die Theorie der einfachen Ungleichungen},
  author={Farkas, J},
  journal={J. Reine Angew. Math},
  volume={124},
  pages={1--24},
  year={1902}
}

@book{pricingBook,
author = {Paczkowski, W.R.},
year = {2018},
month = {06},
pages = {1-318},
title = {Pricing analytics: Models and advanced quantitative techniques for product pricing},
journal = {Pricing Analytics: Models and Advanced Quantitative Techniques for Product Pricing},
doi = {10.4324/9781315178349}
}

@article{conitzer2008new,
  title={New complexity results about Nash equilibria},
  author={Conitzer, Vincent and Sandholm, Tuomas},
  journal={Games and Economic Behavior},
  volume={63},
  number={2},
  pages={621--641},
  year={2008},
  publisher={Elsevier}
}

@inproceedings{conitzer2006computing,
  title={Computing the optimal strategy to commit to},
  author={Conitzer, Vincent and Sandholm, Tuomas},
  booktitle={Proceedings of the 7th ACM conference on Electronic commerce},
  pages={82--90},
  year={2006}
}

@inproceedings{castiglioni2021bayesian,
  title={Bayesian agency: Linear versus tractable contracts},
  author={Castiglioni, Matteo and Marchesi, Alberto and Gatti, Nicola},
  booktitle={Proceedings of the 22nd ACM Conference on Economics and Computation},
  pages={285--286},
  year={2021}
}

@article{lauffer2022no,
  title={No-Regret Learning in Dynamic Stackelberg Games},
  author={Lauffer, Niklas and Ghasemi, Mahsa and Hashemi, Abolfazl and Savas, Yagiz and Topcu, Ufuk},
  journal={arXiv preprint arXiv:2202.04786},
  year={2022}
}

@article{li2017review,
  title={A review of dynamic Stackelberg game models},
  author={Li, Tao and Sethi, Suresh P},
  journal={Discrete \& Continuous Dynamical Systems-B},
  volume={22},
  number={1},
  pages={125},
  year={2017},
  publisher={American Institute of Mathematical Sciences}
}


@inproceedings{cartis2009finding,
  title={Finding a point in the relative interior of a polyhedron, with applications to compressed sensing},
  author={Cartis, Coralia and IM, Gould Nicholas},
  booktitle={SPARS'09-Signal Processing with Adaptive Sparse Structured Representations},
  year={2009}
}


@inproceedings{xu2020tractability,
  title={On the tractability of public persuasion with no externalities},
  author={Xu, Haifeng},
  booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages={2708--2727},
  year={2020},
  organization={SIAM}
}


@article{dutting2021complexity,
  title={The complexity of contracts},
  author={Dutting, Paul and Roughgarden, Tim and Talgam-Cohen, Inbal},
  journal={SIAM Journal on Computing},
  volume={50},
  number={1},
  pages={211--254},
  year={2021},
  publisher={SIAM}
}

@article{myerson1982optimal,
  title={Optimal coordination mechanisms in generalized principal--agent problems},
  author={Myerson, Roger B},
  journal={Journal of mathematical economics},
  volume={10},
  number={1},
  pages={67--81},
  year={1982},
  publisher={Elsevier}
}

@inproceedings{letchford2009learning,
  title={Learning and approximating the optimal strategy to commit to},
  author={Letchford, Joshua and Conitzer, Vincent and Munagala, Kamesh},
  booktitle={International symposium on algorithmic game theory},
  pages={250--262},
  year={2009},
  organization={Springer}
}

@inproceedings{xiao2020optimal,
  title={Optimal common contract with heterogeneous agents},
  author={Xiao, Shenke and Wang, Zihe and Chen, Mengjing and Tang, Pingzhong and Yang, Xiwang},
  booktitle={Proceedings of the AAAI Conference on Artificial Intelligence},
  volume={34},
  number={05},
  pages={7309--7316},
  year={2020}
}

@inproceedings{guruganesh2021contracts,
  title={Contracts under moral hazard and adverse selection},
  author={Guruganesh, Guru and Schneider, Jon and Wang, Joshua R},
  booktitle={Proceedings of the 22nd ACM Conference on Economics and Computation},
  pages={563--582},
  year={2021}
}

 


@article{einav2013selection,
  title={Selection on moral hazard in health insurance},
  author={Einav, Liran and Finkelstein, Amy and Ryan, Stephen P and Schrimpf, Paul and Cullen, Mark R},
  journal={American Economic Review},
  volume={103},
  number={1},
  pages={178--219},
  year={2013}
}

@book{antle1981moral,
  title={Moral hazard and auditor contracts: an approach to auditors'legal liability and independence},
  author={Antle, Ricky Lee},
  year={1981},
  publisher={Stanford University}
}

@incollection{akerlof1978market,
  title={The market for “lemons”: Quality uncertainty and the market mechanism},
  author={Akerlof, George A},
  booktitle={Uncertainty in economics},
  pages={235--251},
  year={1978},
  publisher={Elsevier}
}

@article{kamenica2011bayesian,
  title={Bayesian persuasion},
  author={Kamenica, Emir and Gentzkow, Matthew},
  journal={American Economic Review},
  volume={101},
  number={6},
  pages={2590--2615},
  year={2011}
}

@incollection{grossman1992analysis,
  title={An analysis of the principal-agent problem},
  author={Grossman, Sanford J and Hart, Oliver D},
  booktitle={Foundations of insurance economics},
  pages={302--340},
  year={1992},
  publisher={Springer}
}

@incollection{laffont2009theory,
  title={The theory of incentives},
  author={Laffont, Jean-Jacques and Martimort, David},
  booktitle={The Theory of Incentives},
  year={2009},
  publisher={Princeton university press}
}

@book{smith2004contract,
  title={Contract theory},
  author={Smith, Stephen A},
  year={2004},
  publisher={OUP Oxford}
}

@inproceedings{dutting2019simple,
  title={Simple versus optimal contracts},
  author={D{\"u}tting, Paul and Roughgarden, Tim and Talgam-Cohen, Inbal},
  booktitle={Proceedings of the 2019 ACM Conference on Economics and Computation},
  pages={369--387},
  year={2019}
}

@inproceedings{alon2021contracts,
  title={Contracts with Private Cost per Unit-of-Effort},
  author={Alon, Tal and D{\"u}tting, Paul and Talgam-Cohen, Inbal},
  booktitle={Proceedings of the 22nd ACM Conference on Economics and Computation},
  pages={52--69},
  year={2021}
}


@inproceedings{xu2016signaling,
  title={Signaling in Bayesian Stackelberg Games.},
  author={Xu, Haifeng and Freeman, Rupert and Conitzer, Vincent and Dughmi, Shaddin and Tambe, Milind},
  booktitle={AAMAS},
  pages={150--158},
  year={2016}
}

@article{castiglioni2022bayesian,
  title={Bayesian Persuasion Meets Mechanism Design: Going Beyond Intractability with Type Reporting},
  author={Castiglioni, Matteo and Marchesi, Alberto and Gatti, Nicola},
  journal={arXiv preprint arXiv:2202.00605},
  year={2022}
}

@article{gan2022optimal,
  title={Optimal Coordination in Generalized Principal-Agent Problems: A Revisit and Extensions},
  author={Gan, Jiarui and Han, Minbiao and Wu, Jibang and Xu, Haifeng},
  journal={arXiv preprint arXiv:2209.01146},
  year={2022}
}

@misc{gurobi,
  author = {{Gurobi Optimization, LLC}},
  title = {{Gurobi Optimizer Reference Manual}},
  year = 2022,
  url = "https://www.gurobi.com"
}

@article{bergemann2015limits,
  title={The limits of price discrimination},
  author={Bergemann, Dirk and Brooks, Benjamin and Morris, Stephen},
  journal={American Economic Review},
  volume={105},
  number={3},
  pages={921--57},
  year={2015}
}

@article{yang2022selling,
  title={Selling consumer data for profit: Optimal market-segmentation design and its consequences},
  author={Yang, Kai Hao},
  journal={American Economic Review},
  volume={112},
  number={4},
  pages={1364--93},
  year={2022}
}


@inproceedings{haghtalab2022learning,
  title={Learning in Stackelberg Games with Non-myopic Agents},
  author={Haghtalab, Nika and Lykouris, Thodoris and Nietert, Sloan and Wei, Alexander},
  booktitle={Proceedings of the 23rd ACM Conference on Economics and Computation},
  pages={917--918},
  year={2022}
}

@inproceedings{paruchuri2008playing,
  title={Playing games for security: An efficient exact algorithm for solving Bayesian Stackelberg games},
  author={Paruchuri, Praveen and Pearce, Jonathan P and Marecki, Janusz and Tambe, Milind and Ordonez, Fernando and Kraus, Sarit},
  booktitle={Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems-Volume 2},
  pages={895--902},
  year={2008}
}


@article{vanunts2019optimal,
  title={Optimal pricing in repeated posted-price auctions with different patience of the seller and the buyer},
  author={Vanunts, Arsenii and Drutsa, Alexey},
  journal={Advances in Neural Information Processing Systems},
  volume={32},
  year={2019}
}

@article{myerson1981optimal,
  title={Optimal auction design},
  author={Myerson, Roger B},
  journal={Mathematics of operations research},
  volume={6},
  number={1},
  pages={58--73},
  year={1981},
  publisher={INFORMS}
}

@book{matousek2007understanding,
  title={Understanding and using linear programming},
  author={Matousek, Jiri and G{\"a}rtner, Bernd},
  year={2007},
  publisher={Springer Science \& Business Media}
}

@book{williamson_2019, place={Cambridge}, title={Network Flow Algorithms}, DOI={10.1017/9781316888568}, publisher={Cambridge University Press}, author={Williamson, David P.}, year={2019}}

@inproceedings{roth2016watch,
  title={Watch and learn: Optimizing from revealed preferences feedback},
  author={Roth, Aaron and Ullman, Jonathan and Wu, Zhiwei Steven},
  booktitle={Proceedings of the forty-eighth annual ACM symposium on Theory of Computing},
  pages={949--962},
  year={2016}
}

@inproceedings{belloni2015escaping,
  title={Escaping the local minima via simulated annealing: Optimization of approximately convex functions},
  author={Belloni, Alexandre and Liang, Tengyuan and Narayanan, Hariharan and Rakhlin, Alexander},
  booktitle={Conference on Learning Theory},
  pages={240--265},
  year={2015}
}

@article{tao2005dc,
  title={The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems},
  author={Tao, Pham Dinh and others},
  journal={Annals of operations research},
  volume={133},
  number={1-4},
  pages={23--46},
  year={2005},
  publisher={Springer}
}

@article{le1997solving,
  title={Solving a class of linearly constrained indefinite quadratic problems by DC algorithms},
  author={Le Thi Hoai, An and Tao, Pham Dinh},
  journal={Journal of global optimization},
  volume={11},
  number={3},
  pages={253--285},
  year={1997},
  publisher={Springer}
}

@article{tao1997convex,
  title={Convex analysis approach to DC programming: theory, algorithms and applications},
  author={Tao, Pham Dinh and An, Le Thi Hoai},
  journal={Acta mathematica vietnamica},
  volume={22},
  number={1},
  pages={289--355},
  year={1997}
}

@article{tao1998dc,
  title={A DC optimization algorithm for solving the trust-region subproblem},
  author={Tao, Pham Dinh and An, Le Thi Hoai},
  journal={SIAM Journal on Optimization},
  volume={8},
  number={2},
  pages={476--505},
  year={1998},
  publisher={SIAM}
}

@inproceedings{tang2018price,
  title={The price of prior dependence in auctions},
  author={Tang, Pingzhong and Zeng, Yulong},
  booktitle={Proceedings of the 2018 ACM Conference on Economics and Computation},
  pages={485--502},
  year={2018}
}

@book{williamson2019network,
  title={Network Flow Algorithms},
  author={Williamson, D.P.},
  isbn={9781107185890},
  lccn={2019011352},
  url={https://books.google.com/books?id=TKGYwgEACAAJ},
  year={2019},
  publisher={Cambridge University Press}
}

@inproceedings{deng2019strategizing,
  title={Strategizing against No-regret Learners},
  author={Deng, Yuan and Schneider, Jon and Sivan, Balasubramanian},
  booktitle={Advances in Neural Information Processing Systems},
  pages={1577--1585},
  year={2019}
}

@inproceedings{kleinberg2003value,
title={The value of knowing a demand curve: Bounds on regret for online posted-price auctions},
author={Kleinberg, Robert and Leighton, Tom},
booktitle={44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.},
pages={594--605},
year={2003},
organization={IEEE}
}

@inproceedings{marecki2012playing,
  title={Playing repeated stackelberg games with unknown opponents},
  author={Marecki, Janusz and Tesauro, Gerry and Segal, Richard},
  booktitle={Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2},
  pages={821--828},
  year={2012}
}

@inproceedings{blum2014learning,
  title={Learning optimal commitment to overcome insecurity},
  author={Blum, Avrim and Haghtalab, Nika and Procaccia, Ariel D},
  booktitle={Advances in Neural Information Processing Systems},
  pages={1826--1834},
  year={2014}
}

@inproceedings{balcan2015commitment,
  title={Commitment without regrets: Online learning in stackelberg security games},
  author={Balcan, Maria-Florina and Blum, Avrim and Haghtalab, Nika and Procaccia, Ariel D},
  booktitle={Proceedings of the sixteenth ACM conference on economics and computation},
  pages={61--78},
  year={2015}
}

@inproceedings{castiglioni2022designing,
  author    = {Matteo Castiglioni and
               Alberto Marchesi and
               Nicola Gatti},
  title     = {Designing Menus of Contracts Efficiently: The Power of Randomization},
  booktitle = {{EC} '22: The 23rd {ACM} Conference on Economics and Computation},
  pages     = {705--735},
  publisher = {{ACM}},
  year      = {2022},
  doi       = {10.1145/3490486.3538270},
}
 

@article{althofer1994sparse,
  title={On sparse approximations to randomized strategies and convex combinations},
  author={Alth{\"o}fer, Ingo},
  journal={Linear Algebra and its Applications},
  volume={199},
  pages={339--355},
  year={1994},
  publisher={Elsevier}
}

@article{pavan2014dynamic,
  title={Dynamic mechanism design: A myersonian approach},
  author={Pavan, Alessandro and Segal, Ilya and Toikka, Juuso},
  journal={Econometrica},
  volume={82},
  number={2},
  pages={601--653},
  year={2014},
  publisher={Wiley Online Library}
}

@article{mirrokni2020non,
  title={Non-Clairvoyant Dynamic Mechanism Design},
  author={Mirrokni, Vahab and Paes Leme, Renato and Tang, Pingzhong and Zuo, Song},
  journal={Econometrica},
  volume={88},
  number={5},
  pages={1939--1963},
  year={2020},
  publisher={Wiley Online Library}
}


@inproceedings{peng2019learning,
  title={Learning optimal strategies to commit to},
  author={Peng, Binghui and Shen, Weiran and Tang, Pingzhong and Zuo, Song},
  booktitle={Proceedings of the AAAI Conference on Artificial Intelligence},
  volume={33},
  pages={2149--2156},
  year={2019}
}

@article{roth2020multidimensional,
title={Multidimensional dynamic pricing for welfare maximization},
author={Roth, Aaron and Slivkins, Aleksandrs and Ullman, Jonathan and Wu, Zhiwei Steven},
journal={ACM Transactions on Economics and Computation (TEAC)},
volume={8},
number={1},
pages={1--35},
year={2020},
publisher={ACM New York, NY, USA}
}

@inproceedings{amin2013learning,
title={Learning prices for repeated auctions with strategic buyers},
author={Amin, Kareem and Rostamizadeh, Afshin and Syed, Umar},
booktitle={Advances in Neural Information Processing Systems},
pages={1169--1177},
year={2013}
}

@inproceedings{amin2014repeated,
title={Repeated contextual auctions with strategic buyers},
author={Amin, Kareem and Rostamizadeh, Afshin and Syed, Umar},
booktitle={Advances in Neural Information Processing Systems},
pages={622--630},
year={2014}
}

@inproceedings{amin2015online,
title={Online learning and profit maximization from revealed preferences},
author={Amin, Kareem and Cummings, Rachel and Dworkin, Lili and Kearns, Michael and Roth, Aaron},
booktitle={Twenty-Ninth AAAI Conference on Artificial Intelligence},
year={2015}
}

@inproceedings{drutsa2017horizon,
title={Horizon-independent optimal pricing in repeated auctions with truthful and strategic buyers},
author={Drutsa, Alexey},
booktitle={Proceedings of the 26th International Conference on World Wide Web},
pages={33--42},
year={2017}
}

@inproceedings{drutsa2018weakly,
  title={Weakly consistent optimal pricing algorithms in repeated posted-price auctions with strategic buyer},
  author={Drutsa, Alexey},
  booktitle={International Conference on Machine Learning},
  pages={1319--1328},
  year={2018}
}

@inproceedings{mohri2014optimal,
  title={Optimal regret minimization in posted-price auctions with strategic buyers},
  author={Mohri, Mehryar and Munoz, Andres},
  booktitle={Advances in Neural Information Processing Systems},
  pages={1871--1879},
  year={2014}
}

@article{den2015dynamic,
  title={Dynamic pricing and learning: historical origins, current research, and new directions},
  author={den Boer, Arnoud V},
  journal={Surveys in operations research and management science},
  volume={20},
  number={1},
  pages={1--18},
  year={2015},
  publisher={Elsevier}
}

@inproceedings{devanur2014perfect,
  title={Perfect bayesian equilibria in repeated sales},
  author={Devanur, Nikhil R and Peres, Yuval and Sivan, Balasubramanian},
  booktitle={Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms},
  pages={983--1002},
  year={2014},
  organization={SIAM}
}

@inproceedings{gan2019imitative,
title={Imitative follower deception in stackelberg games},
author={Gan, Jiarui and Xu, Haifeng and Guo, Qingyu and Tran-Thanh, Long and Rabinovich, Zinovi and Wooldridge, Michael},
booktitle={Proceedings of the 2019 ACM Conference on Economics and Computation},
pages={639--657},
year={2019}
}

@article{bergemann2007belief,
  title={Belief free incomplete information games},
  author={Bergemann, Dirk and Morris, Stephen},
  year={2007},
  publisher={Cowles Foundation Discussion Paper}
}

@inproceedings{dong2018strategic,
  title={Strategic classification from revealed preferences},
  author={Dong, Jinshuo and Roth, Aaron and Schutzman, Zachary and Waggoner, Bo and Wu, Zhiwei Steven},
  booktitle={Proceedings of the 2018 ACM Conference on Economics and Computation},
  pages={55--70},
  year={2018}
}


@inproceedings{ijcai2019Xu,
  title     = {Imitative Attacker Deception in Stackelberg Security Games},
  author    = {Nguyen, Thanh and Xu, Haifeng},
  booktitle = {Proceedings of the Twenty-Eighth International Joint Conference on
               Artificial Intelligence, {IJCAI-19}},
  publisher = {International Joint Conferences on Artificial Intelligence Organization},             
  pages     = {528--534},
  year      = {2019},
  month     = {7},
  doi       = {10.24963/ijcai.2019/75},
  url       = {https://doi.org/10.24963/ijcai.2019/75},
}


@inproceedings{gan2019manipulating,
  title={Manipulating a Learning Defender and Ways to Counteract},
  author={Gan, Jiarui and Guo, Qingyu and Tran-Thanh, Long and An, Bo and Wooldridge, Michael},
  booktitle={Advances in Neural Information Processing Systems},
  pages={8272--8281},
  year={2019}
}

@inproceedings{xu2015exploring,
  title={Exploring information asymmetry in two-stage security games},
  author={Xu, Haifeng and Rabinovich, Zinovi and Dughmi, Shaddin and Tambe, Milind},
  booktitle={Twenty-Ninth AAAI Conference on Artificial Intelligence},
  year={2015}
}

@inproceedings{yin2013optimal,
  title={Optimal deceptive strategies in security games: A preliminary study},
  author={Yin, Yue and An, Bo and Vorobeychik, Yevgeniy and Zhuang, Jun},
  booktitle={Proc. of AAAI},
  year={2013}
}

@inproceedings{schlenker2018deceiving,
  title={Deceiving cyber adversaries: A game theoretic approach},
  author={Schlenker, Aaron and Thakoor, Omkar and Xu, Haifeng and Fang, Fei and Tambe, Milind and Tran-Thanh, Long and Vayanos, Phebe and Vorobeychik, Yevgeniy},
  booktitle={Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems},
  pages={892--900},
  year={2018},
  organization={International Foundation for Autonomous Agents and Multiagent Systems}
}

@article{conforti2007minimally,
  title={Minimally infeasible set-partitioning problems with balanced constraints},
  author={Conforti, Michele and Summa, Marco Di and Zambelli, Giacomo},
  journal={Mathematics of Operations Research},
  volume={32},
  number={3},
  pages={497--507},
  year={2007},
  publisher={INFORMS}
}

@inproceedings{nedelec2019learning,
  title={Learning to Bid in Revenue Maximizing Auction},
  author={Nedelec, Thomas and El Karoui, Noureddine and Perchet, Vianney},
  booktitle={Companion Proceedings of The 2019 World Wide Web Conference},
  pages={934--935},
  year={2019}
}

@article{nedelec2018bidder,
  title={The bidder's standpoint: a simple way to improve bidding strategies in revenue-maximizing auctions},
  author={Nedelec, Thomas and Abeille, Marc and Calauz{\`e}nes, Cl{\'e}ment and Karoui, Noureddine El and Heymann, Benjamin and Perchet, Vianney},
  journal={arXiv preprint arXiv:1808.06979},
  year={2018}
}

@article{nedelec2019adversarial,
  title={Adversarial learning for revenue-maximizing auctions},
  author={Nedelec, Thomas and Baudet, Jules and Perchet, Vianney and Karoui, Noureddine El},
  journal={arXiv preprint arXiv:1909.06806},
  year={2019}
}

@inproceedings{braverman2018selling,
  title={Selling to a no-regret buyer},
  author={Braverman, Mark and Mao, Jieming and Schneider, Jon and Weinberg, Matt},
  booktitle={Proceedings of the 2018 ACM Conference on Economics and Computation},
  pages={523--538},
  year={2018}
}

@inproceedings{mohri2015revenue,
  title={Revenue optimization against strategic buyers},
  author={Mohri, Mehryar and Munoz, Andres},
  booktitle={Advances in Neural Information Processing Systems},
  pages={2530--2538},
  year={2015}
}

@article{turvey1969marginal,
	title={Marginal cost},
	author={Turvey, Ralph},
	journal={The Economic Journal},
	volume={79},
	number={314},
	pages={282--299},
	year={1969},
	publisher={JSTOR}
}

@article{beato1985marginal,
	title={On marginal cost pricing with given tax-subsidy rules},
	author={Beato, Paulina and Mas-Colell, Andreu},
	journal={Journal of Economic Theory},
	volume={37},
	number={2},
	pages={356--365},
	year={1985},
	publisher={Elsevier}
}

@book{krishna2009auction,
	title={Auction theory},
	author={Krishna, Vijay},
	year={2009},
	publisher={Academic press}
}

@book{mas1995microeconomic,
	title={Microeconomic theory},
	author={Mas-Colell, Andreu and Whinston, Michael Dennis and Green, Jerry R and others},
	volume={1},
	year={1995},
	publisher={Oxford university press New York}
}

@inproceedings{roughgarden2015prices,
	title={Why prices need algorithms},
	author={Roughgarden, Tim and Talgam-Cohen, Inbal},
	booktitle={Proceedings of the sixteenth acm conference on economics and computation},
	pages={19--36},
	year={2015}
}


@book{rubinstein2012lecture,
	title={Lecture notes in microeconomic theory: the economic agent},
	author={Rubinstein, Ariel},
	year={2012},
	publisher={Princeton University Press}
}

@article{samuelson1938note,
	title={A note on the pure theory of consumer's behaviour},
	author={Samuelson, Paul A},
	journal={Economica},
	volume={5},
	number={17},
	pages={61--71},
	year={1938},
	publisher={JSTOR}
}

@article{varian2006revealed,
	title={Revealed preference},
	author={Varian, Hal R},
	journal={Samuelsonian economics and the twenty-first century},
	pages={99--115},
	year={2006},
	publisher={Oxford University Press Oxford}
}

@article{afriat1967construction,
	title={The construction of utility functions from expenditure data},
	author={Afriat, Sydney N},
	journal={International economic review},
	volume={8},
	number={1},
	pages={67--77},
	year={1967},
	publisher={JSTOR}
}

@inproceedings{beigman2006learning,
	title={Learning from revealed preference},
	author={Beigman, Eyal and Vohra, Rakesh},
	booktitle={Proceedings of the 7th ACM Conference on Electronic Commerce},
	pages={36--42},
	year={2006}
}

@inproceedings{zadimoghaddam2012efficiently,
	title={Efficiently learning from revealed preference},
	author={Zadimoghaddam, Morteza and Roth, Aaron},
	booktitle={International Workshop on Internet and Network Economics},
	pages={114--127},
	year={2012},
	organization={Springer}
}

@article{cummings2016empirical,
	title={The empirical implications of privacy-aware choice},
	author={Cummings, Rachel and Echenique, Federico and Wierman, Adam},
	journal={Operations Research},
	volume={64},
	number={1},
	pages={67--78},
	year={2016},
	publisher={INFORMS}
}

@InProceedings{10.1007/978-3-642-10841-9_1,
	author="Muthukrishnan, S.",
	editor="Leonardi, Stefano",
	title="Ad Exchanges: Research Issues",
	booktitle="Internet and Network Economics",
	year="2009",
	pages="1--12",
	abstract="An emerging way to sell and buy display ads on the Internet is via ad exchanges. RightMedia [1], AdECN [2] and DoubleClick Ad Exchange [3] are examples of such real-time two-sided markets. We describe an abstraction of this market. Based on that abstraction, we present several research directions and discuss some insights.",
	isbn="978-3-642-10841-9"
}

@inproceedings{hata2017glimpse,
	title={A glimpse far into the future: Understanding long-term crowd worker quality},
	author={Hata, Kenji and Krishna, Ranjay and Fei-Fei, Li and Bernstein, Michael S},
	booktitle={Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing},
	pages={889--901},
	year={2017}
}

@article{babaioff2015dynamic,
	title={Dynamic pricing with limited supply},
	author={Babaioff, Moshe and Dughmi, Shaddin and Kleinberg, Robert and Slivkins, Aleksandrs},
	journal={ACM Transactions on Economics and Computation (TEAC)},
	volume={3},
	number={1},
	pages={1--26},
	year={2015},
	publisher={ACM New York, NY, USA}
}

@article{besbes2009dynamic,
	title={Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms},
	author={Besbes, Omar and Zeevi, Assaf},
	journal={Operations Research},
	volume={57},
	number={6},
	pages={1407--1420},
	year={2009},
	publisher={INFORMS}
}

@article{broder2012dynamic,
	title={Dynamic pricing under a general parametric choice model},
	author={Broder, Josef and Rusmevichientong, Paat},
	journal={Operations Research},
	volume={60},
	number={4},
	pages={965--980},
	year={2012},
	publisher={INFORMS}
}

@article{den2014simultaneously,
	title={Simultaneously learning and optimizing using controlled variance pricing},
	author={den Boer, Arnoud V and Zwart, Bert},
	journal={Management science},
	volume={60},
	number={3},
	pages={770--783},
	year={2014},
	publisher={Informs}
}

@article{keskin2014dynamic,
	title={Dynamic pricing with an unknown demand model: Asymptotically optimal semi-myopic policies},
	author={Keskin, N Bora and Zeevi, Assaf},
	journal={Operations Research},
	volume={62},
	number={5},
	pages={1142--1167},
	year={2014},
	publisher={INFORMS}
}

@article{wang2014close,
	title={Close the gaps: A learning-while-doing algorithm for single-product revenue management problems},
	author={Wang, Zizhuo and Deng, Shiming and Ye, Yinyu},
	journal={Operations Research},
	volume={62},
	number={2},
	pages={318--331},
	year={2014},
	publisher={INFORMS}
}

@inproceedings{balcan2014learning,
	title={Learning economic parameters from revealed preferences},
	author={Balcan, Maria-Florina and Daniely, Amit and Mehta, Ruta and Urner, Ruth and Vazirani, Vijay V},
	booktitle={International Conference on Web and Internet Economics},
	pages={338--353},
	year={2014},
	organization={Springer}
}

@inproceedings{nguyen2019imitative,
	title={Imitative attacker deception in stackelberg security games},
	author={Nguyen, Thanh H and Xu, Haifeng},
	booktitle={Proceedings of the 28th International Joint Conference on Artificial Intelligence},
	pages={528--534},
	year={2019},
	organization={AAAI Press}
}

@article{castillo2019general,
	title={A General Revealed Preference Test for Quasi-Linear Preferences: Theory and Experiments},
	author={Castillo, Marco and Freer, Mikhail},
	journal={Available at SSRN 3397767},
	year={2019}
}

@article{brown2007nonparametric,
	title={The nonparametric approach to applied welfare analysis},
	author={Brown, Donald J and Calsamiglia, Caterina},
	journal={Economic Theory},
	volume={31},
	number={1},
	pages={183--188},
	year={2007},
	publisher={Springer}
}

@article{korula2015optimizing,
	title={Optimizing display advertising markets: Challenges and directions},
	author={Korula, Nitish and Mirrokni, Vahab and Nazerzadeh, Hamid},
	journal={IEEE Internet Computing},
	volume={20},
	number={1},
	pages={28--35},
	year={2015},
	publisher={IEEE}
}

@article{li2014consumers,
	title={Are consumers strategic? Structural estimation from the air-travel industry},
	author={Li, Jun and Granados, Nelson and Netessine, Serguei},
	journal={Management Science},
	volume={60},
	number={9},
	pages={2114--2137},
	year={2014},
	publisher={INFORMS}
}

@article{rockafellar1966characterization,
	title={Characterization of the subdifferentials of convex functions},
	author={Rockafellar, Ralph},
	journal={Pacific Journal of Mathematics},
	volume={17},
	number={3},
	pages={497--510},
	year={1966},
	publisher={Mathematical Sciences Publishers}
}

@article{rockafellar1970maximal,
	title={On the maximal monotonicity of subdifferential mappings},
	author={Rockafellar, Ralph},
	journal={Pacific Journal of Mathematics},
	volume={33},
	number={1},
	pages={209--216},
	year={1970},
	publisher={Mathematical Sciences Publishers}
}

@inproceedings{dutting2019simple,
  title={Simple versus optimal contracts},
  author={D{\"u}tting, Paul and Roughgarden, Tim and Talgam-Cohen, Inbal},
  booktitle={Proceedings of the 2019 ACM Conference on Economics and Computation},
  pages={369--387},
  year={2019}
}

@inproceedings{dutting2020complexity,
  title={The complexity of contracts},
  author={D{\"u}tting, Paul and Roughgarden, Tim and Cohen, Inbal-Talgam},
  booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages={2688--2707},
  year={2020},
  organization={SIAM}
}

@inproceedings{daniely2014optimal,
  title={Optimal learners for multiclass problems},
  author={Daniely, Amit and Shalev-Shwartz, Shai},
  booktitle={Conference on Learning Theory},
  pages={287--316},
  year={2014},
  organization={PMLR}
}

@inproceedings{daniely2011multiclass,
  title={Multiclass learnability and the erm principle},
  author={Daniely, Amit and Sabato, Sivan and Ben-David, Shai and Shalev-Shwartz, Shai},
  booktitle={Proceedings of the 24th Annual Conference on Learning Theory},
  pages={207--232},
  year={2011},
  organization={JMLR Workshop and Conference Proceedings}
}

@inproceedings{NEURIPS2020_ba5451d3,
 author = {Castiglioni, Matteo and Celli, Andrea and Marchesi, Alberto and Gatti, Nicola},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {H. Larochelle and M. Ranzato and R. Hadsell and M. F. Balcan and H. Lin},
 pages = {16188--16198},
 publisher = {Curran Associates, Inc.},
 title = {Online Bayesian Persuasion},
 url = {https://proceedings.neurips.cc/paper/2020/file/ba5451d3c91a0f982f103cdbe249bc78-Paper.pdf},
 volume = {33},
 year = {2020}
}

@article{10.1257/aer.101.6.2590,
Author = {Kamenica, Emir and Gentzkow, Matthew},
Title = {Bayesian Persuasion},
Journal = {American Economic Review},
Volume = {101},
Number = {6},
Year = {2011},
Month = {October},
Pages = {2590-2615},
DOI = {10.1257/aer.101.6.2590},
URL = {https://www.aeaweb.org/articles?id=10.1257/aer.101.6.2590}}

@article{pita2010robust,
  title={Robust solutions to stackelberg games: Addressing bounded rationality and limited observations in human cognition},
  author={Pita, James and Jain, Manish and Tambe, Milind and Ord{\'o}nez, Fernando and Kraus, Sarit},
  journal={Artificial Intelligence},
  volume={174},
  number={15},
  pages={1142--1171},
  year={2010},
  publisher={Elsevier}
}

@inproceedings{muthukumar2019robust,
  title={Robust Commitments and Partial Reputation},
  author={Muthukumar, Vidya and Sahai, Anant},
  booktitle={Proceedings of the 2019 ACM Conference on Economics and Computation},
  pages={637--638},
  year={2019}
}

@article{bai2021sample,
  title={Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games},
  author={Bai, Yu and Jin, Chi and Wang, Huan and Xiong, Caiming},
  journal={arXiv preprint arXiv:2102.11494},
  year={2021}
}

@article{ling2018game,
  title={What game are we playing? end-to-end learning in normal and extensive form games},
  author={Ling, Chun Kai and Fang, Fei and Kolter, J Zico},
  journal={arXiv preprint arXiv:1805.02777},
  year={2018}
}

@inproceedings{cerny2020dinkelbach,
  title={Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium.},
  author={Cern{\`y}, Jakub and Lis{\`y}, Viliam and Bosansk{\`y}, Branislav and An, Bo},
  booktitle={IJCAI},
  pages={246--253},
  year={2020}
}

@inproceedings{yang2012computing,
  title={Computing optimal strategy against quantal response in security games.},
  author={Yang, Rong and Ordonez, Fernando and Tambe, Milind},
  booktitle={AAMAS},
  pages={847--854},
  year={2012}
}

@inproceedings{barman2014existence,
  title={On the existence of low-rank explanations for mixed strategy behavior},
  author={Barman, Siddharth and Bhaskar, Umang and Echenique, Federico and Wierman, Adam},
  booktitle={International Conference on Web and Internet Economics},
  pages={447--452},
  year={2014},
  organization={Springer}
}

@inproceedings{kuleshov2015inverse,
  title={Inverse game theory: Learning utilities in succinct games},
  author={Kuleshov, Volodymyr and Schrijvers, Okke},
  booktitle={International Conference on Web and Internet Economics},
  pages={413--427},
  year={2015},
  organization={Springer}
}

@inproceedings{barman2013empirical,
  title={The empirical implications of rank in bimatrix games},
  author={Barman, Siddharth and Bhaskar, Umang and Echenique, Federico and Wierman, Adam},
  booktitle={Proceedings of the fourteenth ACM conference on Electronic commerce},
  pages={55--72},
  year={2013}
}

@article{lee2012testable,
  title={The testable implications of zero-sum games},
  author={Lee, SangMok},
  journal={Journal of Mathematical Economics},
  volume={48},
  number={1},
  pages={39--46},
  year={2012},
  publisher={Elsevier}
}

@article{sprumont2000testable,
  title={On the testable implications of collective choice theories},
  author={Sprumont, Yves},
  journal={Journal of Economic Theory},
  volume={93},
  number={2},
  pages={205--232},
  year={2000},
  publisher={Elsevier}
}

@article{dawkins2021limits,
  title={The Limits of Optimal Pricing in the Dark},
  author={Dawkins, Quinlan and Han, Minbiao and Xu, Haifeng},
  journal={Advances in Neural Information Processing Systems},
  volume={34},
  pages={26649--26660},
  year={2021}
}

@inproceedings{ghalme2021strategic,
  title={Strategic classification in the dark},
  author={Ghalme, Ganesh and Nair, Vineet and Eilat, Itay and Talgam-Cohen, Inbal and Rosenfeld, Nir},
  booktitle={International Conference on Machine Learning},
  pages={3672--3681},
  year={2021},
  organization={PMLR}
}

@article{cplex2009v12,
  title={V12. 1: User’s Manual for CPLEX},
  author={Cplex, IBM ILOG},
  journal={International Business Machines Corporation},
  volume={46},
  number={53},
  pages={157},
  year={2009}
}

@article{chen2020learning,
  title={Learning strategy-aware linear classifiers},
  author={Chen, Yiling and Liu, Yang and Podimata, Chara},
  journal={Advances in Neural Information Processing Systems},
  volume={33},
  pages={15265--15276},
  year={2020}
}

@article{castiglioni2020online,
  title={Online bayesian persuasion},
  author={Castiglioni, Matteo and Celli, Andrea and Marchesi, Alberto and Gatti, Nicola},
  journal={Advances in Neural Information Processing Systems},
  volume={33},
  pages={16188--16198},
  year={2020}
}

@article{babichenko2022regret,
  title={Regret-minimizing bayesian persuasion},
  author={Babichenko, Yakov and Talgam-Cohen, Inbal and Xu, Haifeng and Zabarnyi, Konstantin},
  journal={Games and Economic Behavior},
  year={2022},
  publisher={Elsevier}
}

@inproceedings{zu2021learning,
  title={Learning to persuade on the fly: Robustness against ignorance},
  author={Zu, You and Iyer, Krishnamurthy and Xu, Haifeng},
  booktitle={Proceedings of the 22nd ACM Conference on Economics and Computation},
  pages={927--928},
  year={2021}
}

@article{blum2015learning,
  title={Learning to play stackelberg security games},
  author={Blum, Avrim and Haghtalab, Nika and Procaccia, Ariel D},
  year={2015}
}

@inproceedings{roughgarden2001stackelberg,
  title={Stackelberg scheduling strategies},
  author={Roughgarden, Tim},
  booktitle={Proceedings of the thirty-third annual ACM symposium on Theory of computing},
  pages={104--113},
  year={2001}
}

@inproceedings{xu2016playing,
  title={Playing Repeated Security Games with No Prior Knowledge.},
  author={Xu, Haifeng and Tran-Thanh, Long and Jennings, Nicholas R},
  booktitle={AAMAS},
  pages={104--112},
  year={2016}
}

@inproceedings{dawkins2022first,
  title={First-Order Convex Fitting and Its Application to Economics and Optimization},
  author={Dawkins, Quinlan and Han, Minbiao and Xu, Haifeng},
  booktitle={Proceedings of the AAAI Conference on Artificial Intelligence},
  volume={36},
  number={6},
  pages={6480--6487},
  year={2022}
}

@inproceedings{sinha2018stackelberg,
  title={Stackelberg security games: Looking beyond a decade of success},
  author={Sinha, Arunesh and Fang, Fei and An, Bo and Kiekintveld, Christopher and Tambe, Milind},
  year={2018},
  organization={IJCAI}
}

@article{moore1988subgame,
  title={Subgame perfect implementation},
  author={Moore, John and Repullo, Rafael},
  journal={Econometrica: Journal of the Econometric Society},
  pages={1191--1220},
  year={1988},
  publisher={JSTOR}
}

@article{kakade2013optimal,
  title={Optimal dynamic mechanism design and the virtual-pivot mechanism},
  author={Kakade, Sham M and Lobel, Ilan and Nazerzadeh, Hamid},
  journal={Operations Research},
  volume={61},
  number={4},
  pages={837--854},
  year={2013},
  publisher={INFORMS}
}

@article{fudenberg1983subgame,
  title={Subgame-perfect equilibria of finite-and infinite-horizon games},
  author={Fudenberg, Drew and Levine, David},
  journal={Journal of Economic Theory},
  volume={31},
  number={2},
  pages={251--268},
  year={1983},
  publisher={Elsevier}
}

@inproceedings{vu2022stackelberg,
  title={Stackelberg Policy Gradient: Evaluating the Performance of Leaders and Followers},
  author={Vu, Quoc-Liem and Alumbaugh, Zane and Ching, Ryan and Ding, Quanchen and Mahajan, Arnav and Chasnov, Benjamin and Burden, Sam and Ratliff, Lillian J},
  booktitle={ICLR 2022 Workshop on Gamification and Multiagent Solutions},
  year={2022}
}

@article{chang2015leader,
  title={A leader--follower partially observed, multiobjective Markov game},
  author={Chang, Yanling and Erera, Alan L and White, Chelsea C},
  journal={Annals of Operations Research},
  volume={235},
  number={1},
  pages={103--128},
  year={2015},
  publisher={Springer}
}

@article{bensoussan2015maximum,
  title={The maximum principle for global solutions of stochastic Stackelberg differential games},
  author={Bensoussan, Alain and Chen, Shaokuan and Sethi, Suresh P},
  journal={SIAM Journal on Control and Optimization},
  volume={53},
  number={4},
  pages={1956--1981},
  year={2015},
  publisher={SIAM}
}

@article{maskin2001markov,
  title={Markov perfect equilibrium: I. Observable actions},
  author={Maskin, Eric and Tirole, Jean},
  journal={Journal of Economic Theory},
  volume={100},
  number={2},
  pages={191--219},
  year={2001},
  publisher={Elsevier}
}

@article{shapley1953stochastic,
  title={Stochastic games},
  author={Shapley, Lloyd S},
  journal={Proceedings of the national academy of sciences},
  volume={39},
  number={10},
  pages={1095--1100},
  year={1953},
  publisher={National Acad Sciences}
}

@inproceedings{vorobeychik2012computing,
  title={Computing stackelberg equilibria in discounted stochastic games},
  author={Vorobeychik, Yevgeniy and Singh, Satinder},
  booktitle={Proceedings of the AAAI Conference on Artificial Intelligence},
  volume={26},
  number={1},
  pages={1478--1484},
  year={2012}
}

@article{hart1992games,
  title={Games in extensive and strategic forms},
  author={Hart, Sergiu},
  journal={Handbook of game theory with economic applications},
  volume={1},
  pages={19--40},
  year={1992},
  publisher={Elsevier}
}

@article{roth1995learning,
  title={Learning in extensive-form games: Experimental data and simple dynamic models in the intermediate term},
  author={Roth, Alvin E and Erev, Ido},
  journal={Games and economic behavior},
  volume={8},
  number={1},
  pages={164--212},
  year={1995},
  publisher={Elsevier}
}

@inproceedings{yang2014adaptive,
  title={Adaptive resource allocation for wildlife protection against illegal poachers.},
  author={Yang, Rong and Ford, Benjamin J and Tambe, Milind and Lemieux, Andrew},
  booktitle={Aamas},
  pages={453--460},
  year={2014}
}

@book{bolton2004contract,
  title={Contract theory},
  author={Bolton, Patrick and Dewatripont, Mathias},
  year={2004},
  publisher={MIT press}
}

@article{holmstrom1979moral,
  title={Moral hazard and observability},
  author={Holmstr{\"o}m, Bengt},
  journal={The Bell journal of economics},
  pages={74--91},
  year={1979},
  publisher={JSTOR}
}

@article{goktas2022zero,
  title={Zero-Sum Stochastic Stackelberg Games},
  author={Goktas, Denizalp and Zhao, Jiayi and Greenwald, Amy},
  journal={arXiv preprint arXiv:2211.13847},
  year={2022}
}

@article{vickrey1961counterspeculation,
  title={Counterspeculation, auctions, and competitive sealed tenders},
  author={Vickrey, William},
  journal={The Journal of finance},
  volume={16},
  number={1},
  pages={8--37},
  year={1961},
  publisher={JSTOR}
}

@article{varian2009online,
  title={Online ad auctions},
  author={Varian, Hal R},
  journal={American Economic Review},
  volume={99},
  number={2},
  pages={430--34},
  year={2009}
}

@article{arieli2015commitments,
  title={Commitments in Extensive Form Games},
  author={Arieli, Itai},
  year={2015}
}

@inproceedings{aggarwal2006truthful,
  title={Truthful auctions for pricing search keywords},
  author={Aggarwal, Gagan and Goel, Ashish and Motwani, Rajeev},
  booktitle={Proceedings of the 7th ACM Conference on Electronic Commerce},
  pages={1--7},
  year={2006}
}

@inproceedings{zhang2023learning,
  title={Learning regions of interest for Bayesian optimization with adaptive level-set estimation},
  author={Zhang, Fengxue and Song, Jialin and Bowden, James C and Ladd, Alexander and Yue, Yisong and Desautels, Thomas and Chen, Yuxin},
  booktitle={International Conference on Machine Learning},
  pages={41579--41595},
  year={2023},
  organization={PMLR}
}
@inproceedings{gotovos2013active,
  title={Active learning for level set estimation},
  author={Gotovos, Alkis and Casati, Nathalie and Hitz, Gregory and Krause, Andreas},
  booktitle={Proceedings of the Twenty-Third international joint conference on Artificial Intelligence},
  pages={1344--1350},
  year={2013}
}

@article{koepernik2021consistency,
  title={Consistency of Gaussian process regression in metric spaces},
  author={Koepernik, Peter and Pfaff, Florian},
  journal={The Journal of Machine Learning Research},
  volume={22},
  number={1},
  pages={11066--11092},
  year={2021},
  publisher={JMLRORG}
}

@inproceedings{mcintire2016sparse,
  title={Sparse Gaussian Processes for Bayesian Optimization.},
  author={McIntire, Mitchell and Ratner, Daniel and Ermon, Stefano},
  booktitle={UAI},
  year={2016}
}

@inproceedings{moss2023inducing,
  title={Inducing point allocation for sparse gaussian processes in high-throughput bayesian optimisation},
  author={Moss, Henry B and Ober, Sebastian W and Picheny, Victor},
  booktitle={International Conference on Artificial Intelligence and Statistics},
  pages={5213--5230},
  year={2023},
  organization={PMLR}
}

@article{song2022monte,
  title={Monte Carlo Tree Search based Variable Selection for High Dimensional Bayesian Optimization},
  author={Song, Lei and Xue, Ke and Huang, Xiaobin and Qian, Chao},
  journal={arXiv preprint arXiv:2210.01628},
  year={2022}
}

@article{wang2016bayesian,
  title={Bayesian optimization in a billion dimensions via random embeddings},
  author={Wang, Ziyu and Hutter, Frank and Zoghi, Masrour and Matheson, David and de Feitas, Nando},
  journal={Journal of Artificial Intelligence Research},
  volume={55},
  pages={361--387},
  year={2016}
}

@inproceedings{HeSBO19,
  author    = {Alex Munteanu and
               Amin Nayebi and
			   Matthias Poloczek},
  title     = {A Framework for Bayesian Optimization in Embedded Subspaces},
  booktitle = {Proceedings of the 36th International Conference on Machine Learning, {(ICML)}},
  year      = {2019},
  note={Accepted for publication. The code is available at https://github.com/aminnayebi/HesBO.}
}

@article{daskalakis2021near,
  title={Near-optimal no-regret learning in general games},
  author={Daskalakis, Constantinos and Fishelson, Maxwell and Golowich, Noah},
  journal={Advances in Neural Information Processing Systems},
  volume={34},
  pages={27604--27616},
  year={2021}
}

@inproceedings{Letham2020Re,
    author    = {Letham, Benjamin and Calandra, Roberto and Rai, Akshara and Bakshy, Eytan},        
    title     = {Re-Examining Linear Embeddings for High-Dimensional {B}ayesian Optimization},
    booktitle   = {Advances in Neural Information Processing Systems 33},
    year      = {2020},
    series = {NeurIPS},
}

@inproceedings{papenmeier2022increasing,
  title={Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces},
  author={Papenmeier, Leonard and Nardi, Luigi and Poloczek, Matthias},
  booktitle={Advances in Neural Information Processing Systems},
  year={2022}
}

@article{srinivas2009gaussian,
  title={Gaussian process optimization in the bandit setting: No regret and experimental design},
  author={Srinivas, Niranjan and Krause, Andreas and Kakade, Sham M and Seeger, Matthias},
  journal={arXiv preprint arXiv:0912.3995},
  year={2009}
}

@article{chapman2013convergent,
  title={Convergent learning algorithms for unknown reward games},
  author={Chapman, Archie C and Leslie, David S and Rogers, Alex and Jennings, Nicholas R},
  journal={SIAM Journal on Control and Optimization},
  volume={51},
  number={4},
  pages={3154--3180},
  year={2013},
  publisher={SIAM}
}

@article{mackay1992information,
  title={Information-based objective functions for active data selection},
  author={MacKay, David JC},
  journal={Neural computation},
  volume={4},
  number={4},
  pages={590--604},
  year={1992},
  publisher={MIT Press One Rogers Street, Cambridge, MA 02142-1209, USA journals-info~…}
}

@article{buathong2023bayesian,
  title={Bayesian Optimization of Function Networks with Partial Evaluations},
  author={Buathong, Poompol and Wan, Jiayue and Daulton, Samuel and Astudillo, Raul and Balandat, Maximilian and Frazier, Peter I},
  journal={arXiv preprint arXiv:2311.02146},
  year={2023}
}

@article{astudillo2021bayesian,
  title={Bayesian optimization of function networks},
  author={Astudillo, Raul and Frazier, Peter},
  journal={Advances in neural information processing systems},
  volume={34},
  pages={14463--14475},
  year={2021}
}

@article{sussex2022model,
  title={Model-based causal Bayesian optimization},
  author={Sussex, Scott and Makarova, Anastasiia and Krause, Andreas},
  journal={arXiv preprint arXiv:2211.10257},
  year={2022}
}

@inproceedings{wilson2016deep,
  title={Deep kernel learning},
  author={Wilson, Andrew Gordon and Hu, Zhiting and Salakhutdinov, Ruslan and Xing, Eric P},
  booktitle={Artificial intelligence and statistics},
  pages={370--378},
  year={2016},
  organization={PMLR}
}

@article{zhang2022learning,
  title={Learning representation for bayesian optimization with collision-free regularization},
  author={Zhang, Fengxue and Nord, Brian and Chen, Yuxin},
  journal={arXiv preprint arXiv:2203.08656},
  year={2022}
}