{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:07:42Z","timestamp":1743001662893,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"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_21","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"295-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Curse of Rationality in Sequential Scheduling Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4334-3727","authenticated-orcid":false,"given":"Cong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486\u2013504 (1997). https:\/\/doi.org\/10.1145\/258128.258201","journal-title":"J. ACM"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1017\/S0960129515000079","volume":"27","author":"V Bil\u00f2","year":"2017","unstructured":"Bil\u00f2, V., Fanelli, A., Moscardelli, L.: On lookahead equilibria in congestion games. Math. Struct. Comput. Sci. 27(2), 197\u2013214 (2017). https:\/\/doi.org\/10.1017\/S0960129515000079","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s00224-013-9529-1","volume":"56","author":"V Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V., Flammini, M., Monaco, G., Moscardelli, L.: Some anomalies of farsighted strategic behavior. Theory Comput. Syst. 56(1), 156\u2013180 (2013). https:\/\/doi.org\/10.1007\/s00224-013-9529-1","journal-title":"Theory Comput. Syst."},{"key":"21_CR4","unstructured":"Chen, C., Giessler, P., Mamageishvili, A., Mihal\u00e1k, M., Penna, P.: Sequential solutions in machine scheduling games. CoRR abs\/1611.04159 (2016), http:\/\/arxiv.org\/abs\/1611.04159"},{"key":"21_CR5","unstructured":"Chen, C., Xu, Y.: The curse of rationality in sequential scheduling games. CoRR abs\/2009.03634 (2020). https:\/\/arxiv.org\/abs\/2009.03634"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.trb.2016.01.002","volume":"85","author":"X Di","year":"2016","unstructured":"Di, X., Liu, H.X.: Boundedly rational route choice behavior: a review of models and methodologies. Transp. Res. Part B Methodol. 85, 142\u2013179 (2016)","journal-title":"Transp. Res. Part B Methodol."},{"key":"21_CR7","unstructured":"Groenland, C., Sch\u00e4fer, G.: The curse of ties in congestion games with limited lookahead. In: Andr\u00e9, E., Koenig, S., Dastani, M., Sukthankar, G. (eds.) Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, 10\u201315 July 2018, pp. 1941\u20131943. ACM (2018). http:\/\/dl.acm.org\/citation.cfm?id=3238031"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009). https:\/\/doi.org\/10.1016\/j.cosrev.2009.04.003","journal-title":"Comput. Sci. Rev."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"103218","DOI":"10.1016\/j.artint.2019.103218","volume":"283","author":"C Kroer","year":"2020","unstructured":"Kroer, C., Sandholm, T.: Limited lookahead in imperfect-information games. Artif. Intell. 283, 103218 (2020). https:\/\/doi.org\/10.1016\/j.artint.2019.103218","journal-title":"Artif. Intell."},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1111\/j.1467-6419.2010.00670.x","volume":"25","author":"C Lee","year":"2011","unstructured":"Lee, C.: Bounded rationality and the emergence of simplicity amidst complexity. J. Econ. Surv. 25(3), 507\u2013526 (2011)","journal-title":"J. Econ. Surv."},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Leme, R.P., Syrgkanis, V., Tardos, \u00c9.: The curse of simultaneity. In: Goldwasser, S. (ed.) Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, 8\u201310 January 2012, pp. 60\u201367. ACM (2012). https:\/\/doi.org\/10.1145\/2090236.2090242","DOI":"10.1145\/2090236.2090242"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-33996-7_22","volume-title":"Algorithmic Game Theory","author":"V Mirrokni","year":"2012","unstructured":"Mirrokni, V., Thain, N., Vetta, A.: A theoretical examination of practical game playing: lookahead search. In: Serna, M. (ed.) SAGT 2012. LNCS, pp. 251\u2013262. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33996-7_22"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"C Shannon","year":"1950","unstructured":"Shannon, C.: Programming a computer for playing chess. Philos. Mag. 41(4), 256\u2013275 (1950)","journal-title":"Philos. Mag."},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/1884852","volume":"69","author":"HA Simon","year":"1955","unstructured":"Simon, H.A.: A behavioral model of rational choice. Q. J. Econ. 69(1), 99\u2013118 (1955)","journal-title":"Q. J. Econ."},{"key":"21_CR15","first-page":"16","volume":"2010","author":"KV Velupillai","year":"2010","unstructured":"Velupillai, K.V.: Foundations of boundedly rational choice and satisficing decisions. Adv. Decis. Sci. 2010, 16 (2010)","journal-title":"Adv. Decis. 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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:10:14Z","timestamp":1607159414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_21","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)"}}]}}