Consider a player playing against different opponents in two extensive form games simultaneously. Can she then have a strategy in one game using information from the other? The famous example of playing chess against two grandmasters simultaneously illustrates such reasoning. We consider a simple dynamic logic of extensive form games with sequential and parallel composition in which such situations can be expressed. We present a complete axiomatization and show that the satisfiability problem for the logic is decidable
We define solution concepts appropriate for computationally bounded players playing a fixed finite g...
We construct a dynamic epistemic model for extensive form games, which generates a hierarchy of beli...
This paper presents a range of expressiveness and complexity results for the specification, computat...
Consider a player playing against different opponents in two extensive form games simultaneously. Ca...
Consider a player playing against different opponents in two extensive form games simultaneously. Ca...
AbstractThe aim of this work is to propose a logical framework for representing interacting agents i...
We consider a propositional dynamic logic whose programs are regular expressions over game- strategy...
The aim of this work is to propose a logical framework for representing interacting agents in the co...
Edited by Hans van Ditmarsch, David Fernández Duque, Valentin Goranko, Wojtek Jamroga, Manuel Ojeda-...
The aim of this work is to propose a logical framework for representing inter-acting agents in the c...
Abstract. We consider a dynamic logic of game composition, where atomic games are in normal form. We...
This paper addresses the question of what it takes to obtain a well-defined extensive form game. Wit...
Nash equilibrium in every subgame of the game. In a series of papers, Douglas Bridges investigated c...
This thesis formalizes a model of bounded rationality in extensive-form games called game-playing sc...
This paper provides a self-contained definition and a characterization of the class of extensive for...
We define solution concepts appropriate for computationally bounded players playing a fixed finite g...
We construct a dynamic epistemic model for extensive form games, which generates a hierarchy of beli...
This paper presents a range of expressiveness and complexity results for the specification, computat...
Consider a player playing against different opponents in two extensive form games simultaneously. Ca...
Consider a player playing against different opponents in two extensive form games simultaneously. Ca...
AbstractThe aim of this work is to propose a logical framework for representing interacting agents i...
We consider a propositional dynamic logic whose programs are regular expressions over game- strategy...
The aim of this work is to propose a logical framework for representing interacting agents in the co...
Edited by Hans van Ditmarsch, David Fernández Duque, Valentin Goranko, Wojtek Jamroga, Manuel Ojeda-...
The aim of this work is to propose a logical framework for representing inter-acting agents in the c...
Abstract. We consider a dynamic logic of game composition, where atomic games are in normal form. We...
This paper addresses the question of what it takes to obtain a well-defined extensive form game. Wit...
Nash equilibrium in every subgame of the game. In a series of papers, Douglas Bridges investigated c...
This thesis formalizes a model of bounded rationality in extensive-form games called game-playing sc...
This paper provides a self-contained definition and a characterization of the class of extensive for...
We define solution concepts appropriate for computationally bounded players playing a fixed finite g...
We construct a dynamic epistemic model for extensive form games, which generates a hierarchy of beli...
This paper presents a range of expressiveness and complexity results for the specification, computat...