{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:54:16Z","timestamp":1740160456626,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,7,30]],"date-time":"2018-07-30T00:00:00Z","timestamp":1532908800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s13235-018-0275-5","type":"journal-article","created":{"date-parts":[[2018,7,30]],"date-time":"2018-07-30T01:48:32Z","timestamp":1532915312000},"page":"506-520","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Survey on the Relationship Between the Game of Cops and Robbers and Other Game Representations"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8842-4040","authenticated-orcid":false,"given":"Shravan","family":"Luckraz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,30]]},"reference":[{"issue":"1","key":"275_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M Aigner","year":"1984","unstructured":"Aigner M, Fromme A (1984) A game of cops and robbers. Discrete Appl Math 8(1):1\u201312","journal-title":"Discrete Appl Math"},{"key":"275_CR2","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s00199-004-0487-3","volume":"25","author":"C Al\u00f3s-Ferrer","year":"2005","unstructured":"Al\u00f3s-Ferrer C, Ritzberger K (2005) Trees and decisions. Econ Theory 25:763\u2013798","journal-title":"Econ Theory"},{"key":"275_CR3","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.jet.2007.11.002","volume":"143","author":"C Al\u00f3s-Ferrer","year":"2008","unstructured":"Al\u00f3s-Ferrer C, Ritzberger K (2008) Trees and extensive forms. J Econ Theory 143:216\u2013250","journal-title":"J Econ Theory"},{"key":"275_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00199-011-0674-y","volume":"52","author":"C Al\u00f3s-Ferrer","year":"2013","unstructured":"Al\u00f3s-Ferrer C, Ritzberger K (2013) Large extensive forms. Econ Theory 52:75\u2013102","journal-title":"Econ Theory"},{"key":"275_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.jmateco.2015.10.005","volume":"62","author":"C Al\u00f3s-Ferrer","year":"2016","unstructured":"Al\u00f3s-Ferrer C, Ritzberger K (2016) Equilibrium existence for large perfect information games. J Math Econ 62:5\u201318","journal-title":"J Math Econ"},{"key":"275_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(84)90012-X","volume":"9","author":"T Andreae","year":"1984","unstructured":"Andreae T (1984) Note on a pursuit game played on a graph. Discrete Appl Math 9:111\u2013115","journal-title":"Discrete Appl Math"},{"key":"275_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0095-8956(86)90026-2","volume":"41","author":"T Andreae","year":"1986","unstructured":"Andreae T (1986) On a pursuit game played on graph for which a minor is excluded. J Comb Theory Ser B 41:37\u201347","journal-title":"J Comb Theory Ser B"},{"key":"275_CR8","volume-title":"Graphs, 2nd rev.","author":"C Berge","year":"1985","unstructured":"Berge C (1985) Graphs, 2nd rev. Elsevier Science Publishers, Amsterdam"},{"issue":"5","key":"275_CR9","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1016\/j.disc.2016.12.019","volume":"340","author":"A Bonato","year":"2017","unstructured":"Bonato A, Gordinowicz P, Hahn G (2017) Cops and robbers ordinals of cop-win trees. Discrete Math 340(5):951\u2013956","journal-title":"Discrete Math"},{"key":"275_CR10","series-title":"Student mathematical library, vol 61","volume-title":"The game of cops and robbers","author":"A Bonato","year":"2010","unstructured":"Bonato A, Nowakowski R (2010) The game of cops and robbers. Student mathematical library, vol 61. American Mathematical Society, Providence"},{"key":"275_CR11","doi-asserted-by":"publisher","DOI":"10.1201\/9781315212135","volume-title":"Graph searching games and probabilistic methods","author":"A Bonato","year":"2017","unstructured":"Bonato A, Pralat P (2017) Graph searching games and probabilistic methods. CRC Press, Boca Raton"},{"key":"275_CR12","first-page":"110","volume":"2","author":"A Bonato","year":"2017","unstructured":"Bonato A, MacGillivray G (2017) Characterizations and algorithms for generalized Cops and Robbers games. Contrib Discrete Math 2:110\u2013122","journal-title":"Contrib Discrete Math"},{"key":"275_CR13","doi-asserted-by":"publisher","first-page":"3834","DOI":"10.1016\/j.tcs.2010.07.003","volume":"411","author":"A Bonato","year":"2010","unstructured":"Bonato A, Chiniforooshan E, Pralat P (2010) Cops and robbers from a distance. Theor Comput Sci 411:3834","journal-title":"Theor Comput Sci"},{"key":"275_CR14","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1137\/120866932","volume":"27","author":"A Bonato","year":"2013","unstructured":"Bonato A, Mitsche D, Pralat P (2013) Vertex-pursuit in random directed acyclic graphs. SIAM J Discrete Math 27:732\u2013756","journal-title":"SIAM J Discrete Math"},{"key":"275_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/jctb.1999.1935","volume":"78","author":"G Brightwell","year":"2000","unstructured":"Brightwell G, Winkler P (2000) Gibbs measure and dismantlable graphs. J Comb Theory Ser B 78:141\u2013166","journal-title":"J Comb Theory Ser B"},{"key":"275_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2012.05.041","volume":"463","author":"J Butterfield","year":"2012","unstructured":"Butterfield J, Cranston D, Puleo G, West D, Zamani R (2012) Revolutionaries and spies: spygood and spy-bad graphs. Theor Comput Sci 463:35\u201353","journal-title":"Theor Comput Sci"},{"key":"275_CR17","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/100784035","volume":"25","author":"J Chalopin","year":"2011","unstructured":"Chalopin J, Chepoi V, Nisse N, Vaxes Y (2011) Cop and robber games when the robber can hide and ride. SIAM J Discrete Math 25:333\u2013359","journal-title":"SIAM J Discrete Math"},{"issue":"8","key":"275_CR18","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1016\/j.disc.2012.01.002","volume":"312","author":"NE Clarke","year":"2012","unstructured":"Clarke NE, MacGillivray G (2012) Characterizations of k-cop-win graphs. Discrete Math 312(8):1421\u20131425","journal-title":"Discrete Math"},{"key":"275_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7151\/dmgt.1277","volume":"25","author":"NE Clarke","year":"2005","unstructured":"Clarke NE, Nowakowski R (2005) A tandem version of the cops and robbers game played on products of graphs. Discussiones Mathematicae Graph Theory 25:241\u2013249","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"275_CR20","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.disc.2004.11.016","volume":"299","author":"NE Clarke","year":"2005","unstructured":"Clarke NE, Nowakowski R (2005) A tandem version of the cops and robbers game. Discrete Math 299:56\u201364","journal-title":"Discrete Math"},{"key":"275_CR21","first-page":"91","volume":"60","author":"NE Clarke","year":"2001","unstructured":"Clarke NE, Nowakowski R (2001) Cops, robber, and traps. Utilitas Mathematica 60:91\u201398","journal-title":"Utilitas Mathematica"},{"key":"275_CR22","first-page":"91","volume":"43","author":"NE Clarke","year":"2009","unstructured":"Clarke NE, Finbow S, Fitzpatrick S, Messinger M, Nowakowski R (2009) Seepage in directed acyclic graphs. Australas J Comb 43:91\u2013102","journal-title":"Australas J Comb"},{"key":"275_CR23","volume-title":"Competitive Markov decision processes","author":"K Vrieze Filar","year":"1997","unstructured":"Filar K Vrieze (1997) Competitive Markov decision processes. Springer, New York"},{"key":"275_CR24","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0166-218X(87)90033-3","volume":"17","author":"P Frankl","year":"1987","unstructured":"Frankl P (1987) Cops and robbers in graphs with large girths and Cayley graphs. Discrete Appl Math 17:301\u2013305","journal-title":"Discrete Appl Math"},{"key":"275_CR25","first-page":"169","volume":"52","author":"W Goddard","year":"2005","unstructured":"Goddard W, Hedetniemi M, Hedetniemi ST (2005) Eternal security in graphs. J Comb Math Comb Comput 52:169\u2013180","journal-title":"J Comb Math Comb Comput"},{"issue":"8","key":"275_CR26","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 of k-cop, l-robber games on graphs. Discrete Math 306(8):2492\u20132497","journal-title":"Discrete Math"},{"key":"275_CR27","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:590","journal-title":"J Optim Theory Appl"},{"key":"275_CR28","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.tcs.2008.02.041","volume":"399","author":"V Isler","year":"2008","unstructured":"Isler V, Kanrad N (2008) The role of information in the cop\u2013robber game. Theor Comput Sci 399:179\u2013190","journal-title":"Theor Comput Sci"},{"key":"275_CR29","doi-asserted-by":"crossref","unstructured":"Kehagias A, Mitsche D, Pralat P. (2014). The role of visibility in pursuit\/evasion games. Working Paper","DOI":"10.3390\/robotics3040371"},{"key":"275_CR30","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s40505-016-0094-z","volume":"4","author":"J Kline","year":"2016","unstructured":"Kline J, Luckraz S (2016) Equivalence between graph-based and sequence-based extensive form games. Econ Theory Bull 4:85\u201394","journal-title":"Econ Theory Bull"},{"key":"275_CR31","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 A (2016) Simultaneously moving cops and robbers. Theor Comput Sci 645:48\u201359","journal-title":"Theor Comput Sci"},{"key":"275_CR32","unstructured":"Konstantinidis G, Kehagias A (2017) Selfish cops and adversarial robber: multi-player pursuit evasion on graphs. arXiv preprint \n arXiv:1703.07695"},{"key":"275_CR33","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2017.04.004","volume":"680","author":"G Konstantinidis","year":"2017","unstructured":"Konstantinidis G, Kehagias A (2017) Selfish cops and passive robber: qualitative games. Theor Comput Sci 680:25\u201335","journal-title":"Theor Comput Sci"},{"key":"275_CR34","volume-title":"Contributions to the theory of games II","author":"H Kuhn","year":"1953","unstructured":"Kuhn H (1953) Extensive games and the problem of information. In: Kuhn H, Tucker A (eds) Contributions to the theory of games II. Princeton University Press, Princeton"},{"key":"275_CR35","volume-title":"Littlewood\u2019s miscellany","author":"JE Littlewood","year":"1986","unstructured":"Littlewood JE (1986) Littlewood\u2019s miscellany. Cambridge University Press, Cambridge"},{"key":"275_CR36","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-36387-4_2","volume-title":"Automata logics, and infinite games","author":"R Mazala","year":"2002","unstructured":"Mazala R (2002) Infinite games. In: Gr\u00e4del E, Thomas W, Wilke T (eds) Automata logics, and infinite games. Springer, Berlin, pp 23\u201338"},{"key":"275_CR37","unstructured":"Meyniel H (1985) Personal communication"},{"key":"275_CR38","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1017\/S0963548313000072","volume":"22","author":"D Mitsche","year":"2013","unstructured":"Mitsche D, Pralat P (2013) Revolutionaries and spies on random graphs. Comb Probab Comput 22:417\u2013432","journal-title":"Comb Probab Comput"},{"key":"275_CR39","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0012-365X(97)00165-9","volume":"186","author":"S Neufeld","year":"1998","unstructured":"Neufeld S, Nowakowski R (1998) A game of cops and robbers played on products of graphs. Discrete Math 186:253\u2013268","journal-title":"Discrete Math"},{"key":"275_CR40","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. Discrete Math 43:235\u2013239","journal-title":"Discrete Math"},{"key":"275_CR41","volume-title":"A course in game theory","author":"M Osborne","year":"1994","unstructured":"Osborne M, Rubinstein A (1994) A course in game theory. MIT Press, Cambridge"},{"key":"275_CR42","unstructured":"Quilliot A (1978) Jeux de points fixes sur les graphes, These de 3ieme Cycle. Universite de Paris VI, Paris, pp 131\u2013145"},{"key":"275_CR43","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 38:89\u201392 Series B","journal-title":"J Comb Theory"},{"key":"275_CR44","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01766400","volume":"4","author":"R Selten","year":"1975","unstructured":"Selten R (1975) Reexamination of the perfectness of equilibrium points in extensive games. Int J Game Theory 4:25\u201355","journal-title":"Int J Game Theory"},{"key":"275_CR45","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TRA.2002.804040","volume":"18","author":"R Vidal","year":"2002","unstructured":"Vidal R, Shakerina O, Kim J, Sastry S (2002) Probabilistic pursuit-evasion games: theory, implementation and experimental evaluation. IEEE Trans Robot Autom 18:662\u2013669","journal-title":"IEEE Trans Robot Autom"},{"key":"275_CR46","volume-title":"The theory of games and economic behavior","author":"J Neumann von","year":"1944","unstructured":"von Neumann J, Morgenstern O (1944) The theory of games and economic behavior. Princeton University Press, Princeton"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-018-0275-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13235-018-0275-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-018-0275-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T19:34:34Z","timestamp":1564428874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13235-018-0275-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,30]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["275"],"URL":"https:\/\/doi.org\/10.1007\/s13235-018-0275-5","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"type":"print","value":"2153-0785"},{"type":"electronic","value":"2153-0793"}],"subject":[],"published":{"date-parts":[[2018,7,30]]},"assertion":[{"value":"30 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}