{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T15:24:50Z","timestamp":1783178690901,"version":"3.54.6"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/lics.2004.1319610","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"160-169","source":"Crossref","is-referenced-by-count":7,"title":["Games with secure equilibria"],"prefix":"10.1109","author":[{"given":"K.","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T.A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Jurdzinski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75293"},{"key":"16","first-page":"1","article-title":"On the synthesis of strategies in infinite games","author":"thomas","year":"1995","journal-title":"Symposium Theoretical Aspects in Computer Science"},{"key":"13","first-page":"423","article-title":"Abstract patterns for compositional reasoning","author":"namjoshi","year":"2003","journal-title":"Concurrency Theory (CONCUR)"},{"key":"14","author":"owen","year":"1995","journal-title":"Game Theory"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.2307\/1971035"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.2307\/2586667"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585270"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1996.561320"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/203095.201069"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.36.1.48"},{"key":"6","first-page":"368","article-title":"Tree automata, ?-calculus, and determinacy","author":"emerson","year":"1991","journal-title":"Foundations of Computer Science (FOCS)"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21949"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1997.614939"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1515\/9780691215747","author":"kreps","year":"1990","journal-title":"A Course in Microeconomic Theory"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","author":"kechris","year":"1995","journal-title":"Classical Descriptive Set Theory"}],"event":{"name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","location":"Turku, Finland","start":{"date-parts":[[2004,7,17]]},"end":{"date-parts":[[2004,7,17]]}},"container-title":["Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9221\/29239\/01319610.pdf?arnumber=1319610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T09:06:24Z","timestamp":1624871184000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1319610\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/lics.2004.1319610","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}