% Textbook
 
@inproceedings{fu2022pandora,
  title={Pandora box problem with nonobligatory inspection: Hardness and approximation scheme},
  author={Fu, Hu and Li, Jiawei and Liu, Daogao},
  booktitle={Proceedings of the 55th Annual ACM Symposium on Theory of Computing},
  pages={789--802},
  year={2023}
}


@article{rudin2022interpretable,
  title={Interpretable machine learning: Fundamental principles and 10 grand challenges},
  author={Rudin, Cynthia and Chen, Chaofan and Chen, Zhi and Huang, Haiyang and Semenova, Lesia and Zhong, Chudi},
  journal={Statistics Surveys},
  volume={16},
  pages={1--85},
  year={2022},
  publisher={Amer. Statist. Assoc., the Bernoulli Soc., the Inst. Math. Statist., and the~…}
}


@book{russell2010artificial,
  title={Artificial intelligence a modern approach},
  author={Russell, Stuart J},
  year={2010},
  publisher={Pearson Education, Inc.}
}

@book{bertsekas2019reinforcement,
  title={Reinforcement learning and optimal control},
  author={Bertsekas, Dimitri},
  year={2019},
  publisher={Athena Scientific}
}

@article{bravo2020mining,
  title={Mining optimal policies: A pattern recognition approach to model analysis},
  author={Bravo, Fernanda and Shaposhnik, Yaron},
  journal={INFORMS Journal on Optimization},
  volume={2},
  number={3},
  pages={145--166},
  year={2020},
  publisher={INFORMS}
}
@article{guha2008information,
  title={Information acquisition and exploitation in multichannel wireless networks},
  author={Guha, Sudipto and Munagala, Kamesh and Sarkar, Saswati},
  journal={arXiv preprint arXiv:0804.1724},
  year={2008}
}
@article{bertsimas1996conservation,
  title={Conservation laws, extended polymatroids and multiarmed bandit problems; a polyhedral approach to indexable systems},
  author={Bertsimas, Dimitris and Nino-Mora, Jos{\'e}},
  journal={Mathematics of Operations Research},
  volume={21},
  number={2},
  pages={257--306},
  year={1996},
  publisher={INFORMS}
}

@book{bertsekas1995dynamic,
  title={Dynamic programming and optimal control},
  author={Bertsekas, Dimitri P},
  volume={1},
  number={2},
  year={1995},
  publisher={Athena Scientific Belmont, MA}
}
@article{ursu2018power,
  title={The power of rankings: Quantifying the effect of rankings on online consumer search and purchase decisions},
  author={Ursu, Raluca M},
  journal={Marketing Science},
  volume={37},
  number={4},
  pages={530--552},
  year={2018},
  publisher={INFORMS}
}

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

@article{wolinsky1986true,
  title={True monopolistic competition as a result of imperfect information},
  author={Wolinsky, Asher},
  journal={The Quarterly Journal of Economics},
  volume={101},
  number={3},
  pages={493--511},
  year={1986},
  publisher={MIT Press}
}

@article{johnson2006simple,
  title={On the simple economics of advertising, marketing, and product design},
  author={Johnson, Justin P and Myatt, David P},
  journal={American Economic Review},
  volume={96},
  number={3},
  pages={756--784},
  year={2006}
}



% Pandora's Problem:
@book{powell2007approximate,
  title={Approximate Dynamic Programming: Solving the curses of dimensionality},
  author={Powell, Warren B},
  volume={703},
  year={2007},
  publisher={John Wiley \& Sons}
}



@inproceedings{derakhshan2018product,
author = {Derakhshan, Mahsa and Golrezaei, Negin and Manshadi, Vahideh and Mirrokni, Vahab},
title = {Product Ranking on Online Platforms},
year = {2020},
isbn = {9781450379755},
publisher = {Association for Computing Machinery},
booktitle = {Proceedings of the 21st ACM Conference on Economics and Computation},
pages = {459},
numpages = {1},
keywords = {two-stage consumer search, product ranking, search costs, online platforms},
location = {Virtual Event, Hungary},
series = {EC '20}
}

@article{weitzman1979optimal,
  title={Optimal search for the best alternative},
  author={Weitzman, Martin L},
  journal={Econometrica: Journal of the Econometric Society},
  pages={641--654},
  year={1979},
  publisher={JSTOR}
}

@inproceedings{kleinberg2016descending,
  title={Descending Price Optimally Coordinates Search},
  author={Kleinberg, Robert and Waggoner, Bo and Weyl, E Glen},
  booktitle={Proceedings of the 2016 ACM Conference on Economics and Computation},
  pages={23--24},
  year={2016}
}

@inproceedings{beyhaghi2019pandora,
  title={Pandora's Problem with Nonobligatory Inspection},
  author={Beyhaghi, Hedyeh and Kleinberg, Robert},
  booktitle={Proceedings of the 2019 ACM Conference on Economics and Computation},
  pages={131--132},
  year={2019}
}

@phdthesis{beyhaghi2019approximately,
  title={Approximately-Optimal Mechanisms in Auction Design, Search Theory, and Matching Markets},
  author={Beyhaghi, Hedyeh},
  year={2019},
  school={Cornell University}
}


@article{attias2017stochastic,
  title={Stochastic Selection Problems with Testing},
  author={Attias, Chen and Krauthgamer, Robert and Levi, Retsef and Shaposhnik, Yaron},
  journal={Available at SSRN 3076956},
  year={2017}
}

@article{doval2018whether,
  title={Whether or not to open Pandora's box},
  author={Doval, Laura},
  journal={Journal of Economic Theory},
  volume={175},
  pages={127--158},
  year={2018},
  publisher={Elsevier}
}

@article{olszewski2015more,
  title={A more general Pandora rule?},
  author={Olszewski, Wojciech and Weber, Richard},
  journal={Journal of Economic Theory},
  volume={160},
  pages={429--437},
  year={2015},
  publisher={Elsevier}
}



@inproceedings{boodaghians2020pandora,
author = {Boodaghians, Shant and Fusco, Federico and Lazos, Philip and Leonardi, Stefano},
title = {Pandora's Box Problem with Order Constraints},
year = {2020},
booktitle = {ACM Conference on Economics and Computation (EC'20)},
publisher = {Association for Computing Machinery},
url = {https://doi.org/10.1145/3391403.3399501},
pages = {439–458},
keywords = {pricing, stochastic search, reservation prices, Pandora's problem, revenue maximization},
}

@ARTICLE{2015arXiv150909095O,
       author = {{Olszewski}, Wojciech and {Weber}, Richard},
        title = "{A more general Pandora's rule?}",
      journal = {arXiv e-prints},
     keywords = {Mathematics - Optimization and Control},
         year = 2015,
        month = sep,
          eid = {arXiv:1509.09095},
        pages = {arXiv:1509.09095},
archivePrefix = {arXiv},
       eprint = {1509.09095},
 primaryClass = {math.OC},
       adsurl = {https://ui.adsabs.harvard.edu/abs/2015arXiv150909095O},
      adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}

% Online Pandora
@inproceedings{esfandiari2019online,
  title={Online Pandora’s Boxes and Bandits},
  author={Esfandiari, Hossein and HajiAghayi, MohammadTaghi and Lucier, Brendan and Mitzenmacher, Michael},
  booktitle={Proceedings of the AAAI Conference on Artificial Intelligence},
  volume={33},
  pages={1885--1892},
  year={2019}
}

@article{krengel1977semiamarts,
  title={Semiamarts and finite values},
  author={Krengel, Ulrich and Sucheston, Louis},
  journal={Bulletin of the American Mathematical Society},
  volume={83},
  number={4},
  pages={745--747},
  year={1977}
}

@article{immorlica2020information,
  title={Information Acquisition in Matching Markets: The Role of Price Discovery},
  author={Immorlica, Nicole and Leshno, Jacob and Lo, Irene and Lucier, Brendan},
  journal={Available at SSRN},
  year={2020}
}

@inproceedings{kleinberg2012matroid,
  title={Matroid prophet inequalities},
  author={Kleinberg, Robert and Weinberg, Seth Matthew},
  booktitle={Proceedings of the forty-fourth annual ACM symposium on Theory of computing},
  pages={123--136},
  year={2012}
}

@incollection{dutting2015polymatroid,
  title={Polymatroid prophet inequalities},
  author={D{\"u}tting, Paul and Kleinberg, Robert},
  booktitle={Algorithms-ESA 2015},
  pages={437--449},
  year={2015},
  publisher={Springer}
}


@inproceedings{azar2014prophet,
  title={Prophet inequalities with limited information},
  author={Azar, Pablo D and Kleinberg, Robert and Weinberg, S Matthew},
  booktitle={Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms},
  pages={1358--1377},
  year={2014},
  organization={SIAM}
}



% Batch testing:
@article{vishwanath1992parallel,
  title={Parallel search for the best alternative},
  author={Vishwanath, Tara},
  journal={Economic Theory},
  pages={495--507},
  year={1992},
  publisher={JSTOR}
}

% Combinatorial optimization:

@inproceedings{singla2018price,
  title={The price of information in combinatorial optimization},
  author={Singla, Sahil},
  booktitle={Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages={2523--2532},
  year={2018},
  organization={SIAM}
}


% Submodular optimizations:

@inproceedings{gupta2017adaptivity,
  title={Adaptivity gaps for stochastic probing: Submodular and XOS functions},
  author={Gupta, Anupam and Nagarajan, Viswanath and Singla, Sahil},
  booktitle={Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages={1688--1702},
  year={2017},
  organization={SIAM}
}

@article{goel2010probe,
  title={How to probe for an extreme value},
  author={Goel, Ashish and Guha, Sudipto and Munagala, Kamesh},
  journal={ACM Transactions on Algorithms (TALG)},
  volume={7},
  number={1},
  pages={1--20},
  year={2010},
  publisher={ACM New York, NY, USA}
}
% Gittin's index:
@article{Gittins1979bandit,
  title={Bandit processes and dynamic allocation indices},
  author={Gittins, John C},
  journal={Journal of the Royal Statistical Society: Series B (Methodological)},
  volume={41},
  number={2},
  pages={148--164},
  year={1979},
  publisher={Wiley Online Library}
}

@article{glazebrook1982sufficient,
  title={On a sufficient condition for superprocesses due to Whittle},
  author={Glazebrook, Kevin D},
  journal={Journal of Applied Probability},
  volume={19},
  number={1},
  pages={99--110},
  year={1982},
  publisher={Cambridge University Press}
}

@article{Weber1992On,
  title={On the Gittins Index for Multiarmed Bandits},
  author={Weber, Richard},
  journal={Annals of Applied Probability},
  volume={2},
  number={4},
  pages={1024-1033},
  year={1992},
}

@article{whittle1980multi,
  title={Multi-armed bandits and the Gittins index},
  author={Whittle, Peter},
  journal={Journal of the Royal Statistical Society: Series B (Methodological)},
  volume={42},
  number={2},
  pages={143--149},
  year={1980},
  publisher={Wiley Online Library}
}

@book{gittins2011multi,
  title={Multi-armed bandit allocation indices},
  author={Gittins, John and Glazebrook, Kevin and Weber, Richard},
  year={2011},
  publisher={John Wiley \& Sons}
}

@article{brown2013optimal,
  title={Optimal sequential exploration: Bandits, clairvoyants, and wildcats},
  author={Brown, David B and Smith, James E},
  journal={Operations Research},
  volume={61},
  number={3},
  pages={644--665},
  year={2013},
  publisher={INFORMS}
}


@article{balseiro2019approximations,
  title={Approximations to stochastic dynamic programs via information relaxation duality},
  author={Balseiro, Santiago R and Brown, David B},
  journal={Operations Research},
  volume={67},
  number={2},
  pages={577--597},
  year={2019},
  publisher={INFORMS}
}

@inproceedings{pandey2007multi,
  title={Multi-armed bandit problems with dependent arms},
  author={Pandey, Sandeep and Chakrabarti, Deepayan and Agarwal, Deepak},
  booktitle={Proceedings of the 24th International Conference on Machine Learning},
  pages={721--728},
  year={2007}
}

@article{banks1994switching,
  title={Switching costs and the Gittins index},
  author={Banks, Jeffrey S and Sundaram, Rangarajan K},
  journal={Econometrica: Journal of the Econometric Society},
  pages={687--694},
  year={1994},
  publisher={JSTOR}
}

@article{asawa1996multi,
  title={Multi-armed bandits with switching penalties},
  author={Asawa, Manjari and Teneketzis, Demosthenis},
  journal={IEEE Transactions on Automatic Control},
  volume={41},
  number={3},
  pages={328--348},
  year={1996},
  publisher={IEEE}
}

@article{glazebrook2002index,
  title={Index policies for a class of discounted restless bandits},
  author={Glazebrook, KD and Nino-Mora, J and Ansell, PS},
  journal={Advances in Applied Probability},
  pages={754--774},
  year={2002},
  publisher={JSTOR}
}

@article{eick1988gittins,
  title={Gittins procedures for bandits with delayed responses},
  author={Eick, Stephen G},
  journal={Journal of the Royal Statistical Society: Series B (Methodological)},
  volume={50},
  number={1},
  pages={125--132},
  year={1988},
  publisher={Wiley Online Library}
}

% Search and surveillance

@article{clarkson2020fast,
  title={Fast or Slow: Search in Discrete Locations with Two Search Modes},
  author={Clarkson, Jake and Glazebrook, Kevin D and Lin, Kyle Y},
  journal={Operations Research},
  year={2020},
  publisher={INFORMS}
}

% Offline submodular:

@article{nemhauser1978analysis,
  title={An analysis of approximations for maximizing submodular set functions—I},
  author={Nemhauser, George L and Wolsey, Laurence A and Fisher, Marshall L},
  journal={Mathematical programming},
  volume={14},
  number={1},
  pages={265--294},
  year={1978},
  publisher={Springer}
}

@misc{krause2014submodular,
  title={Submodular function maximization.},
  author={Krause, Andreas and Golovin, Daniel},
  year={2014}
}


@article{calinescu2011maximizing,
  title={Maximizing a monotone submodular function subject to a matroid constraint},
  author={Calinescu, Gruia and Chekuri, Chandra and P{\'a}l, Martin and Vondr{\'a}k, Jan},
  journal={SIAM Journal on Computing},
  volume={40},
  number={6},
  pages={1740--1766},
  year={2011},
  publisher={SIAM}
}


@inproceedings{kulik2009maximizing,
  title={Maximizing submodular set functions subject to multiple linear constraints},
  author={Kulik, Ariel and Shachnai, Hadas and Tamir, Tami},
  booktitle={Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms},
  pages={545--554},
  year={2009},
  organization={Society for Industrial and Applied Mathematics}
}

@article{kulik2013approximations,
  title={Approximations for monotone and nonmonotone submodular maximization with knapsack constraints},
  author={Kulik, Ariel and Shachnai, Hadas and Tamir, Tami},
  journal={Mathematics of Operations Research},
  volume={38},
  number={4},
  pages={729--739},
  year={2013},
  publisher={INFORMS}
}

@article{vondrak2007submodularity,
  title={Submodularity in combinatorial optimization},
  author={Vondr{\'a}k, Jan},
  year={2007},
  publisher={Univerzita Karlova, Matematicko-fyzik{\'a}ln{\'\i} fakulta}
}

% Online submodular
@article{asadpour2015maximizing,
  title={Maximizing stochastic monotone submodular functions},
  author={Asadpour, Arash and Nazerzadeh, Hamid},
  journal={Management Science},
  volume={62},
  number={8},
  pages={2374--2391},
  year={2015},
  publisher={INFORMS}
}

@inproceedings{fu2018ptas,
  title={A PTAS for a Class of Stochastic Dynamic Programs},
  author={Fu, Hao and Li, Jian and Xu, Pan},
  booktitle={45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
  year={2018},
  organization={Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik}
}

%
@book{devroye2012combinatorial,
  title={Combinatorial methods in density estimation},
  author={Devroye, Luc and Lugosi, G{\'a}bor},
  year={2012},
  publisher={Springer Science \& Business Media}
}

% Economics 

@article{gabaix2006costly,
  title={Costly information acquisition: Experimental analysis of a boundedly rational model},
  author={Gabaix, Xavier and Laibson, David and Moloche, Guillermo and Weinberg, Stephen},
  journal={American Economic Review},
  volume={96},
  number={4},
  pages={1043--1068},
  year={2006}
}

@article{robert1993informative,
  title={Informative price advertising in a sequential search model},
  author={Robert, Jacques and Stahl, Dale O},
  journal={Econometrica: Journal of the Econometric Society},
  pages={657--686},
  year={1993},
  publisher={JSTOR}
}

@article{miller1984job,
  title={Job matching and occupational choice},
  author={Miller, Robert A},
  journal={Journal of Political Economy},
  volume={92},
  number={6},
  pages={1086--1120},
  year={1984},
  publisher={The University of Chicago Press}
}

@article{choi2018consumer,
  title={Consumer search and price competition},
  author={Choi, Michael and Dai, Anovia Yifan and Kim, Kyungmin},
  journal={Econometrica},
  volume={86},
  number={4},
  pages={1257--1281},
  year={2018},
  publisher={Wiley Online Library}
}

@article{de2012testing,
  title={Testing models of consumer search using data on web browsing and purchasing behavior},
  author={De los Santos, Babur and Horta{\c{c}}su, Ali and Wildenbeest, Matthijs R},
  journal={American Economic Review},
  volume={102},
  number={6},
  pages={2955--80},
  year={2012}
}

@article{pindyck1993investments,
  title={Investments of uncertain cost},
  author={Pindyck, Robert S},
  journal={Journal of Financial Economics},
  volume={34},
  number={1},
  pages={53--76},
  year={1993},
  publisher={Elsevier}
}

@article{chu2020position,
  title={Position ranking and auctions for online marketplaces},
  author={Chu, Leon Yang and Nazerzadeh, Hamid and Zhang, Heng},
  journal={Management Science},
  year={2020},
  publisher={INFORMS}
}


@article{samuel1984comparison,
  title={Comparison of threshold stop rules and maximum for independent nonnegative random variables},
  author={Samuel-Cahn, Ester and others},
  journal={the Annals of Probability},
  volume={12},
  number={4},
  pages={1213--1216},
  year={1984},
  publisher={Institute of Mathematical Statistics}
}

% Websites:
@article{cdc,
      title  = "Clinical Questions about COVID-19",
      author = "US CDC",
      note   = "\url{https://www.cdc.gov/coronavirus/2019-ncov/hcp/faq.html}",
      year   = "2020 (accessed May 15, 2020)",
      journal = {Centers for Disease Control and Prevention}
    }

 @manual{BoWebsite,
      title  = "Prophet Inequalities",
      author = "Bo Waggoner",
      url    = "https://www.bowaggoner.com/blog/2018/08-25-prophet-inequalities/",
      year   = "2018 (accessed July 1, 2020)"
    }
    
    
@article{ortools,
      title  = "OR-Tools",
      author = "Google",
      url   = "\url{https://developers.google.com/optimization/cp}",
      year   = "2023 (accessed Febrary 17, 2023)",
      
    }



  @misc{berndt1988pi,
  title={Pi and the AGM--A Study of Analytic Number Theory and Computational Complexity.},
  author={Berndt, Bruce C},
  year={1988},
  publisher={JSTOR}
}

@article{brent1976fast,
  title={Fast multiple-precision evaluation of elementary functions},
  author={Brent, Richard P},
  journal={Journal of the ACM (JACM)},
  volume={23},
  number={2},
  pages={242--251},
  year={1976},
  publisher={ACM New York, NY, USA}
}


@article{sachdeva2014faster,
  title={Faster algorithms via approximation theory},
  author={Sachdeva, Sushant and Vishnoi, Nisheeth K and others},
  journal={Foundations and Trends{\textregistered} in Theoretical Computer Science},
  volume={9},
  number={2},
  pages={125--210},
  year={2014},
  publisher={Now Publishers, Inc.}
}



@article{gibbard2022model,
  title={A model of search with two stages of information acquisition and additive learning},
  author={Gibbard, Peter},
  journal={Management science},
  volume={68},
  number={2},
  pages={1212--1217},
  year={2022},
  publisher={Informs}
}

@article{baucells2023search,
  title={Search in the dark: The normal case},
  author={Baucells, Manel and Zorc, Sa{\v{s}}a},
  year={2023},
  publisher={Darden Business School Working Paper}
}