{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:22:21Z","timestamp":1742912541458,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030649456"},{"type":"electronic","value":"9783030649463"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_12","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"162-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2420-4468","authenticated-orcid":false,"given":"Will","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Alaei, S., Fu, H., Haghpanah, N., Hartline, J.: The simple economics of approximately optimal auctions. In: Proceedings of the IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 628\u2013637. IEEE (2013)","DOI":"10.1109\/FOCS.2013.73"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Fu, H., Haghpanah, N., Hartline, J., Malekian, A.: Bayesian optimal auctions via multi-to single-agent reduction. In: Proceedings of the 13th ACM Conference on Electronic Commerce, p. 17 (2012)","DOI":"10.1145\/2229012.2229017"},{"issue":"6","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1287\/opre.2018.1754","volume":"66","author":"A Aouad","year":"2018","unstructured":"Aouad, A., Farias, V., Levi, R., Segev, D.: The approximability of assortment optimization under ranking preferences. Oper. Res. 66(6), 1661\u20131669 (2018)","journal-title":"Oper. Res."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/game.1997.0511","volume":"18","author":"S Barber\u00e0","year":"1997","unstructured":"Barber\u00e0, S., Jackson, M.O., Neme, A.: Strategy-proof allotment rules. Games Econ. Behav. 18(1), 1\u201321 (1997)","journal-title":"Games Econ. Behav."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-22935-0_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A Bhalgat","year":"2011","unstructured":"Bhalgat, A., Chakrabarty, D., Khanna, S.: Social welfare in one-sided matching markets without money. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2011. LNCS, vol. 6845, pp. 87\u201398. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22935-0_8"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1287\/opre.2016.1505","volume":"64","author":"J Blanchet","year":"2016","unstructured":"Blanchet, J., Gallego, G., Goyal, V.: A Markov chain approximation to choice modeling. Oper. Res. 64(4), 886\u2013905 (2016)","journal-title":"Oper. Res."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Kleinberg, R.: Algorithmic pricing via virtual valuations. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 243\u2013251. ACM (2007)","DOI":"10.1145\/1250910.1250946"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 311\u2013320. ACM (2010)","DOI":"10.1145\/1807406.1807428"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.geb.2012.08.010","volume":"91","author":"S Chawla","year":"2015","unstructured":"Chawla, S., Malec, D., Sivan, B.: The power of randomness in Bayesian optimal mechanism design. Games Econ. Behav. 91, 297\u2013317 (2015)","journal-title":"Games Econ. Behav."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Chen, X., Diakonikolas, I., Orfanou, A., Paparas, D., Sun, X., Yannakakis, M.: On the complexity of optimal lottery pricing and randomized mechanisms. In: Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 1464\u20131479. IEEE (2015)","DOI":"10.1109\/FOCS.2015.93"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"D\u00e9sir, A., Goyal, V., Segev, D., Ye, C.: Capacity constrained assortment optimization under the Markov chain based choice model. Manage. Sci. (2019, Forthcoming)","DOI":"10.1287\/mnsc.2018.3230"},{"key":"12_CR12","unstructured":"Elkind, E.: Designing and learning optimal finite support auctions. In: Proceedings of the Eighteenth Annual ACM-SIAM symposium on Discrete Algorithms, pp. 736\u2013745. Society for Industrial and Applied Mathematics (2007)"},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1287\/opre.2017.1628","volume":"65","author":"JB Feldman","year":"2017","unstructured":"Feldman, J.B., Topaloglu, H.: Revenue management under the Markov chain choice model. Oper. Res. 65(5), 1322\u20131342 (2017)","journal-title":"Oper. Res."},{"issue":"6","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1287\/mnsc.2014.1939","volume":"60","author":"N Golrezaei","year":"2014","unstructured":"Golrezaei, N., Nazerzadeh, H., Rusmevichientong, P.: Real-time optimization of personalized assortments. Manage. Sci. 60(6), 1532\u20131551 (2014)","journal-title":"Manage. Sci."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Ma, W., Simchi-Levi, D.: Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios. Oper. Res. (2020)","DOI":"10.1287\/opre.2019.1957"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0165-1765(82)90003-9","volume":"9","author":"AE Roth","year":"1982","unstructured":"Roth, A.E.: Incentive compatibility in a market with indivisible goods. Econ. Lett. 9(2), 127\u2013132 (1982)","journal-title":"Econ. Lett."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"2820","DOI":"10.1287\/mnsc.2019.3346","volume":"66","author":"P Rusmevichientong","year":"2020","unstructured":"Rusmevichientong, P., Sumida, M., Topaloglu, H.: Dynamic assortment optimization for reusable products with random usage durations. Manage. Sci. 66, 2820\u20132844 (2020)","journal-title":"Manage. Sci."},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L Shapley","year":"1974","unstructured":"Shapley, L., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1(1), 23\u201337 (1974)","journal-title":"J. Math. Econ."},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"509","DOI":"10.2307\/2938268","volume":"59","author":"Y Sprumont","year":"1991","unstructured":"Sprumont, Y.: The division problem with single-peaked preferences: a characterization of the uniform allocation rule. Econometrica J. Econometric Soc. 59, 509\u2013519 (1991)","journal-title":"Econometrica J. Econometric Soc."},{"issue":"4","key":"12_CR21","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s003550050160","volume":"16","author":"LG Svensson","year":"1999","unstructured":"Svensson, L.G.: Strategy-proof allocation of indivisible goods. Soc. Choice Welfare 16(4), 557\u2013567 (1999)","journal-title":"Soc. Choice Welfare"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/mnsc.1030.0147","volume":"50","author":"K Talluri","year":"2004","unstructured":"Talluri, K., Van Ryzin, G.: Revenue management under a general discrete choice model of consumer behavior. Manage. Sci. 50(1), 15\u201333 (2004)","journal-title":"Manage. Sci."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:10:12Z","timestamp":1607159412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","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":"Beijing","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"136","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":"31","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":"11","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":"23% - 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":"10","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}