{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:31:38Z","timestamp":1742949098148,"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_6","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"95-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Stopping with\u00a0Multi-dimensional Comparative Loss Aversion"],"prefix":"10.1007","author":[{"given":"Linda","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Gardner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Matthew","family":"Weinberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"6_CR1","unstructured":"Beyhaghi, H., Golrezaei, N., Leme, R.P., Pal, M., Sivan, B.: Improved approximations for free-order prophets and second-price auctions. CoRR abs\/1807.03435 (2018). http:\/\/arxiv.org\/abs\/1807.03435"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1111\/1467-9280.00141","volume":"10","author":"L Brenner","year":"1999","unstructured":"Brenner, L., Rottenstreich, Y., Sood, S.: Comparison, grouping, and preference. Psychol. Sci. 10(3), 225\u2013229 (1999)","journal-title":"Psychol. Sci."},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.jcps.2014.08.002","volume":"25","author":"A Chernev","year":"2015","unstructured":"Chernev, A., B\u00f6ckenholt, U., Goodman, J.: Choice overload: a conceptual review and meta-analysis. J. Consum. Psychol. 25(2), 333\u2013358 (2015)","journal-title":"J. Consum. Psychol."},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Correa, J.R., Foncea, P., Hoeksma, R., Oosterwijk, T., Vredeveld, T.: Posted price mechanisms for a random stream of customers. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC 2017, Cambridge, MA, USA, 26\u201330 June 2017, pp. 169\u2013186 (2017). https:\/\/doi.org\/10.1145\/3033274.3085137","DOI":"10.1145\/3033274.3085137"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Duetting, P., Feldman, M., Kesselheim, T., Lucier, B.: Prophet inequalities made easy: stochastic optimization by pricing non-stochastic inputs. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, 15\u201317 October 2017, pp. 540\u2013551 (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.56","DOI":"10.1109\/FOCS.2017.56"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Ehsani, S., Hajiaghayi, M., Kesselheim, T., Singla, S.: Prophet secretary for combinatorial auctions and matroids. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 700\u2013714 (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.46","DOI":"10.1137\/1.9781611975031.46"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Esfandiari, H., Hajiaghayi, M., Liaghat, V., Monemizadeh, M.: Prophet secretary. In: Proceedings of the Algorithms - ESA 2015\u201323rd Annual European Symposium, Patras, Greece, 14\u201316 September 2015, pp. 496\u2013508 (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_42","DOI":"10.1007\/978-3-662-48350-3_42"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1002\/mar.20269","volume":"26","author":"GA Haynes","year":"2009","unstructured":"Haynes, G.A.: Testing the boundaries of the choice overload phenomenon: the effect of number of options and time pressure on decision difficulty and satisfaction. Psychol. Mark. 26(3), 204\u2013212 (2009)","journal-title":"Psychol. Mark."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Hill, T.P., Kertz, R.P.: Comparisons of stop rule and supremum expectations of I.I.D. random variables. Ann. Probab. 10, 336\u2013345 (1982)","DOI":"10.1214\/aop\/1176993861"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Kahneman, D., Tversky, A.: Prospect theory: an analysis of decision under risk. In: Handbook of the Fundamentals of Financial Decision Making: Part I, pp. 99\u2013127. World Scientific (2013)","DOI":"10.1142\/9789814417358_0006"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Kleinberg, R., Oren, S.: Optimal stopping with behaviorally biased agents: the role of loss aversion and changing reference points. arXiv preprint arXiv:2106.00604 (2021)","DOI":"10.1145\/3465456.3467568"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, 19\u201322 May 2012, pp. 123\u2013136 (2012). https:\/\/doi.org\/10.1145\/2213977.2213991","DOI":"10.1145\/2213977.2213991"},{"key":"6_CR13","first-page":"197","volume":"4","author":"U Krengel","year":"1978","unstructured":"Krengel, U., Sucheston, L.: On semiamarts, amarts, and processes with finite value. Adv. Probab. Relat. Top. 4, 197\u2013266 (1978)","journal-title":"Adv. Probab. Relat. Top."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tourman.2012.05.004","volume":"35","author":"JY Park","year":"2013","unstructured":"Park, J.Y., Jang, S.S.: Confused by too many choices? Choice overload in tourism. Tour. Manag. 35, 1\u201312 (2013)","journal-title":"Tour. Manag."},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Rubinstein, A.: Beyond matroids: secretary problem and prophet inequality with general constraints. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 324\u2013332 (2016). https:\/\/doi.org\/10.1145\/2897518.2897540","DOI":"10.1145\/2897518.2897540"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Rubinstein, A., Singla, S.: Combinatorial prophet inequalities. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16\u201319 January 2017, pp. 1671\u20131687 (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.110","DOI":"10.1137\/1.9781611974782.110"},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1037\/0022-3514.93.4.515","volume":"93","author":"A Sagi","year":"2007","unstructured":"Sagi, A., Friedland, N.: The cost of richness: the effect of the size and diversity of decision sets on post-decision regret. J. Pers. Soc. Psychol. 93(4), 515 (2007)","journal-title":"J. Pers. Soc. Psychol."},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1214\/aop\/1176993150","volume":"12","author":"E Samuel-Cahn","year":"1984","unstructured":"Samuel-Cahn, E.: Comparison of threshold stop rules and maximum for independent nonnegative random variables. Ann. Probab. 12(4), 1213\u20131216 (1984)","journal-title":"Ann. Probab."},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.jebo.2008.12.010","volume":"71","author":"D Schunk","year":"2009","unstructured":"Schunk, D., Winter, J.: The relationship between risk attitudes and heuristics in search tasks: a laboratory experiment. J. Econ. Behav. Organ. 71(2), 347\u2013360 (2009)","journal-title":"J. Econ. Behav. Organ."},{"key":"6_CR20","unstructured":"Schwartz, B.: The Paradox of Choice: Why More is Less. Ecco, New York (2004)"},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1177\/002224379202900301","volume":"29","author":"I Simonson","year":"1992","unstructured":"Simonson, I., Tversky, A.: Choice in context: tradeoff contrast and extremeness aversion. J. Mark. Res. 29(3), 281\u2013295 (1992)","journal-title":"J. Mark. Res."},{"issue":"4","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.2307\/2937956","volume":"106","author":"A Tversky","year":"1991","unstructured":"Tversky, A., Kahneman, D.: Loss aversion in riskless choice: a reference-dependent model. Q. J. Econ. 106(4), 1039\u20131061 (1991)","journal-title":"Q. J. Econ."},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Yan, Q.: Mechanism design via correlation gap. In: Randall, D. (ed.) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, 23\u201325 January 2011, pp. 710\u2013719. SIAM (2011). https:\/\/doi.org\/10.1137\/1.9781611973082.56","DOI":"10.1137\/1.9781611973082.56"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:02:23Z","timestamp":1703988143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_6"}},"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_6","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)"}}]}}