{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:52:14Z","timestamp":1764402734035},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,21]],"date-time":"2016-06-21T00:00:00Z","timestamp":1466467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10472-016-9508-8","type":"journal-article","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T03:04:14Z","timestamp":1466651054000},"page":"3-20","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Synthesis with rational environments"],"prefix":"10.1007","volume":"78","author":[{"given":"Orna","family":"Kupferman","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Perelli","sequence":"additional","affiliation":[]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,21]]},"reference":[{"key":"9508_CR1","doi-asserted-by":"publisher","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.Y.: Distributed Computing Meets Game Theory: Robust Mechanisms for Rational Secret Sharing and Multiparty Computation. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pp. 53\u201362 (2006), doi: 10.1145\/1146381.1146393","DOI":"10.1145\/1146381.1146393"},{"key":"9508_CR2","doi-asserted-by":"crossref","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. In: ICALP\u201913, LNCS, vol. 7966, pp. 15\u201327 (2013)","DOI":"10.1007\/978-3-642-39212-2_3"},{"key":"9508_CR3","doi-asserted-by":"crossref","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Discounting in LTL. In: TACAS\u201914, LNCS, vol. 8413, pp. 424\u2013439. Springer (2014)","DOI":"10.1007\/978-3-642-54862-8_37"},{"issue":"5","key":"9508_CR4","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T., Kupferman, O.: Alternating-Time Temporal logic. JACM 49(5), 672\u2013713 (2002)","journal-title":"JACM"},{"key":"9508_CR5","first-page":"287","volume":"4","author":"RJ Aumann","year":"1959","unstructured":"Aumann, R.J.: Acceptable points in general cooperative n-person games. Contributions to the Theory of Games 4, 287\u2013324 (1959)","journal-title":"Contributions to the Theory of Games"},{"key":"9508_CR6","doi-asserted-by":"crossref","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: CAV\u201909, LNCS, vol. 5643, pp. 140\u2013156. Springer (2009)","DOI":"10.1007\/978-3-642-02658-4_14"},{"key":"9508_CR7","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Pure Nash equilibria in concurrent games. In: Logical Methods in Computer Science. To appear (2015)","DOI":"10.2168\/LMCS-11(2:9)2015"},{"key":"9508_CR8","doi-asserted-by":"crossref","unstructured":"Brenguier, R., Raskin, J.F., Sankur, O.: Assume-admissible synthesis. In: CONCUR \u201915, pp. 100\u2013113 (2015)","DOI":"10.4204\/EPTCS.157.11"},{"key":"9508_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T., Jobstmann, B.: Environment Assumptions for Synthesis. In: CONCUR\u201908, LNCS, vol. 5201, pp. 147\u2013161. Springer (2008)","DOI":"10.1007\/978-3-540-85361-9_14"},{"key":"9508_CR10","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T., Piterman, N.: Strategy Logic. In: CONCUR\u201907, LNCS 4703, pp. 59\u201373. Springer (2007)","DOI":"10.1007\/978-3-540-74407-8_5"},{"key":"9508_CR11","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Majumdar, R., Jurdzinski, M.: On Nash Equilibria in Stochastic Games. In: CSL, LNCS, vol. 3210, pp. 26\u201340. Springer (2004)","DOI":"10.1007\/978-3-540-30124-0_6"},{"key":"9508_CR12","unstructured":"Church, A.: Logic, arithmetics, and automata. In: Proceedings of the International Congress of Mathematicians, pp. 23\u201335. Institut Mittag-Leffler (1963)"},{"issue":"10","key":"9508_CR13","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1109\/9.720497","volume":"43","author":"C Courcoubetis","year":"1998","unstructured":"Courcoubetis, C., Yannakakis, M.: Markov decision processes and regular events. IEEE Trans. Autom. Control 43(10), 1399\u20131418 (1998)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9508_CR14","doi-asserted-by":"crossref","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: Rational Synthesis. In: TACAS\u201910, LNCS 6015, pp. 190\u2013204. Springer (2010)","DOI":"10.1007\/978-3-642-12002-2_16"},{"key":"9508_CR15","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y.: Beyond Nash equilibrium: solution concepts for the 21st Century. In: Gamesec, pp. 1\u20133 (2011)","DOI":"10.1007\/978-3-642-25280-8_1"},{"key":"9508_CR16","doi-asserted-by":"crossref","unstructured":"Henzinger, T.: From boolean to quantitative notions of correctness. In: POPL\u201910, pp. 157\u2013158. ACM (2010)","DOI":"10.1145\/1706299.1706319"},{"key":"9508_CR17","doi-asserted-by":"publisher","unstructured":"Kupferman, O., Perelli, G., Vardi, M.Y.: Synthesis with rational environments. In: EUMAS\u201914, pp. 219\u2013235 (2014), doi: 10.1007\/978-3-319-17130-2_15","DOI":"10.1007\/978-3-319-17130-2_15"},{"issue":"2","key":"9508_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2307\/421091","volume":"5","author":"O Kupferman","year":"1999","unstructured":"Kupferman, O., Vardi, M.Y.: Church\u2019s problem revisited. Bull. Symb. Log. 5(2), 245\u2013263 (1999)","journal-title":"Bull. Symb. Log."},{"key":"9508_CR19","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems - Specification. Springer (1992)","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"9508_CR20","doi-asserted-by":"publisher","unstructured":"Mogavero, F., Murano, A., Perelli, G., Vardi, M.: Reasoning about strategies: on the Model-Checking problem. TOCL 15(4) (2014). doi: 10.1145\/2631917","DOI":"10.1145\/2631917"},{"key":"9508_CR21","doi-asserted-by":"crossref","unstructured":"Mogavero, F., Murano, A., Perelli, G., Vardi, M.Y.: What Makes ATL* Decidable? a Decidable Fragment of Strategy Logic. In: CONCUR\u201912, LNCS, vol. 7454, pp. 193\u2013208 (2012)","DOI":"10.1007\/978-3-642-32940-1_15"},{"key":"9508_CR22","unstructured":"Mogavero, F., Murano, A., Vardi, M.: Reasoning about Strategies. In: FSTTCS\u201910, LIPIcs 8, pp. 133\u2013144 (2010)"},{"issue":"1-2","key":"9508_CR23","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior 35(1-2), 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"key":"9508_CR24","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"9508_CR25","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press (1994)"},{"key":"9508_CR26","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the Synthesis of a Reactive Module. In: POPL\u201989, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"issue":"1","key":"9508_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01766400","volume":"4","author":"R Selten","year":"1975","unstructured":"Selten, R.: Reexamination of the perfectness concept for equilibrium points in extensive games. Int. J. Game Theory 4(1), 25\u201355 (1975)","journal-title":"Int. J. Game Theory"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9508-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-016-9508-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9508-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9508-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T02:02:17Z","timestamp":1656727337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-016-9508-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,21]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["9508"],"URL":"https:\/\/doi.org\/10.1007\/s10472-016-9508-8","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,21]]},"assertion":[{"value":"21 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}