{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T13:18:01Z","timestamp":1774271881636,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the National Science Foundation of China","award":["12061059"],"award-info":[{"award-number":["12061059"]}]},{"name":"the National Science Foundation of China","award":["12061059"],"award-info":[{"award-number":["12061059"]}]},{"name":"the National Science Foundation of China","award":["12061059"],"award-info":[{"award-number":["12061059"]}]},{"name":"the National Science Foundation of China","award":["12061059"],"award-info":[{"award-number":["12061059"]}]},{"name":"the National Science Foundation of China","award":["12061059"],"award-info":[{"award-number":["12061059"]}]},{"name":"the Qinghai Key Laboratory of Internet of Things Project","award":["2017-ZJ-Y21"],"award-info":[{"award-number":["2017-ZJ-Y21"]}]},{"name":"the Qinghai Key Laboratory of Internet of Things Project","award":["2017-ZJ-Y21"],"award-info":[{"award-number":["2017-ZJ-Y21"]}]},{"name":"the Qinghai Key Laboratory of Internet of Things Project","award":["2017-ZJ-Y21"],"award-info":[{"award-number":["2017-ZJ-Y21"]}]},{"name":"the Qinghai Key Laboratory of Internet of Things Project","award":["2017-ZJ-Y21"],"award-info":[{"award-number":["2017-ZJ-Y21"]}]},{"name":"the Qinghai Key Laboratory of Internet of Things Project","award":["2017-ZJ-Y21"],"award-info":[{"award-number":["2017-ZJ-Y21"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00236-025-00516-9","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T10:25:25Z","timestamp":1770632725000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ramsey achievement games on graphs : algorithms and bounds"],"prefix":"10.1007","volume":"63","author":[{"given":"Xiumin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangqian","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaping","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,9]]},"reference":[{"issue":"4","key":"516_CR1","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1002\/rsa.20959","volume":"57","author":"D Conlon","year":"2022","unstructured":"Conlon, D., Das, S., Lee, J., M\u00e9sz\u00e1ros, T.: Ramsey games near the critical threshold. Random Struct. Algor. 57(4), 940\u2013957 (2022)","journal-title":"Random Struct. Algor."},{"key":"516_CR2","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/j.dam.2024.11.012","volume":"361","author":"E Duch\u00eane","year":"2025","unstructured":"Duch\u00eane, E., Gledel, V., Mc Inerney, F., Nisse, N., Oijid, N., Parreau, A., Stojakovi\u0107, M.: Complexity of Maker-Breaker games on edge sets of graphs. Discrete Applied Mathematics 361, 502\u2013522 (2025)","journal-title":"Discrete Applied Mathematics"},{"key":"516_CR3","doi-asserted-by":"crossref","unstructured":"Erickson, M., Harary, F., Ramsey, G.: theory XV: Achievement and avoidance games for bipartite graphs, Graph Theory Singapore 1983, Springer. Berlin, Heidelberg, 212\u2013216 (1984)","DOI":"10.1007\/BFb0073119"},{"key":"516_CR4","unstructured":"Galliot, F., Gravier, S., Sivignon, I.: Maker-Breaker is solved in polynomial time on hypergraphs of rank\u00a0$$3$$, arXiv preprint arXiv:2209.12819 (2022)"},{"issue":"04","key":"516_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S0963548313000151","volume":"22","author":"H Gebauer","year":"2013","unstructured":"Gebauer, H.: Size Ramsey number of bounded degree graphs for games. Combin. Probab. Comput. 22(04), 499\u2013516 (2013)","journal-title":"Combin. Probab. Comput."},{"key":"516_CR6","unstructured":"Ghose, A., Levi, A., Zhang, Y.: Graph neural networks for Ramsey graphs, In: 36th Conference on Neural Information Processing Systems (NeurIPS 2022) Workshop on MATH-AI"},{"key":"516_CR7","doi-asserted-by":"crossref","unstructured":"Goedgebeur, J., Overberghe, S.V.: New bounds for Ramsey numbers $$R(K_k-e, K_l-e)$$. Discrete Appl. Math. 307, 212\u2013221 (2022)","DOI":"10.1016\/j.dam.2021.10.023"},{"key":"516_CR8","volume-title":"Ramsey Theory","author":"RL Graham","year":"1990","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. JOHN WILEY & SONS, Hoboken (1990)"},{"key":"516_CR9","volume-title":"Computational methods for Ramsey numbers","author":"H Haanp\u00e4\u00e4","year":"2000","unstructured":"Haanp\u00e4\u00e4, H.: Computational methods for Ramsey numbers. Helsinki University of Technology, Espoo (2000)"},{"key":"516_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BFb0067364","volume-title":"Graph Theory and Applications","author":"F Harary","year":"1972","unstructured":"Harary, F.: Recent results on generalized Ramsey theory for graphs. In: Alavi, Y., et al. (eds.) Graph Theory and Applications, pp. 125\u2013138. Springer, Berlin (1972)"},{"key":"516_CR11","doi-asserted-by":"crossref","unstructured":"Harary, F.: Achievement and avoidance games for graphs, North-Holland Mathematics Studies, Vol.\u00a062, North-Holland, pp.\u00a0111\u2013119 (1982)","DOI":"10.1016\/S0304-0208(08)73554-0"},{"key":"516_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0825-5","volume-title":"Positional Games","author":"D Hefetz","year":"2014","unstructured":"Hefetz, D., Krivelevich, M., Stojakovi\u0107, M., Szab\u00f3, T.: Positional Games. Springer, Berlin (2014)"},{"key":"516_CR13","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.jcta.2017.03.008","volume":"150","author":"D Hefetz","year":"2017","unstructured":"Hefetz, D., Kusch, C., Narins, L., Pokrovskiy, A., Requil\u00e9, C., Sarid, A.: Strong Ramsey games: Drawing on an infinite board. Journal of Combinatorial Theory, Series A 150, 248\u2013266 (2017)","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"1","key":"516_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s00493-010-2436-z","volume":"30","author":"M Marciniszyn","year":"2010","unstructured":"Marciniszyn, M., Sp\u00f6hel, R.: Online vertex-coloring games in random graphs. Combinatorica 30(1), 105\u2013123 (2010)","journal-title":"Combinatorica"},{"key":"516_CR15","volume-title":"Algorithms for Computing Ramsey Numbers","author":"SV Overberghe","year":"2020","unstructured":"Overberghe, S.V.: Algorithms for Computing Ramsey Numbers. Ghent University, Master of Science, Ghent (2020)"},{"key":"516_CR16","unstructured":"Radziszowski, S.P.: Small Ramsey numbers, Electron.\u00a0J.\u00a0Combin., 1\u00a0(1994)"},{"key":"516_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"FP Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. London. Math. Soc 30, 264\u2013286 (1930)","journal-title":"Proc. London. Math. Soc"},{"issue":"3","key":"516_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90025-8","volume":"9","author":"FS Roberts","year":"1984","unstructured":"Roberts, F.S.: Applications of Ramsey theory. Discrete Applied Mathematics 9(3), 251\u2013261 (1984)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"516_CR19","doi-asserted-by":"crossref","DOI":"10.37236\/1541","volume":"11","author":"V Rosta","year":"2004","unstructured":"Rosta, V.: Ramsey theory applications. Electron. J. Combin 11(1), 89 (2004)","journal-title":"Electron. J. Combin"},{"issue":"3","key":"516_CR20","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1215\/00127094-2022-0048","volume":"172","author":"A Sah","year":"2023","unstructured":"Sah, A.: Diagonal Ramsey via effective quasirandomness. Duke Math. J. 172(3), 545\u2013567 (2023)","journal-title":"Duke Math. J."},{"key":"516_CR21","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: Graph Ramsey theory and the polynomial hierarchy, In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, ACM, (1999)","DOI":"10.1145\/301250.301411"},{"key":"516_CR22","volume-title":"Problems of unknown complexity: graph isomorphism and Ramsey theoretic numbers, Dissertation","author":"P Schweitzer","year":"2009","unstructured":"Schweitzer, P.: Problems of unknown complexity: graph isomorphism and Ramsey theoretic numbers, Dissertation. Saarland University, Germany (2009)"},{"issue":"2","key":"516_CR23","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0899-8256(02)00539-0","volume":"42","author":"E Shmaya","year":"2003","unstructured":"Shmaya, E., Solan, E., Vieille, N.: An application of Ramsey theorem to stopping games. Games and Economic Behavior 42(2), 300\u2013306 (2003)","journal-title":"Games and Economic Behavior"},{"key":"516_CR24","doi-asserted-by":"crossref","unstructured":"Slany, W.: The complexity of graph Ramsey games, In: International Conference on Computers and Games, Springer, Berlin Heidelberg, (2000)","DOI":"10.1007\/3-540-45579-5_12"},{"key":"516_CR25","volume-title":"Strong positional games, Dissertation","author":"J Stratijev","year":"2023","unstructured":"Stratijev, J.: Strong positional games, Dissertation. University of Novi Sad, Serbia (2023)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00516-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-025-00516-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00516-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:25:49Z","timestamp":1774268749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-025-00516-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,9]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["516"],"URL":"https:\/\/doi.org\/10.1007\/s00236-025-00516-9","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,9]]},"assertion":[{"value":"26 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2026","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original online version of this article was revised: due to the article grant number was incorrectly published in the article.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"6"}}