{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:10:12Z","timestamp":1758672612786,"version":"3.44.0"},"reference-count":14,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.428.6","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:09:42Z","timestamp":1758042582000},"page":"62-75","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games"],"prefix":"10.4204","volume":"428","author":[{"given":"Purandar","family":"Bhaduri","sequence":"first","affiliation":[{"name":"IIT Guwahati"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2720","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"alur1997alternating","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-49213-5_2","article-title":"Alternating-time temporal logic","volume-title":"International Symposium on Compositionality","author":"Alur","year":"1997"},{"key":"BloemCJ18","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/978-3-319-10575-8_27","article-title":"Graph Games and Reactive Synthesis","volume-title":"Handbook of Model Checking","author":"Bloem","year":"2018"},{"key":"bouyer2015pure","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-11(2:9)2015","article-title":"Pure Nash equilibria in concurrent deterministic games","volume":"11","author":"Bouyer","year":"2015","journal-title":"Logical Methods in Computer Science"},{"key":"brihaye2021relevant","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.jcss.2021.02.009","article-title":"On relevant equilibria in reachability games","volume":"119","author":"Brihaye","year":"2021","journal-title":"Journal of Computer and System Sciences"},{"key":"condurache2016complexity","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4230\/LIPIcs.ICALP.2016.121","article-title":"The complexity of rational synthesis","volume-title":"43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)","author":"Condurache","year":"2016"},{"key":"finkbeiner2016synthesis","doi-asserted-by":"publisher","first-page":"72","DOI":"10.3233\/978-1-61499-627-9-72","article-title":"Synthesis of reactive systems","volume-title":"Dependable Software Systems Engineering","author":"Finkbeiner","year":"2016"},{"key":"fisman2010rational","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-12002-2_16","article-title":"Rational synthesis","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems: TACAS 2010","volume":"6015","author":"Fisman","year":"2010"},{"issue":"2","key":"gottlob1995np","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1145\/201019.201031","article-title":"NP trees and Carnap's modal logic","volume":"42","author":"Gottlob","year":"1995","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"gutierrez2023complexity","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10472-022-09804-3","article-title":"On the complexity of rational verification","volume":"91","author":"Gutierrez","year":"2023","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"hunter2005complexity","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/11549345_43","article-title":"Complexity bounds for regular games","volume-title":"International Symposium on Mathematical Foundations of Computer Science","author":"Hunter","year":"2005"},{"issue":"1","key":"kupferman2016synthesis","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-016-9508-8","article-title":"Synthesis with rational environments","volume":"78","author":"Kupferman","year":"2016","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"nash1950equilibrium","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","article-title":"Equilibrium points in n-person games","volume":"36","author":"Nash Jr","year":"1950","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"tarjan1972depth","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"wagner1990bounded","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0219058","article-title":"Bounded query classes","volume":"19","author":"Wagner","year":"1990","journal-title":"SIAM Journal on Computing"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T08:20:04Z","timestamp":1758615604000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2505.07501v4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"references-count":14,"URL":"https:\/\/doi.org\/10.4204\/eptcs.428.6","relation":{},"ISSN":["2075-2180"],"issn-type":[{"type":"electronic","value":"2075-2180"}],"subject":[],"published":{"date-parts":[[2025,9,16]]}}}