{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:49Z","timestamp":1781028289384,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2329431"],"award-info":[{"award-number":["2329431"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800930","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"2290-2301","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorial Markov Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5031-8645","authenticated-orcid":false,"given":"Robin","family":"Bowers","sequence":"first","affiliation":[{"name":"University of Colorado Boulder, Boulder, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0558-2596","authenticated-orcid":false,"given":"Elias","family":"Lindgren","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder, Boulder, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1366-1065","authenticated-orcid":false,"given":"Bo","family":"Waggoner","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder, Boulder, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Saeed Alaei Ali Makhdoumi Azarakhsh Malekian and Rad Niazadeh. 2022. Descending price auctions with bounded number of price levels and batched prophet inequality. arXiv preprint arXiv:2203.01384.","DOI":"10.2139\/ssrn.4048181"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Ali Aouad Jingwei Ji and Yaron Shaposhnik. 2020. The Pandora\u2019s Box Problem with Sequential Inspections. Available at SSRN 3726167.","DOI":"10.2139\/ssrn.3726167"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2015.2254"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585217"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3699814.3699817"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329626"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399501"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Robin Bowers and Bo Waggoner. 2024. High-Welfare Matching Markets via Descending Price. In Web and Internet Economics Jugal Garg Max Klimm and Yuqing Kong (Eds.). Springer Nature Switzerland.","DOI":"10.1007\/978-3-031-48974-7_4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-032-08560-3_4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1164"},{"key":"e_1_3_2_1_11_1","unstructured":"Shuchi Chawla Dimitris Christou and Trung Dang. 2025. Commitment Gap via Correlation Gap. arxiv:2508.20246."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Shuchi Chawla Dimitris Christou Amit Harlev and Ziv Scully. 2026. Combinatorial Selection with Costly Information. SODA. arxiv:2412.03860","DOI":"10.1137\/1.9781611978971.26"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00116"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-71033-9_22"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2018.01.005"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102408341"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323850"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011885"},{"key":"e_1_3_2_1_20_1","volume-title":"International Conference on Web and Internet Economics. 272\u2013289","author":"Ezra Tomer","year":"2023","unstructured":"Tomer Ezra, Stefano Leonardi, Rebecca Reiffenh\u00e4user, Matteo Russo, and Alexandros Tsigonias-Dimitriadis. 2023. Prophet inequalities via the expected competitive ratio. In International Conference on Web and Internet Economics. 272\u2013289."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585229"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1979.tb01068.x"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(76)90041-4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/3213920"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005270"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2913379.2913381"},{"key":"e_1_3_2_1_28_1","volume-title":"Approximation Algorithms for Bayesian Multi-Armed Bandit Problems. CoRR, abs\/1306.3525","author":"Guha Sudipto","year":"2013","unstructured":"Sudipto Guha and Kamesh Munagala. 2013. Approximation Algorithms for Bayesian Multi-Armed Bandit Problems. CoRR, abs\/1306.3525 (2013), arXiv:1306.3525. arxiv:1306.3525"},{"key":"e_1_3_2_1_29_1","unstructured":"Sudipto Guha Kamesh Munagala and Saswati Sarkar. 2007. Information Acquisition and Exploitation in Multichannel Wireless Networks."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17953-3_18"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Anupam Gupta Viswanath Nagarajan and Sahil Singla. 2016. Algorithms and Adaptivity Gaps for Stochastic Probing. 1731\u20131747. https:\/\/doi.org\/10.1137\/1.9781611974331.ch120 10.1137\/1.9781611974331.ch120","DOI":"10.1137\/1.9781611974331.ch120"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence (UAI). AUAI Press, 345\u2013354","author":"Hadfield-Menell Dylan","year":"2015","unstructured":"Dylan Hadfield-Menell. 2015. Multitasking: efficient optimal planning for bandit superprocesses. In Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence (UAI). AUAI Press, 345\u2013354. isbn:9780996643108"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Nicole Immorlica Jacob Leshno Irene Lo and Brendan Lucier. 2020. Information acquisition in matching markets: The role of price discovery. Available at SSRN 3705049.","DOI":"10.2139\/ssrn.3705049"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399452"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.01.005"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0531(03)00092-9"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940760"},{"key":"e_1_3_2_1_38_1","volume-title":"Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC). 123\u2013136","author":"Kleinberg Robert","unstructured":"Robert Kleinberg and S. Matthew Weinberg. 2012. Matroid prophet inequalities. In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC). 123\u2013136."},{"key":"e_1_3_2_1_39_1","volume-title":"On semiamarts, amarts, and processes with finite value. Probability on Banach spaces, 4, 197-266","author":"Krengel Ulrich","year":"1978","unstructured":"Ulrich Krengel and Louis Sucheston. 1978. On semiamarts, amarts, and processes with finite value. Probability on Banach spaces, 4, 197-266 (1978), 1\u20132."},{"key":"e_1_3_2_1_40_1","unstructured":"Euiwoong Lee and Sahil Singla. 2018. Optimal online contention resolution schemes via ex-ante prophet inequalities. arXiv preprint arXiv:1806.09251."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3144722.3144725"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0884"},{"key":"e_1_3_2_1_43_1","volume-title":"Optimal allocation of Resources Between Research Projects. Ph. D. Dissertation","author":"Nash Peter","unstructured":"Peter Nash. 1973. Optimal allocation of Resources Between Research Projects. Ph. D. Dissertation. University of Cambridge."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1980.tb01114.x"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.110"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_3_2_1_47_1","unstructured":"Ziv Scully and Laura Doval. 2025. Local hedging approximately solves Pandora\u2019s box problems with nonobligatory inspection. arxiv:2410.19011. arxiv:2410.19011"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Ziv Scully and Alexander Terenin. 2025. The Gittins Index: A Design Principle for Decision Making Under Uncertainty. In Tutorials in Operations Research: Advances in Analytics and Operations Research: Improving Decisions to Secure the Future. INFORMS 28\u201370.","DOI":"10.1287\/educ.2025.0290"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.161"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.2307\/1910412"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1980.tb01111.x"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133092"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800930","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:56:00Z","timestamp":1781027760000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":52,"alternative-id":["10.1145\/3798129.3800930","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800930","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}