{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:54:39Z","timestamp":1740160479435,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T00:00:00Z","timestamp":1618704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T00:00:00Z","timestamp":1618704000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s13235-021-00385-0","type":"journal-article","created":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T13:02:31Z","timestamp":1618750951000},"page":"785-802","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Some Game-Theoretic Remarks on Two-Player Generalized Cops and Robbers Games"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7703-3658","authenticated-orcid":false,"given":"Athanasios","family":"Kehagias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Konstantinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,18]]},"reference":[{"key":"385_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511973468","volume-title":"Lectures in game theory for computer scientists","author":"KR Apt","year":"2011","unstructured":"Apt KR, Gr\u00e4del E (2011) Lectures in game theory for computer scientists. Cambridge University Press, Cambridge"},{"issue":"4","key":"385_CR2","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1006\/aama.1993.1019","volume":"14","author":"A Berarducci","year":"1993","unstructured":"Berarducci A, Intrigila B (1993) On the cop number of a graph. Adv Appl Math 14(4):389\u2013403","journal-title":"Adv Appl Math"},{"key":"385_CR3","unstructured":"Berwanger D (2013) \u201cGraph games with perfect information.\u201d Preprint"},{"key":"385_CR4","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/061","volume-title":"The game of cops and robbers on graphs","author":"A Bonato","year":"2011","unstructured":"Bonato A, Nowakowski R (2011) The game of cops and robbers on graphs. American Mathematical Society, USA"},{"key":"385_CR5","unstructured":"Bonato A, MacGillivray G (2017) Characterizations and algorithms for generalized Cops and Robbers games. Contributions to Discrete Mathematics, vol.12"},{"key":"385_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"TH Chung","year":"2011","unstructured":"Chung TH, Hollinger GA, Isler V (2011) Search and pursuit-evasion in mobile robotics. Auton Robots 31:299\u2013310","journal-title":"Auton Robots"},{"key":"385_CR7","doi-asserted-by":"crossref","unstructured":"Filar J, Vrieze K (1996) Competitive Markov Decision Processes","DOI":"10.1007\/978-1-4612-4054-9"},{"issue":"3","key":"385_CR8","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"FV Fomin","year":"2008","unstructured":"Fomin FV, Thilikos DM (2008) An annotated bibliography on guaranteed graph searching. Theor Comput Sci 399(3):236\u2013245","journal-title":"Theor Comput Sci"},{"issue":"19\u201320","key":"385_CR9","doi-asserted-by":"publisher","first-page":"2492","DOI":"10.1016\/j.disc.2005.12.038","volume":"306","author":"G Hahn","year":"2006","unstructured":"Hahn G, MacGillivray G (2006) A note on $$k$$-cop, $$l$$-robber games on graphs. Discret Math 306(19\u201320):2492\u20132497","journal-title":"Discret Math"},{"issue":"2","key":"385_CR10","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/s10957-017-1155-7","volume":"175","author":"G Ibragimov","year":"2017","unstructured":"Ibragimov G, Luckraz S (2017) On a characterization of evasion strategies for pursuit-evasion games on graphs. J Optim Theory Appl 175(2):590\u2013596","journal-title":"J Optim Theory Appl"},{"key":"385_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2017.04.004","volume":"680","author":"A Kehagias","year":"2017","unstructured":"Kehagias A, Konstantinidis G (2017) Selfish cops and passive robber: qualitative games. Theor Comput Sci 680:25\u201335","journal-title":"Theor Comput Sci"},{"key":"385_CR12","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2019.02.025","volume":"780","author":"A Kehagias","year":"2019","unstructured":"Kehagias A, Konstantinidis G (2019) Selfish cops and active robber: multi-player pursuit evasion on graphs. Theor Comput Sci 780:84\u2013102","journal-title":"Theor Comput Sci"},{"key":"385_CR13","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1007\/s13235-018-0288-0","volume":"9","author":"A Kehagias","year":"2019","unstructured":"Kehagias A (2019) Generalized cops and robbers: a multi-player Pursuit game on graphs. Dyn Games Appl 9:1076\u20131099","journal-title":"Dyn Games Appl"},{"key":"385_CR14","unstructured":"Kehagias A, Konstantinidis G. \u201cSome Game Theoretic Remarks on Two-Player Generalized Cops and Robbers Games.\u201d arXiv:2007.14758"},{"key":"385_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2016.06.039","volume":"645","author":"G Konstantinidis","year":"2016","unstructured":"Konstantinidis G, Kehagias Ath (2016) Simultaneously moving cops and robbers. Theor Comput Sci 645:48\u201359","journal-title":"Theor Comput Sci"},{"issue":"2","key":"385_CR16","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/s13235-018-0275-5","volume":"9","author":"S Luckraz","year":"2019","unstructured":"Luckraz S (2019) A survey on the relationship between the game of cops and robbers and other game representations. Dyn Games Appl 9(2):506\u2013520","journal-title":"Dyn Games Appl"},{"key":"385_CR17","doi-asserted-by":"crossref","unstructured":"Mazala R (2002) Infinite games. Automata logics, and infinite games. Springer, Berlin, Heidelberg, pp 23-38","DOI":"10.1007\/3-540-36387-4_2"},{"key":"385_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R Nowakowski","year":"1983","unstructured":"Nowakowski R, Winkler P (1983) Vertex-to-vertex pursuit in a graph. Discret Math 43:235\u2013239","journal-title":"Discret Math"},{"key":"385_CR19","unstructured":"Quilliot A (1978) Th\u00e8se de 3\u00e8me cycle, Universit\u00e9 de Paris VI, pp 131\u2013145"},{"key":"385_CR20","unstructured":"Quilliot A (1983) Problemes de jeux, de point fixe, de connectivite et de representation sur des graphes, des ensembles ordonnes et des hypergraphes"},{"key":"385_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0095-8956(85)90093-0","volume":"38","author":"A Quilliot","year":"1985","unstructured":"Quilliot A (1985) A short note about pursuit games played on a graph with a given genus. J Comb Theory Ser B 38:89\u201392","journal-title":"J Comb Theory Ser B"},{"key":"385_CR22","doi-asserted-by":"publisher","DOI":"10.5117\/9789085550402","volume-title":"Stochastic multiplayer games: theory and algorithms","author":"M Ummels","year":"2010","unstructured":"Ummels M (2010) Stochastic multiplayer games: theory and algorithms. Amsterdam University Press, Amsterdam"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-021-00385-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13235-021-00385-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-021-00385-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T13:30:32Z","timestamp":1635082232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13235-021-00385-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,18]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["385"],"URL":"https:\/\/doi.org\/10.1007\/s13235-021-00385-0","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"type":"print","value":"2153-0785"},{"type":"electronic","value":"2153-0793"}],"subject":[],"published":{"date-parts":[[2021,4,18]]},"assertion":[{"value":"18 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}