Language Games

Abstract : 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 ‘defeats himself’ 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02354381
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Thursday, November 7, 2019 - 4:49:09 PM
Last modification on : Saturday, November 9, 2019 - 1:32:40 AM

File

asher_22181.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02354381, version 1
  • OATAO : 22181

Citation

Nicholas Asher, Soumya Paul. Language Games. 9th International Conference Logical Aspects of Computational Linguistics (LACL 2016), Dec 2016, Nancy, France. pp.1-17. ⟨hal-02354381⟩

Share

Metrics

Record views

3

Files downloads

3