{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:14Z","timestamp":1725563534340},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153747"},{"type":"electronic","value":"9783642153754"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15375-4_14","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T18:04:18Z","timestamp":1282327458000},"page":"192-206","source":"Crossref","is-referenced-by-count":12,"title":["Nash Equilibria for Reachability Objectives in Multi-player Timed Games"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Romain","family":"Brenguier","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. TCS\u00a0126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"key":"14_CR2","first-page":"672","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J.\u00a0ACM\u00a049, 672\u2013713 (2002)","journal-title":"J.\u00a0ACM"},{"key":"14_CR3","first-page":"469","volume-title":"Proc. IFAC Symp. System Structure and Control","author":"E. Asarin","year":"1998","unstructured":"Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: Proc. IFAC Symp. System Structure and Control, pp. 469\u2013474. Elsevier, Amsterdam (1998)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-73368-3_14","volume-title":"Computer Aided Verification","author":"G. Behrmann","year":"2007","unstructured":"Behrmann, G., Cougnard, A., David, A., Fleury, E., Larsen, K.G., Lime, D.: UPPAAL-Tiga: Time for playing games! In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 121\u2013125. Springer, Heidelberg (2007)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Brenguier, R., Markey, N.: Nash equilibria for reachability objectives in multi-player timed games. Research report LSV-10-12, Lab. Sp\u00e9cification & V\u00e9rification, ENS\u00a0Cachan, France (June 2010)","DOI":"10.1007\/978-3-642-15375-4_14"},{"key":"14_CR6","first-page":"160","volume-title":"LICS 2006","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzi\u0144ski, M.: Games with secure equilibria. In: LICS 2006, pp. 160\u2013169. IEEE Comp. Soc. Press, Los Alamitos (2006)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30124-0_6","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., Majumdar, R., Jurdzi\u0144ski, M.: On Nash equilibria in stochastic games. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 26\u201340. Springer, Heidelberg (2004)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","first-page":"142","volume-title":"CONCUR 2003 - Concurrency Theory","author":"L. Alfaro de","year":"2003","unstructured":"de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: The element of surprise in timed games. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 142\u2013156. Springer, Heidelberg (2003)"},{"issue":"5","key":"14_CR9","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/TMC.2006.68","volume":"5","author":"M. F\u00e9legyh\u00e1zi","year":"2006","unstructured":"F\u00e9legyh\u00e1zi, M., Hubaux, J.-P., Butty\u00e1n, L.: Nash equilibria of packet forwarding strategies in wireless ad hoc networks. IEEE Trans. Mobile Computing\u00a05(5), 463\u2013476 (2006)","journal-title":"IEEE Trans. Mobile Computing"},{"key":"14_CR10","first-page":"1","volume-title":"TARK 2005","author":"T.A. Henzinger","year":"2005","unstructured":"Henzinger, T.A.: Games in system design and verification. In: TARK 2005, pp. 1\u20134. Nat. Univ., Singapore (2005)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-71209-1_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Jurdzi\u0144ski","year":"2007","unstructured":"Jurdzi\u0144ski, M., Laroussinie, F., Sproston, J.: Model checking probabilistic timed automata with one or two clocks. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 170\u2013184. Springer, Heidelberg (2007)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Laroussinie, F., Markey, N., Oreiby, G.: On the expressiveness and complexity of ATL. LMCS\u00a04(2:7) (2008)","DOI":"10.2168\/LMCS-4(2:7)2008"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in n-person games. Proc. National Academy of Sciences of the USA\u00a036(1), 48\u201349 (1950)","journal-title":"Proc. National Academy of Sciences of the USA"},{"key":"14_CR14","unstructured":"Paul, S., Simon, S.: Nash equilibrium in generalised Muller games. In: FSTTCS 2009. LIPIcs, vol.\u00a04, pp. 335\u2013346. LZI (2009)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45657-0_5","volume-title":"Computer Aided Verification","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: Infinite games and verification (extended abstract of a tutoral). In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 58\u201364. Springer, Heidelberg (2002)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11944836_21","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"M. Ummels","year":"2006","unstructured":"Ummels, M.: Rational behaviour and strategy construction in infinite multiplayer games. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 212\u2013223. Springer, Heidelberg (2006)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-78499-9_3","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Ummels","year":"2008","unstructured":"Ummels, M.: The complexity of Nash equilibria in infinite multiplayer games. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 20\u201334. Springer, Heidelberg (2008)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-02930-1_25","volume-title":"Automata, Languages and Programming","author":"M. Ummels","year":"2009","unstructured":"Ummels, M., Wojtczak, D.: The complexity of Nash equilibria in simple stochastic multiplayer games. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 297\u2013308. Springer, Heidelberg (2009)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-04027-6_37","volume-title":"Computer Science Logic","author":"M. Ummels","year":"2009","unstructured":"Ummels, M., Wojtczak, D.: Decision problems for Nash equilibria in stochastic games. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 515\u2013530. Springer, Heidelberg (2009)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","first-page":"234","volume-title":"Computer Aided Verification","author":"I. Walukiewicz","year":"1996","unstructured":"Walukiewicz, I.: Pushdown processes: Games and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 234\u2013263. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2010 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15375-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:05:39Z","timestamp":1606187139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15375-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153747","9783642153754"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15375-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}