{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:55Z","timestamp":1742914255469,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662538258"},{"type":"electronic","value":"9783662538265"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T00:00:00Z","timestamp":1478736000000},"content-version":"vor","delay-in-days":314,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we summarize concepts from earlier work and demonstrate how infinite sequential games can be used to model strategic conversations. Such a model allows one to reason about the structure and complexity of various kinds of winning goals that conversationalists might have. We show how to use tools from topology, set-theory and logic to express such goals. Our contribution in this paper is to offer a detailed examination of an example in which a player \u2018defeats himself\u2019 by going inconsistent, and to introduce a simple yet revealing way of talking about unawareness. We then demonstrate how we can use ideas from epistemic game theory to define various solution concepts and justify rationality assumptions underlying a conversation.<\/jats:p>","DOI":"10.1007\/978-3-662-53826-5_1","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T11:59:48Z","timestamp":1478692788000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Language Games"],"prefix":"10.1007","author":[{"given":"Nicholas","family":"Asher","sequence":"first","affiliation":[]},{"given":"Soumya","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"key":"1_CR1","volume-title":"Logics of Conversation","author":"N Asher","year":"2003","unstructured":"Asher, N., Lascarides, A.: Logics of Conversation. Cambridge University Press, Cambridge (2003)"},{"issue":"2","key":"1_CR2","first-page":"1","volume":"6","author":"N Asher","year":"2013","unstructured":"Asher, N., Lascarides, A.: Strategic conversation. Semant. Pragmat. 6(2), 1\u201362 (2013). http:\/\/dx.doi.org\/10.3765\/sp.6.2","journal-title":"Semant. Pragmat."},{"key":"1_CR3","unstructured":"Asher, N., Paul, S.: Evaluating conversational success: weighted message exchange games. In: Hunter, J., Stone, M. (eds.) 20th workshop on the semantics and Pragmatics of Dialogue (SEMDIAL), New Jersey, USA, July 2016 (To appear)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Asher, N., Paul, S., Venant, A.: Message exchange games in strategic conversations. J. Philos. Log. (2016, in press)","DOI":"10.1007\/s10992-016-9402-1"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-4068(74)90037-8","volume":"1","author":"R Aumann","year":"1974","unstructured":"Aumann, R.: Subjectivity and correlation in randomized strategies. J. Math. Econ. 1, 67\u201396 (1974)","journal-title":"J. Math. Econ."},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/B:SYNT.0000024912.56773.5e","volume":"139","author":"A Baltag","year":"2004","unstructured":"Baltag, A., Moss, L.S.: Logics for epistemic programs. Synthese 139(2), 165\u2013224 (2004)","journal-title":"Synthese"},{"key":"1_CR7","unstructured":"Baltag, A., Moss, L.S., Solecki, S.: The logic of public announcements, common knowledge and private suspicions. Technical report SEN-R9922, Centrum voor Wiskunde en Informatica (1999)"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1090-9443(02)00054-6","volume":"57","author":"P Battigalli","year":"2003","unstructured":"Battigalli, P.: Rationalizability in infinite dynamic games with incomplete information. Res. Econ. 57(1), 1\u201338 (2003)","journal-title":"Res. Econ."},{"key":"1_CR9","first-page":"1","volume":"3","author":"P Battigalli","year":"2003","unstructured":"Battigalli, P., Siniscalchi, M.: Rationalization and incomplete information. B.E. J. Theoret. Econ. 3, 1\u201346 (2003)","journal-title":"B.E. J. Theoret. Econ."},{"issue":"4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.2307\/1911196","volume":"52","author":"BD Bernheim","year":"1984","unstructured":"Bernheim, B.D.: Rationalizable strategic behaviour. Econometrica 52(4), 1007\u20131028 (1984)","journal-title":"Econometrica"},{"issue":"6","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.2307\/1913390","volume":"50","author":"V Crawford","year":"1982","unstructured":"Crawford, V., Sobel, J.: Strategic information transmission. Econometrica 50(6), 1431\u20131451 (1982)","journal-title":"Econometrica"},{"key":"1_CR12","first-page":"619","volume-title":"Handbook of Game Theory with Economic Applications","author":"E Dekel","year":"2015","unstructured":"Dekel, E., Siniscalchi, M.: Epistemic game theory (chapter 12). In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory with Economic Applications, vol. 4, pp. 619\u2013702. Elsevier Publications, Cambridge (2015)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-14729-6_2","volume-title":"Interfaces: Explorations in Logic, Language and Computation","author":"M Franke","year":"2010","unstructured":"Franke, M.: Semantic meaning and pragmatic inference in non-cooperative conversation. In: Icard, T., Muskens, R. (eds.) ESSLLI 2008-2009. LNCS (LNAI), vol. 6211, pp. 13\u201324. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14729-6_2"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Gaiffman, H.: On local and non-local properties. In: Proceedings of Herbrand Symposium, Logic Colloquium 1981. North Holland (1982)","DOI":"10.1016\/S0049-237X(08)71879-2"},{"issue":"6","key":"1_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1111\/j.1468-0262.2004.00551.x","volume":"72","author":"J Glazer","year":"2004","unstructured":"Glazer, J., Rubinstein, A.: On optimal rules of persuasion. Econometrica 72(6), 119\u2013123 (2004)","journal-title":"Econometrica"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research [Outcome of a Dagstuhl Seminar, February 2001]","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research [Outcome of a Dagstuhl Seminar, February 2001]. LNCS, vol. 2500. Springer, Heidelberg (2002)"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1287\/mnsc.14.3.159","volume":"14","author":"JC Harsanyi","year":"1967","unstructured":"Harsanyi, J.C.: Games with incomplete information played by Bayesian players, parts i-iii. Manag. Sci. 14, 159\u2013182 (1967)","journal-title":"Manag. Sci."},{"key":"1_CR18","unstructured":"Hellman, Z., Levy, Y.: Bayesian games with a continuum of states. Technical report, Bar Ilan University (2013)"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A Kechris","year":"1995","unstructured":"Kechris, A.: Classical Descriptive Set Theory. Springer, New York (1995)"},{"key":"1_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, New York (2004)"},{"key":"1_CR21","unstructured":"McNaughton, R., Papert, S.: Counter-free automata. In: Research Monograph, vol. 65. MIT Press, Cambridge (1971)"},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"key":"1_CR23","volume-title":"Infinite Words - Automata, Semigroups, Logic and Games","author":"D Perrin","year":"1995","unstructured":"Perrin, D., Pin, J.E.: Infinite Words - Automata, Semigroups, Logic and Games. Elsevier, Cambridge (1995)"},{"issue":"3","key":"1_CR24","first-page":"355","volume":"87","author":"AM Spence","year":"1973","unstructured":"Spence, A.M.: Job market signaling. J. Econ. 87(3), 355\u2013374 (1973)","journal-title":"J. Econ."},{"key":"1_CR25","unstructured":"Venant, A., Asher, N.: Dynamics of public commitments in dialogue. In: Proceedings of 11th International Conference on Computational Semantics, pp. 272\u2013282. Association for Computational Linguistics, London, April 2015"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Asher, N., Venant, A.: Ok or not ok? In: Semantics and Linguistic Theory 25. Cornell University Press (2015)","DOI":"10.3765\/salt.v25i0.3072"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996\u20132016)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53826-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:20:38Z","timestamp":1709821238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-53826-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662538258","9783662538265"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53826-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"10 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LACL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logical Aspects of Computational Linguistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lacl2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lacl.gforge.inria.fr\/lacl-2016\/index-presentation.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}