Verifying strategies in dialogue games

Anna Sawicka, Magdalena Kacprzak, Marcin Dziubiński, Katarzyna Budzynska

Research output: Chapter in Book/Report/Conference proceedingConference contribution


The aim of the paper is to consider a game-theoretic properties of strategies available to players in dialogue games. We treat speech acts formulated in a dialogue as moves in a dialogue game and rules for their appropriateness as rules of this game. We would like to analyze dialogical systems as a Nash-style games, and explore verification possibilities for some properties of such games e.g. dominant strategies and Nash equilibrium. Since automatic verification of such games could be of high complexity, we consider a model checking approach, which is commonly applied method allowing for verification of different systems and their properties. This method is based on solutions, which are trying to deal with the state explosion problem.

Original languageEnglish
Title of host publicationConcurrency, Specification and Programming
Subtitle of host publicationProceedings of the 23th International Workshop on Concurrency, Specification and Programming Chemnitz, Germany, September 29 - October 1, 2014
EditorsLouchka Popova-Zeugmann
Place of PublicationBerlin
PublisherHumboldt Universitat zu Berlin
Number of pages9
Publication statusPublished - 2014
Event23th International Workshop on Concurrency, Specification and Programming, CS and P 2014 - Chemnitz, Germany
Duration: 29 Sept 20141 Oct 2014

Publication series

NameCEUR Workshop Proceedings
PublisherHumbodlt University of Berlin
ISSN (Print)1613-0073


Conference23th International Workshop on Concurrency, Specification and Programming, CS and P 2014


  • Dialogue games
  • Dominant strategy
  • Formal natural dialogues
  • Game theory
  • Nash equilibrium

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Verifying strategies in dialogue games'. Together they form a unique fingerprint.

Cite this