{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:45:08Z","timestamp":1757616308870,"version":"3.44.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"vor","delay-in-days":5479,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0022-0000(89)90028-7","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"376-387","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["The set coincidence game: Complexity, attainability, and symmetric strategies"],"prefix":"10.1016","volume":"39","author":[{"given":"A.G.","family":"Robinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.J.","family":"Goldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90028-7_BIB1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0097-3165(82)90042-5","article-title":"Variations on a game","volume":"33","author":"Beck","year":"1982","journal-title":"J. Combin. Theory Ser. A"},{"year":"1973","series-title":"Graphs and Hypergraphs","author":"Berge","key":"10.1016\/0022-0000(89)90028-7_BIB2"},{"key":"10.1016\/0022-0000(89)90028-7_BIB3","first-page":"91","article-title":"Sur les jeux positionelles","volume":"18","author":"Berge","year":"1976","journal-title":"Cahiers Centre Etudes Rech. Op\u00e9r."},{"key":"10.1016\/0022-0000(89)90028-7_BIB4","first-page":"29","article-title":"Diameter avoidance games for graphs","volume":"1","author":"Buckley","year":"1984","journal-title":"Bull. Malaysian Math. Soc."},{"key":"10.1016\/0022-0000(89)90028-7_BIB5","first-page":"131","article-title":"Closed geodetic games for graphs","volume":"47","author":"buckley","year":"1985","journal-title":"Congr. Numer."},{"year":"1976","series-title":"On Numbers and Games","author":"Conway","key":"10.1016\/0022-0000(89)90028-7_BIB6"},{"key":"10.1016\/0022-0000(89)90028-7_BIB7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","article-title":"Bottleneck extrema","volume":"8","author":"Edmonds","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0022-0000(89)90028-7_BIB8","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1145\/321978.321989","article-title":"A combinatorial problem which is complete in polynomial space","volume":"23","author":"Even","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90028-7_BIB9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1038\/scientificamerican0757-145","article-title":"Mathematical games","volume":"197","author":"Gardner","year":"1957","journal-title":"Sci. Amer."},{"year":"1979","author":"Garey","key":"10.1016\/0022-0000(89)90028-7_BIB10"},{"key":"10.1016\/0022-0000(89)90028-7_BIB11","first-page":"111","article-title":"Achievement and avoidance games for graphs","volume":"13","author":"Harary","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0022-0000(89)90028-7_BIB12","article-title":"An achievement game on a toroidal board","volume":"Vol. 1018","author":"Harary","year":"1983"},{"key":"10.1016\/0022-0000(89)90028-7_BIB13","first-page":"570","article-title":"Extensive games","volume":"36","author":"Kuhn","year":"1950"},{"key":"10.1016\/0022-0000(89)90028-7_BIB14","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1080\/0025570X.1974.11976375","article-title":"Isolation: A game on a graph","volume":"47","author":"Ringeisen","year":"1974","journal-title":"Math. Mag."},{"key":"10.1016\/0022-0000(89)90028-7_BIB15","article-title":"On Ringeisen's isolation game","volume":"76","author":"Robinson","year":"1989","journal-title":"Discrete Math."},{"article-title":"The Isolation Game and Its Generalizations","year":"1986","author":"Robinson","key":"10.1016\/0022-0000(89)90028-7_BIB16"},{"key":"10.1016\/0022-0000(89)90028-7_BIB17","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","article-title":"Complexity of some two-person perfect-information games","volume":"16","author":"Schaefer","year":"1978","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0022-0000(89)90028-7_BIB18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0022-0000(83)90030-2","article-title":"On the complexity of chess","volume":"16","author":"Storer","year":"1983","journal-title":"J. Comput. Systems Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900287?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900287?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:10:59Z","timestamp":1757095859000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0022000089900287"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90028-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1989,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The set coincidence game: Complexity, attainability, and symmetric strategies","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(89)90028-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}