{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:21Z","timestamp":1776333501882,"version":"3.51.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T00:00:00Z","timestamp":1434672000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["308087"],"award-info":[{"award-number":["308087"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["601148"],"award-info":[{"award-number":["601148"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["279499"],"award-info":[{"award-number":["279499"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We study pure-strategy Nash equilibria in multi-player concurrent\ndeterministic games, for a variety of preference relations. We provide a novel\nconstruction, called the suspect game, which transforms a multi-player\nconcurrent game into a two-player turn-based game which turns Nash equilibria\ninto winning strategies (for some objective that depends on the preference\nrelations of the players in the original game). We use that transformation to\ndesign algorithms for computing Nash equilibria in finite games, which in most\ncases have optimal worst-case complexity, for large classes of preference\nrelations. This includes the purely qualitative framework, where each player\nhas a single omega-regular objective that she wants to satisfy, but also the\nlarger class of semi-quantitative objectives, where each player has several\nomega-regular objectives equipped with a preorder (for instance, a player may\nwant to satisfy all her objectives, or to maximise the number of objectives\nthat she achieves.)<\/jats:p>","DOI":"10.2168\/lmcs-11(2:9)2015","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:13:12Z","timestamp":1479733992000},"source":"Crossref","is-referenced-by-count":18,"title":["Pure Nash Equilibria in Concurrent Deterministic Games"],"prefix":"10.46298","volume":"Volume 11, Issue 2","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Romain","family":"Brenguier","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1977-7525","authenticated-orcid":false,"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Ummels","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2015,6,19]]},"reference":[{"key":"766:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1569\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1569\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:06:36Z","timestamp":1681243596000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,19]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(2:9)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1503.06826","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1503.06826","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,19]]},"article-number":"1569"}}