{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:17:25Z","timestamp":1751516245505,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","funder":[{"name":"DARPA","award":["QuICC"],"award-info":[{"award-number":["QuICC"]}]},{"name":"ONR MURI 2024 award","award":["Algorithms, Learning, and Game Theory"],"award-info":[{"award-number":["Algorithms, Learning, and Game Theory"]}]},{"name":"Army-Research Laboratory ARL) grant","award":["W9111NF2410052"],"award-info":[{"award-number":["W9111NF2410052"]}]},{"name":"NSF AF:Small","award":["2218678","2114269","2347322"],"award-info":[{"award-number":["2218678","2114269","2347322"]}]},{"name":"Royal Society Grant","award":["IES\\\\R2\\\\222170"],"award-info":[{"award-number":["IES\\\\R2\\\\222170"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,7]]},"DOI":"10.1145\/3736252.3742530","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:49:32Z","timestamp":1751482172000},"page":"275-303","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Delegated Choice with Combinatorial Constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7110-5238","authenticated-orcid":false,"given":"Kiarash","family":"Banihashem","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4842-0533","authenticated-orcid":false,"given":"Mohammad Taghi","family":"Hajiaghayi","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1498-9994","authenticated-orcid":false,"given":"Piotr","family":"Krysta","sequence":"additional","affiliation":[{"name":"Augusta University, Augusta, USA"},{"name":"University of Liverpool, Liverpool, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4233-9630","authenticated-orcid":false,"given":"Suho","family":"Shin","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055479"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229018"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-937X.2007.00471.x"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA7965"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.100"},{"key":"e_1_3_2_1_6_1","volume-title":"Symposium on Discrete Algorithms (SODA'07)","author":"Babaioff Moshe","year":"2007","unstructured":"Moshe Babaioff, Nicole Immorlica, and Robert Kleinberg. 2007. Matroids, secretary problems, and online mechanisms. In Symposium on Discrete Algorithms (SODA'07). 434\u2013443."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.163"},{"key":"e_1_3_2_1_8_1","volume-title":"Delegated Stochastic Probing. Innovations in Theoretical Computer Science (ITCS)","author":"Bechtel Curtis","year":"2021","unstructured":"Curtis Bechtel and Shaddin Dughmi. 2021. Delegated Stochastic Probing. Innovations in Theoretical Computer Science (ITCS) (2021)."},{"key":"e_1_3_2_1_9_1","volume-title":"Delegated Pandora's box. arXiv preprint arXiv:2202.10382","author":"Bechtel Curtis","year":"2022","unstructured":"Curtis Bechtel, Shaddin Dughmi, and Neel Patel. 2022. Delegated Pandora's box. arXiv preprint arXiv:2202.10382 (2022)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/346773.346785"},{"key":"e_1_3_2_1_11_1","volume-title":"Static pricing for multi-unit prophet inequalities. arXiv preprint arXiv:2007.07990","author":"Chawla Shuchi","year":"2020","unstructured":"Shuchi Chawla, Nikhil Devanur, and Thodoris Lykouris. 2020a. Static pricing for multi-unit prophet inequalities. arXiv preprint arXiv:2007.07990 (2020)."},{"key":"e_1_3_2_1_12_1","volume-title":"Non-adaptive matroid prophet inequalities. arXiv preprint arXiv:2011.09406","author":"Chawla Shuchi","year":"2020","unstructured":"Shuchi Chawla, Kira Goldner, Anna R Karlin, and J Benjamin Miller. 2020b. Non-adaptive matroid prophet inequalities. arXiv preprint arXiv:2011.09406 (2020)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085137"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331033.3331039"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323850"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175316"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1029394"},{"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","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch145"},{"key":"e_1_3_2_1_21_1","volume-title":"Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms. arXiv preprint arXiv:2402.17160","author":"Ezra Tomer","year":"2024","unstructured":"Tomer Ezra, Michal Feldman, and Zhihao Gavin Tang. 2024. Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms. arXiv preprint arXiv:2402.17160 (2024)."},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 123\u2013135","author":"Feldman Michal","year":"2014","unstructured":"Michal Feldman, Nick Gravin, and Brendan Lucier. 2014. Combinatorial auctions via posted prices. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 123\u2013135."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i9.28834"},{"key":"e_1_3_2_1_25_1","first-page":"58","article-title":"Automated online mechanism design and prophet inequalities","volume":"7","author":"Hajiaghayi Mohammad Taghi","year":"2007","unstructured":"Mohammad Taghi Hajiaghayi, Robert Kleinberg, and Tuomas Sandholm. 2007. Automated online mechanism design and prophet inequalities. In AAAI, Vol. 7. 58\u201365.","journal-title":"AAAI"},{"key":"e_1_3_2_1_26_1","unstructured":"Bengt Holmstrom. 1980. On the theory of delegation. Technical Report. Discussion Paper."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219205"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Ulrich Krengel and Louis Sucheston. 1977. Semiamarts and finite values. (1977).","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_3_2_1_31_1","volume-title":"Handbook of the Tutte Polynomial and Related Topics","author":"Oxley James","unstructured":"James Oxley. 2022. Matroid theory. In Handbook of the Tutte Polynomial and Related Topics. Chapman and Hall\/CRC, 44\u201385."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897540"},{"key":"e_1_3_2_1_33_1","volume-title":"arXiv preprint arXiv:2306.11475","author":"Saig Eden","year":"2023","unstructured":"Eden Saig, Inbal Talgam-Cohen, and Nir Rosenfeld. 2023. Delegated Classification. arXiv preprint arXiv:2306.11475 (2023)."},{"key":"e_1_3_2_1_34_1","volume-title":"Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability","author":"Samuel-Cahn Ester","year":"1984","unstructured":"Ester Samuel-Cahn. 1984. Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability (1984), 1213\u20131216."},{"key":"e_1_3_2_1_35_1","volume-title":"Non-Adaptive Matroid Prophet Inequalities. Master's thesis","author":"Sayutina Alice","unstructured":"Alice Sayutina. 2023. Non-Adaptive Matroid Prophet Inequalities. Master's thesis. University of Waterloo."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597669"},{"key":"e_1_3_2_1_37_1","volume-title":"Zur theorie der gesellschaftsspiele. Mathematische annalen 100, 1","author":"Neumann J v.","year":"1928","unstructured":"J v. Neumann. 1928. Zur theorie der gesellschaftsspiele. Mathematische annalen 100, 1 (1928), 295\u2013320."}],"event":{"name":"EC '25: 26th ACM Conference on Economics and Computation","location":"Stanford University Stanford CA USA","acronym":"EC '25","sponsor":["SIGecom ACM Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 26th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736252.3742530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:51:57Z","timestamp":1751482317000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":37,"alternative-id":["10.1145\/3736252.3742530","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742530","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2025-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}