Search in the Dark: The Case with Recall and Gaussian Learning

References

• Adam K (2001) Learning while searching for the best alternative. J. Econom. Theory 101(1):252–280.Crossref, Google Scholar
• Armstrong M, Zhou J (2016) Search deterrence. Rev. Econom. Stud. 83(1):26–57.Crossref, Google Scholar
• Baucells M, Lippman SA (2004) Bargaining with search as an outside option: The impact of the buyer’s future availability. Decision Anal. 1(4):235–249.Link, Google Scholar
• Bhatt S, Li P, Samorodnitsky G (2022) Extreme bandits using robust statistics. IEEE Trans. Inform. Theory 69(3):1761–1776.Crossref, Google Scholar
• Bikhchandani S, Sharma S (1996) Optimal search with learning. J. Econom. Dynamics Control 20(1):333–359.Crossref, Google Scholar
• Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Brezzi M, Lai TL (2002) Optimal learning and experimentation in bandit problems. J. Econom. Dynamics Control 27(1):87–108.Crossref, Google Scholar
• Brown DB, Uru C (2023) Sequential search with acquisition uncertainty. Preprint, submitted January 28, 2022, http://dx.doi.org/10.2139/ssrn.4014841.Google Scholar
• Chade H, Eeckhout J, Smith L (2017) Sorting through search and matching models in economics. J. Econom. Lit. 55(2):493–544.Crossref, Google Scholar
• Chick SE, Gans N (2009) Economic analysis of simulation selection problems. Management Sci. 55(3):421–437.Link, Google Scholar
• Christensen R (1986) Finite stopping in sequential sampling without recall from a Dirichlet process. Ann. Statist. 14(1):275–282.Crossref, Google Scholar
• Christensen R (1989) Sequential sampling without recall from a Dirichlet process. Canadian J. Statist. 17(4):391–397.Crossref, Google Scholar
• Cicirello VA, Smith SF (2005) The max k-armed bandit: A new model of exploration applied to search heuristic selection. Proc. 20th Natl. Conf. Artificial Intelligence, vol. 3 (AAAI Press, Cambridge, MA), 1355–1361.Google Scholar
• Cowan W, Honda J, Katehakis MN (2018) Normal bandits of unknown means and variances. J. Machine Learning Res. 18(154):1–28.Google Scholar
• David Y, Shimkin N (2016) PAC lower bounds and efficient algorithms for the max K-armed bandit problem. Internat. Conf. Machine Learn. (PMLR, New York), 878–887.Google Scholar
• DeGroot MH (1968) Some problems of optimal stopping. J. Royal Statist. Soc. B 30(1):108–122.Crossref, Google Scholar
• DeGroot MH (1970) Optimal Statistical Decisions (McGraw-Hill Book Company, New York).Google Scholar
• Faberman RJ, Mueller AI, Şahin A, Topa G (2022) Job search behavior among the employed and non-employed. Econometrica 90(4):1743–1779.Crossref, Google Scholar
• Ferguson TS (1989) Who solved the secretary problem? Statist. Sci. 4(3):282–289.Crossref, Google Scholar
• Gittins J, Wang Y-G (1992) The learning component of dynamic allocation indices. Ann. Statist. 20(3):1625–1636.Crossref, Google Scholar
• Gittins J, Glazebrook K, Weber R (2011) Multi-Armed Bandit Allocation Indices (John Wiley & Sons, Chichester, UK).Crossref, Google Scholar
• Goldstein DG, McAfee RP, Suri S, Wright JR (2020) Learning when to stop searching. Management Sci. 66(3):1375–1394.Link, Google Scholar
• Hey JD (1987) Still searching. J. Econom. Behav. Organ. 8(1):137–144.Crossref, Google Scholar
• Hu Z, Tang W (2021) Size matters, so does duration: The interplay between offer size and offer deadline. Management Sci. 67(8):4935–4960.Link, Google Scholar
• Hurwicz L, Richter MK (2003) Implicit functions and diffeomorphisms without C1. Kusuoka S, Maruyama T, eds. Advances in Mathematical Economics, vol. 5 (Springer, Tokyo), 65–96.Crossref, Google Scholar
• Kornish LJ, Lippman SA, Mamer JW (2011) Search and the introduction of improved technologies. Naval Res. Logist. 58(6):578–594.Crossref, Google Scholar
• Lippman SA, McCall JJ (1981) The economics of uncertainty: Selected topics and probabilistic methods. Arrow KJ, Intriligator MD, eds. Handbook of Mathematical Economics, vol. 1 (North-Holland Publishing Company, Amsterdam), 211–284.Google Scholar
• Mai Y, Pekeč S (2018) Information acquisition and technology adoption in a partnership. Preprint, submitted August 14, http://dx.doi.org/10.2139/ssrn.3221843.Google Scholar
• McCardle KF (1985) Information acquisition and the adoption of new technology. Management Sci. 31(11):1372–1389.Link, Google Scholar
• Morgan PB (1985) Distributions of the duration and value of job search with learning. Econometrica 53(5):1199–1232.Crossref, Google Scholar
• Mortensen DT (1986) Job search and labor market analysis. Ashenfelter OC, Layard R, eds. Handbook of Labor Economics, vol. 2 (Elsevier, Amsterdam), 849–919.Google Scholar
• Palley AB, Kremer M (2014) Sequential search and learning from rank feedback: Theory and experimental evidence. Management Sci. 60(10):2525–2542.Link, Google Scholar
• Prussing JE (1986) The principal minor test for semidefinite matrices. J. Guidance Control Dynamics 9(1):121–122.Crossref, Google Scholar
• Rosenfield DB, Shapiro RD (1981) Optimal adaptive price search. J. Econom. Theory 25(1):1–20.Crossref, Google Scholar
• Rothschild M (1974) Searching for the lowest price when the distribution of prices is unknown. J. Polit. Econom. 82(4):689–711.Crossref, Google Scholar
• Rothschild M, Stiglitz JE (1970) Increasing risk. I. A definition. J. Econom. Theory 2:225–243.Crossref, Google Scholar
• Smith JE, Ulu C (2017) Risk aversion, information acquisition, and technology adoption. Oper. Res. 65(4):1011–1028.Link, Google Scholar
• Talmain G (1992) Search from an unknown distribution an explicit solution. J. Econom. Theory 57(1):141–157.Crossref, Google Scholar
• Ulu C, Smith JE (2009) Uncertainty, information acquisition, and technology adoption. Oper. Res. 57(3):740–752.Link, Google Scholar
• Weitzman ML (1979) Optimal search for the best alternative. Econometrica 47(3):641–654.Crossref, Google Scholar
• Yang L, Debo LG, Gupta V (2019) Search among queues under quality differentiation. Management Sci. 65(8):3605–3623.Link, Google Scholar
• Zorc S, Tsetlin I (2020) Deadlines, offer timing, and the search for alternatives. Oper. Res. 68(3):927–948.Link, Google Scholar