{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:50:59Z","timestamp":1742989859696,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031489730"},{"type":"electronic","value":"9783031489747"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-48974-7_4","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"59-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["High-Welfare Matching Markets via\u00a0Descending Price"],"prefix":"10.1007","author":[{"given":"Robin","family":"Bowers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Waggoner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"publisher","first-page":"2163","DOI":"10.1287\/mnsc.2018.3265","volume":"66","author":"I Ashlagi","year":"2020","unstructured":"Ashlagi, I., Braverman, M., Kanoria, Y., Shi, P.: Clearing matching markets efficiently: informative signals and match recommendations. Manage. Sci. 66(5), 2163\u20132193 (2020)","journal-title":"Manage. Sci."},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Beyhaghi, H., Kleinberg, R.: Pandora\u2019s problem with nonobligatory inspection. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, pp. 131\u2013132. Association for Computing Machinery (2019). https:\/\/doi.org\/10.1145\/3328526.3329626","DOI":"10.1145\/3328526.3329626"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1257\/jel.20150777","volume":"55","author":"H Chade","year":"2017","unstructured":"Chade, H., Eeckhout, J., Smith, L.: Sorting through search and matching models in economics. J. Econ. Lit. 55(2), 493\u2013544 (2017)","journal-title":"J. Econ. Lit."},{"issue":"5","key":"4_CR4","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1086\/701791","volume":"127","author":"YK Che","year":"2019","unstructured":"Che, Y.K., Tercieux, O.: Efficiency and stability in large matching markets. J. Polit. Econ. 127(5), 2301\u20132342 (2019)","journal-title":"J. Polit. Econ."},{"key":"4_CR5","first-page":"1","volume":"74","author":"Y Chen","year":"2021","unstructured":"Chen, Y., He, Y.: Information acquisition and provision in school choice: a theoretical investigation. Econ. Theory 74, 1\u201335 (2021)","journal-title":"Econ. Theory"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Feldman, M., Immorlica, N., Lucier, B., Roughgarden, T., Syrgkanis, V.: The price of anarchy in large games. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 963\u2013976. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2897518.2897580","DOI":"10.1145\/2897518.2897580"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Fernandez, M.A., Rudov, K., Yariv, L.: Centralized matching with incomplete information. Working Paper 29043, National Bureau of Economic Research (2021). https:\/\/doi.org\/10.3386\/w29043, http:\/\/www.nber.org\/papers\/w29043","DOI":"10.3386\/w29043"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"4_CR9","unstructured":"Hakimov, R., K\u00fcbler, D., Pan, S.: Costly information acquisition in centralized matching markets. Rationality and Competition Discussion Paper Series 280, CRC TRR 190 Rationality and Competition (2021). https:\/\/ideas.repec.org\/p\/rco\/dpaper\/280.html"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1257\/0002828054825466","volume":"95","author":"JW Hatfield","year":"2005","unstructured":"Hatfield, J.W., Milgrom, P.R.: Matching with contracts. Am. Econ. Rev. 95(4), 913\u2013935 (2005)","journal-title":"Am. Econ. Rev."},{"key":"4_CR11","unstructured":"He, Y., Magnac, T.: Application costs and congestion in matching markets (2020)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Leshno, J., Lo, I., Lucier, B.: Information acquisition in matching markets: the role of price discovery. Available at SSRN 3705049 (2020)","DOI":"10.2139\/ssrn.3705049"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Lucier, B., Manshadi, V., Wei, A.: Designing approximately optimal search on matching platforms, pp. 632\u2013633. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3465456.3467530","DOI":"10.2139\/ssrn.3850164"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyazaki, S.: A survey of the stable marriage problem and its variants. In: International Conference on Informatics Education, ICKS 2008, pp. 131\u2013136. IEEE (2008)","DOI":"10.1109\/ICKS.2008.7"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Kelso, A.S., Crawford, V.P.: Job matching, coalition formation, and gross substitutes. Econometrica 50(6), 1483\u20131504 (1982). http:\/\/www.jstor.org\/stable\/1913392","DOI":"10.2307\/1913392"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Kleinberg, R., Waggoner, B., Weyl, E.G.: Descending price optimally coordinates search. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC 2016, pp. 23\u201324. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2940716.2940760","DOI":"10.1145\/2940716.2940760"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econom.: J. Econom. Soc. 53\u201376 (1957)","DOI":"10.2307\/1907742"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Lucier, B., Syrgkanis, V.: Greedy algorithms make efficient mechanisms. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, pp. 221\u2013238 (2015)","DOI":"10.1145\/2764468.2764506"},{"key":"4_CR19","unstructured":"Marshall, A.: Principles of Economics, 8th edn. (1920)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.jebo.2012.12.002","volume":"94","author":"C Plott","year":"2013","unstructured":"Plott, C., Roy, N., Tong, B.: Marshall and Walras, disequilibrium trades and the dynamics of equilibration in the continuous double auction market. J. Econ. Behav. Organ. 94, 190\u2013205 (2013). https:\/\/doi.org\/10.1016\/j.jebo.2012.12.002","journal-title":"J. Econ. Behav. Organ."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1613\/jair.5272","volume":"59","author":"T Roughgarden","year":"2017","unstructured":"Roughgarden, T., Syrgkanis, V., Tardos, E.: The price of anarchy in auctions. J. Artif. Intell. Res. 59, 59\u2013101 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Waggoner, B., Weyl, E.G.: Matching markets via descending price. Available at SSRN 3373934 (2019)","DOI":"10.2139\/ssrn.3373934"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"641","DOI":"10.2307\/1910412","volume":"47","author":"ML Weitzman","year":"1979","unstructured":"Weitzman, M.L.: Optimal search for the best alternative. Econometrica 47(3), 641\u2013654 (1979)","journal-title":"Econometrica"}],"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-031-48974-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:02:47Z","timestamp":1703988167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"221","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29 one-page abstracts accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}