{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:41Z","timestamp":1740103841090,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2022B1515120060","2020A1515110202"],"award-info":[{"award-number":["2022B1515120060","2020A1515110202"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10951-023-00791-9","type":"journal-article","created":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T20:01:56Z","timestamp":1699560116000},"page":"51-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The price of anarchy for a berth allocation game"],"prefix":"10.1007","volume":"27","author":[{"given":"Jiayin","family":"Pan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4334-3727","authenticated-orcid":false,"given":"Cong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,9]]},"reference":[{"issue":"2","key":"791_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., & Mansour, Y. (2009). Strong price of anarchy. Games and Economic Behavior, 65(2), 289\u2013317.","journal-title":"Games and Economic Behavior"},{"issue":"2\u20133","key":"791_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.05.010","volume":"361","author":"B Awerbuch","year":"2006","unstructured":"Awerbuch, B., Azar, Y., Richter, Y., & Tsur, D. (2006). Tradeoffs in worst-case equilibria. Theoretical Computer Science, 361(2\u20133), 200\u2013209.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"791_CR3","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.ejor.2014.12.030","volume":"244","author":"C Bierwirth","year":"2015","unstructured":"Bierwirth, C., & Meisel, F. (2015). A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 244(3), 675\u2013689. https:\/\/doi.org\/10.1016\/j.ejor.2014.12.030","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"791_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2019.12.043","volume":"284","author":"Y Bukchin","year":"2020","unstructured":"Bukchin, Y., Raviv, T., & Zaides, I. (2020). The consecutive multiprocessor job scheduling problem. European Journal of Operational Research, 284(2), 427\u2013438.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"791_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s00224-018-9857-2","volume":"63","author":"I Caragiannis","year":"2019","unstructured":"Caragiannis, I., & Fanelli, A. (2019). An almost ideal coordination mechanism for unrelated machine scheduling. Theory of Computing Systems, 63(1), 114\u2013127.","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"791_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H","volume":"46","author":"J Chen","year":"1999","unstructured":"Chen, J., & Lee, C.-Y. (1999). General multiprocessor task scheduling. Naval Research Logistics (NRL), 46(1), 57\u201374.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"1","key":"791_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1186810.1186814","volume":"3","author":"A Czumaj","year":"2007","unstructured":"Czumaj, A., & V\u00f6ocking, B. (2007). Tight bounds for worst-case equilibria. ACM Transactions on Algorithms (TALG), 3(1), 4.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"791_CR8","doi-asserted-by":"crossref","unstructured":"Finn, G., & Horowitz, E. (1979). A linear time approximation algorithm for multiprocessor scheduling. BIT Numerical Mathematics, 19(3), 312\u2013320.","DOI":"10.1007\/BF01930985"},{"issue":"5","key":"791_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-6377(02)00147-5","volume":"30","author":"Y Guan","year":"2002","unstructured":"Guan, Y., Xiao, W.-Q., Cheung, R. K., & Li, C.-L. (2002). A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis. Operations Research Letters, 30(5), 343\u2013350.","journal-title":"Operations Research Letters"},{"issue":"1","key":"791_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10878-006-9011-y","volume":"13","author":"J Huang","year":"2007","unstructured":"Huang, J., Chen, J., Chen, S., & Wang, J. (2007). A simple linear time approximation algorithm for multi-processor job scheduling on four processors. Journal of Combinatorial Optimization, 13(1), 33\u201345.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"791_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.trb.2004.04.004","volume":"39","author":"A Imai","year":"2005","unstructured":"Imai, A., Sun, X., Nishimura, E., & Papadimitriou, S. (2005). Berth allocation in a container port: Using a continuous location space approach. Transportation Research Part B: Methodological, 39(3), 199\u2013221.","journal-title":"Transportation Research Part B: Methodological"},{"key":"791_CR12","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., & Papadimitriou, C. (1999). Worst-case equilibria. In Annual symposium on theoretical aspects of computer science (pp. 404\u2013413).","DOI":"10.1007\/3-540-49116-3_38"},{"issue":"1","key":"791_CR13","first-page":"38","volume":"44","author":"T Lianeas","year":"2019","unstructured":"Lianeas, T., Nikolova, E., & Stier-Moses, N. E. (2019). Risk-averse selfish routing. Mathematics of Operations Research, 44(1), 38\u201357.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"791_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/opre.29.1.189","volume":"29","author":"EL Lloyd","year":"1981","unstructured":"Lloyd, E. L. (1981). Concurrent task systems. Operations Research, 29(1), 189\u2013201.","journal-title":"Operations Research"},{"issue":"2","key":"791_CR15","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J. (1951). Non-cooperative games. The Annals of Mathematics, 54(2), 286\u2013295.","journal-title":"The Annals of Mathematics"},{"issue":"2","key":"791_CR16","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.ejor.2021.12.040","volume":"303","author":"F Rodrigues","year":"2022","unstructured":"Rodrigues, F., & Agra, A. (2022). Berth allocation and quay crane assignment\/ scheduling problem under uncertainty: A survey. European Journal of Operational Research, 303(2), 501\u2013524.","journal-title":"European Journal of Operational Research"},{"key":"791_CR17","unstructured":"Roughgarden, T. (2004). Selfish routing with atomic players. In Proc. 16th symp. on discrete algorithms (soda) (pp. 1184\u20131185)."},{"issue":"1","key":"791_CR18","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.1050.0152","volume":"19","author":"P Schuurman","year":"2007","unstructured":"Schuurman, P., & Vredeveld, T. (2007). Performance guarantees of local search for multiprocessor scheduling. INFORMS Journal on Computing, 19(1), 52\u201363.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00791-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00791-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00791-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,11]],"date-time":"2024-02-11T13:12:54Z","timestamp":1707657174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00791-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,9]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["791"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00791-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2023,11,9]]},"assertion":[{"value":"11 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}