{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T23:08:42Z","timestamp":1778454522889,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032186591","type":"print"},{"value":"9783032186607","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-18660-7_1","type":"book-chapter","created":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T22:18:22Z","timestamp":1778451502000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic and\u00a0Structural Complexities of\u00a0Menus in\u00a0Unit-Demand Auctions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7578-2831","authenticated-orcid":false,"given":"Daniel","family":"Schoepflin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0337-0560","authenticated-orcid":false,"given":"Clayton","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7744-795X","authenticated-orcid":false,"given":"S. Matthew","family":"Weinberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.jet.2018.07.001","volume":"177","author":"I Ashlagi","year":"2018","unstructured":"Ashlagi, I., Gonczarowski, Y.A.: Stable matching mechanisms are not obviously strategy-proof. J. Econ. Theory 177, 405\u2013425 (2018)","journal-title":"J. Econ. Theory"},{"issue":"5","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1257\/0002828043052330","volume":"94","author":"LM Ausubel","year":"2004","unstructured":"Ausubel, L.M.: An efficient ascending-bid auction for multiple objects. Am. Econ. Rev. 94(5), 1452\u20131475 (2004)","journal-title":"Am. Econ. Rev."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ausubel, L.M., Baranov, O.: A practical guide to the combinatorial clock auction (2017)","DOI":"10.1111\/ecoj.12404"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"20011001","DOI":"10.2202\/1534-5963.1019","volume":"1","author":"LM Ausubel","year":"2002","unstructured":"Ausubel, L.M., Milgrom, P.R.: Ascending auctions with package bidding. BE J. Theor. Econ. 1(1), 20011001 (2002)","journal-title":"BE J. Theor. Econ."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bade, S., Gonczarowski, Y.A.: Gibbard-satterthwaite success stories and obvious strategyproofness. In: Proceedings of the 18th ACM Conference on Economics and Computation (EC). p.\u00a0565 (2017)","DOI":"10.1145\/3033274.3085104"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Garimidi, P., Gkatzelis, V., Schoepflin, D., Tan, X.: Deterministic budget-feasible clock auctions. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 2940\u20132963. SIAM (2022)","DOI":"10.1137\/1.9781611977073.114"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Nisan, N.: On the computational power of iterative auctions. In: Proceedings of the 6th ACM Conference on Electronic Commerce (EC). pp. 29\u201343 (2005)","DOI":"10.1145\/1064009.1064013"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"B\u00f3, I., Hakimov, R.: Pick-an-object mechanisms (2020). https:\/\/ssrn.com\/abstract=3560372, mimeo","DOI":"10.2139\/ssrn.3560372"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10683-021-09720-z","volume":"25","author":"Y Breitmoser","year":"2022","unstructured":"Breitmoser, Y., Schweighofer-Kodritsch, S.: Obviousness around the clock. Exp. Econ. 25, 483\u2013513 (2022)","journal-title":"Exp. Econ."},{"key":"1_CR10","unstructured":"Christodoulou, G., Gkatzelis, V., Schoepflin, D.: Optimal deterministic clock auctions and beyond. Leibniz Int. Proc. Inf., LIPIcs. 215 (2022)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Crawford, V.P., Knoer, E.M.: Job matching with heterogeneous firms and workers. Econo. J. Econ. Soc. pp. 437\u2013450 (1981)","DOI":"10.2307\/1913320"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1086\/261411","volume":"94","author":"G Demange","year":"1986","unstructured":"Demange, G., Gale, D., Sotomayor, M.: Multi-item auctions. J. Polit. Econ. 94(4), 863\u2013872 (1986)","journal-title":"J. Polit. Econ."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gkatzelis, V., Gravin, N., Schoepflin, D.: Bayesian and randomized clock auctions. In: Proceedings of the 23rd ACM Conference on Economics and Computation. pp. 820\u2013845 (2022)","DOI":"10.1145\/3490486.3538247"},{"key":"1_CR14","unstructured":"Gonczarowski, Y.A., Heffetz, O., Thomas, C.: Strategyproofness-exposing descriptions of matching mechanisms (2025). https:\/\/arxiv.org\/abs\/2209.13148, previous version (\u201cStrategyproofness-exposing mechanism descriptions\u201d) appeared as an abstract in the Proceedings of the 24th ACM Conference on Economics and Computation (EC\u201923)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Gonczarowski, Y.A., Thomas, C.: Structural complexities of matching mechanisms. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC). pp. 455\u2013466 (2024)","DOI":"10.1145\/3618260.3649737"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1006\/jeth.1999.2531","volume":"87","author":"F Gul","year":"1999","unstructured":"Gul, F., Stacchetti, E.: Walrasian equilibrium with gross substitutes. J. Econ. Theor. 87(1), 95\u2013124 (1999)","journal-title":"J. Econ. Theor."},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jeth.1999.2580","volume":"92","author":"F Gul","year":"2000","unstructured":"Gul, F., Stacchetti, E.: The English auction with differentiated commodities. J. Econ. Theor. 92(1), 66\u201395 (2000)","journal-title":"J. Econ. Theor."},{"issue":"419","key":"1_CR18","doi-asserted-by":"publisher","first-page":"868","DOI":"10.2307\/2234706","volume":"103","author":"JH Kagel","year":"1993","unstructured":"Kagel, J.H., Levin, D.: Independent private value auctions: Bidder behaviour in first-, second-and third-price auctions with varying numbers of bidders. Econ. J. 103(419), 868\u2013879 (1993)","journal-title":"Econ. J."},{"key":"1_CR19","unstructured":"Katus\u0306c\u0306\u00e1k, P., Kittsteiner, T.: Strategy-proofness made simpler (2020), mimeo"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Lahaie, S., Parkes, D.C.: On the communication requirements of verifying the vcg outcome. In: Proceedings of the 9th ACM Conference on Electronic Commerce. pp. 78\u201387 (2008)","DOI":"10.1145\/1386790.1386806"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1086\/261158","volume":"91","author":"HB Leonard","year":"1983","unstructured":"Leonard, H.B.: Elicitation of honest preferences for the assignment of individuals to positions. J. Polit. Econ. 91(3), 461\u2013479 (1983)","journal-title":"J. Polit. Econ."},{"issue":"11","key":"1_CR22","doi-asserted-by":"publisher","first-page":"3257","DOI":"10.1257\/aer.20160425","volume":"107","author":"S Li","year":"2017","unstructured":"Li, S.: Obviously strategy-proof mechanisms. Am. Econ. Rev. 107(11), 3257\u201387 (2017)","journal-title":"Am. Econ. Rev."},{"issue":"1","key":"1_CR23","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1111\/iere.12538","volume":"63","author":"P Mandal","year":"2021","unstructured":"Mandal, P., Roy, S.: Obviously strategy-proof implementation of assignment rules: a new characterization. Int. Econ. Rev. 63(1), 261\u2013290 (2021)","journal-title":"Int. Econ. Rev."},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1086\/704074","volume":"128","author":"P Milgrom","year":"2020","unstructured":"Milgrom, P., Segal, I.: Clock auctions and radio spectrum reallocation. J. Polit. Econ. 128(1), 1\u201331 (2020)","journal-title":"J. Polit. Econ."},{"issue":"2","key":"1_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.jmateco.2005.12.003","volume":"42","author":"D Mishra","year":"2006","unstructured":"Mishra, D., Garg, R.: Descending price multi-item auctions. J. Math. Econ. 42(2), 161\u2013179 (2006)","journal-title":"J. Math. Econ."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Pycia, M., Troyan, P.: A theory of simplicity in games and mechanism design. Econometrica (2023), abstract (\u201cObvious Dominance and Random Priority\u201d) at Proceedings of the 20th ACM Conference on Economics and Computation (2019)","DOI":"10.1145\/3328526.3329613"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Ron, S.: Impossibilities for obviously strategy-proof mechanisms. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 19\u201340. SIAM (2024)","DOI":"10.1137\/1.9781611977912.2"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1590\/S0034-71402002000300006","volume":"56","author":"M Sotomayor","year":"2002","unstructured":"Sotomayor, M.: A simultaneous descending bid auction for multiple items and unitary demand. Rev. Bras. Econ. 56, 497\u2013510 (2002)","journal-title":"Rev. Bras. Econ."},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Thomas, C.: Classification of priorities such that deferred acceptance is OSP implementable. In: Proceedings of the 22nd ACM Conference on Economics and Computation (EC). p.\u00a0860 (2021)","DOI":"10.1145\/3465456.3467579"},{"issue":"3","key":"1_CR30","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1111\/iere.12384","volume":"60","author":"P Troyan","year":"2019","unstructured":"Troyan, P.: Obviously strategy-proof implementation of top trading cycles. Int. Econ. Rev. 60(3), 1249\u20131261 (2019)","journal-title":"Int. Econ. Rev."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-18660-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T22:18:24Z","timestamp":1778451504000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-18660-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032186591","9783032186607"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-18660-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Brunswick, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2025.cs.rutgers.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}