{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:18:25Z","timestamp":1760015905559,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"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_32","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"563-581","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Target-Oriented Regret Minimization for\u00a0Satisficing Monopolists"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5996-335X","authenticated-orcid":false,"given":"Napat","family":"Rujeerapaiboon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3124-6975","authenticated-orcid":false,"given":"Yize","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6300-0695","authenticated-orcid":false,"given":"Yilin","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"issue":"2","key":"32_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1287\/ijoc.2016.0735","volume":"29","author":"A Ben-Tal","year":"2017","unstructured":"Ben-Tal, A., Brekelmans, R., den Hertog, D., Vial, J.: Globalized robust optimization for nonlinear uncertain inequalities. INFORMS J. Comput. 29(2), 350\u2013366 (2017)","journal-title":"INFORMS J. Comput."},{"key":"32_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"issue":"6","key":"32_CR3","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1111\/j.1468-0262.2005.00638.x","volume":"73","author":"D Bergemann","year":"2005","unstructured":"Bergemann, D., Morris, S.: Robust mechanism design. Econometrica 73(6), 1771\u20131813 (2005)","journal-title":"Econometrica"},{"issue":"2\u20133","key":"32_CR4","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1162\/JEEA.2008.6.2-3.560","volume":"6","author":"D Bergemann","year":"2008","unstructured":"Bergemann, D., Schlag, K.: Pricing without priors. J. Eur. Econ. Assoc. 6(2\u20133), 560\u2013569 (2008)","journal-title":"J. Eur. Econ. Assoc."},{"issue":"6","key":"32_CR5","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1016\/j.jet.2011.10.018","volume":"146","author":"D Bergemann","year":"2011","unstructured":"Bergemann, D., Schlag, K.: Robust monopoly pricing. J. Econ. Theory 146(6), 2527\u20132543 (2011)","journal-title":"J. Econ. Theory"},{"issue":"3","key":"32_CR6","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.jet.2018.05.005","volume":"177","author":"V Carrasco","year":"2018","unstructured":"Carrasco, V., Farinha Luz, V., Kos, N., Messner, M., Monteiro, P., Moreira, H.: Optimal selling mechanisms under moment conditions. J. Econ. Theory 177, 245\u2013279 (2018)","journal-title":"J. Econ. Theory"},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"1887","DOI":"10.1287\/msom.2021.1055","volume":"24","author":"H Chen","year":"2022","unstructured":"Chen, H., Hu, M., Perakis, G.: Distribution-free pricing. Manuf. Serv. Oper. Manag. 24(4), 1887\u20132386 (2022)","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Z., Hu, Z., Wang, R.: Screening with limited information: The minimax theorem and a geometric approach. Available at SSRN#3940212 (2021)","DOI":"10.2139\/ssrn.3940212"},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1287\/mnsc.2020.3602","volume":"67","author":"M Cohen","year":"2021","unstructured":"Cohen, M., Perakis, G., Pindyck, R.: A simple rule for pricing with limited knowledge of demand. Manage. Sci. 67(3), 1608\u20131621 (2021)","journal-title":"Manage. Sci."},{"issue":"3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/opre.1090.0741","volume":"58","author":"E Delage","year":"2010","unstructured":"Delage, E., Ye, Y.: Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3), 595\u2013612 (2010)","journal-title":"Oper. Res."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Hu, B., Jin, Q., Long, Z.: Robust assortment revenue optimization and satisficing. Available at SSRN#4045001 (2022)","DOI":"10.2139\/ssrn.4045001"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1007\/s10107-021-01615-4","volume":"196","author":"\u00c7 Ko\u00e7yi\u011fit","year":"2022","unstructured":"Ko\u00e7yi\u011fit, \u00c7., Rujeerapaiboon, N., Kuhn, D.: Robust multidimensional pricing: separation without regret. Math. Program. 196, 841\u2013874 (2022)","journal-title":"Math. Program."},{"key":"32_CR14","unstructured":"Li, Y., Lu, P., Ye, H.: Revenue maximization with imprecise distribution. In: Proceedings of the 18th International Conference on Autonomous Agents and Multi-Agent Systems, pp. 1582\u20131590 (2019)"},{"issue":"1","key":"32_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.2021.2238","volume":"71","author":"Z Long","year":"2022","unstructured":"Long, Z., Sim, M., Zhou, M.: Robust satisficing. Oper. Res. 71(1), 61\u201382 (2022)","journal-title":"Oper. Res."},{"issue":"7","key":"32_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/3528087","volume":"65","author":"M Mitzenmacher","year":"2022","unstructured":"Mitzenmacher, M., Vassilvitskii, S.: Algorithms with predictions. Commun. ACM 65(7), 33\u201335 (2022)","journal-title":"Commun. ACM"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-017-1172-1","volume":"171","author":"P Mohajerin Esfahani","year":"2018","unstructured":"Mohajerin Esfahani, P., Kuhn, D.: Data-driven distributionally robust optimization using the wasserstein metric: performance guarantees and tractable reformulations. Math. Program. 171, 115\u2013166 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"32_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"32_CR19","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/opre.1070.0486","volume":"56","author":"G Perakis","year":"2008","unstructured":"Perakis, G., Roels, G.: Regret in the newsvendor model with partial information. Oper. Res. 56(1), 188\u2013203 (2008)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"32_CR20","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10107-016-1063-x","volume":"163","author":"M P\u0131nar","year":"2017","unstructured":"P\u0131nar, M., K\u0131z\u0131lkale, C.: Robust screening under ambiguity. Math. Program. 163(1\u20132), 273\u2013299 (2017)","journal-title":"Math. Program."},{"issue":"5","key":"32_CR21","doi-asserted-by":"publisher","first-page":"2906","DOI":"10.1287\/opre.2021.2159","volume":"70","author":"M Poursoltani","year":"2022","unstructured":"Poursoltani, M., Delage, E.: Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems. Oper. Res. 70(5), 2906\u20132930 (2022)","journal-title":"Oper. Res."},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Ramachandra, A., Rujeerapaiboon, N., Sim, M.: Robust conic satisficing. Available at SSRN#3842446 (2022)","DOI":"10.2139\/ssrn.3842446"},{"issue":"2","key":"32_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.2307\/1885625","volume":"98","author":"J Riley","year":"1983","unstructured":"Riley, J., Zeckhauser, R.: Optimal selling strategies: when to haggle, when to hold firm. Q. J. Econ. 98(2), 267\u2013289 (1983)","journal-title":"Q. J. Econ."},{"issue":"253","key":"32_CR24","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/01621459.1951.10500768","volume":"46","author":"L Savage","year":"1951","unstructured":"Savage, L.: The theory of statistical decision. J. Am. Stat. Assoc. 46(253), 55\u201367 (1951)","journal-title":"J. Am. Stat. Assoc."},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Sim, M., Tang, Q., Zhou, M., Zhu, T.: The analytics of robust satisficing: predict, optimize, satisfice, then fortify. Available at SSRN#3829562 (2021)","DOI":"10.2139\/ssrn.3829562"},{"key":"32_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511835216","volume-title":"Mechanism Design: A Linear Programming Approach","author":"R Vohra","year":"2011","unstructured":"Vohra, R.: Mechanism Design: A Linear Programming Approach. Cambridge University Press, Cambridge (2011)"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Wang, S., Liu, S., Zhang, J.: Minimax regret mechanism design with moments information. Available at SSRN#3707021 (2020)","DOI":"10.2139\/ssrn.3707021"},{"issue":"6","key":"32_CR28","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1287\/opre.2014.1314","volume":"62","author":"W Wiesemann","year":"2014","unstructured":"Wiesemann, W., Kuhn, D., Sim, M.: Distributionally robust convex optimization. Oper. Res. 62(6), 1358\u20131376 (2014)","journal-title":"Oper. Res."}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:05:56Z","timestamp":1703988356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_32","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)"}}]}}