We present a novel coalgebraic formulation of infinite extensive games. We define both the game trees and the strategy profiles by possibly infinite systems of corecursive equations. Certain strategy profiles are proved to be subgame perfect equilibria using a novel proof principle of predicate coinduction which is shown to be sound by reducing it to Kozen’s metric coinduction. We characterize all subgame perfect equilibria for the dollar auction game. The economically interesting feature is that in order to prove these results we do not need to rely on continuity assumptions on the payoffs which amount to discounting the future. In particular, we prove a form of one-deviation principle without any such assumptions. This suggests that coa...
We consider a dynamical approach to game in extensive forms. By restricting the convertibility relat...
Nash equilibrium in every subgame of the game. In a series of papers, Douglas Bridges investigated c...
Escalation in games is when agents keep playing forever. Based on formal proofs we claim that if age...
We present a novel coalgebraic formulation of infinite extensive games. We define both the game tree...
We present a novel coalgebraic formulation of infinite extensive games. We define both the game tree...
19 pFinite objects and more specifically finite games are formalized using induction, whereas infini...
Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite m...
The aim of this of this paper is to study infinite games and to prove formally some properties in th...
International audienceWe study a new application of coinduction, namely escalation which is a typica...
International audienceEscalation is the fact that in a game (for instance an auction), the agents pl...
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in inf...
International audienceWe present infinite extensive strategy profiles with perfect information and w...
We consider extensive games with perfect information with well-founded game trees and study the prob...
We show that a strategy is a Nash equilibrium in a game with a continuum of players if and only if t...
This paper considers subgame perfect equilibria of continuous-time repeated games with perfect monit...
We consider a dynamical approach to game in extensive forms. By restricting the convertibility relat...
Nash equilibrium in every subgame of the game. In a series of papers, Douglas Bridges investigated c...
Escalation in games is when agents keep playing forever. Based on formal proofs we claim that if age...
We present a novel coalgebraic formulation of infinite extensive games. We define both the game tree...
We present a novel coalgebraic formulation of infinite extensive games. We define both the game tree...
19 pFinite objects and more specifically finite games are formalized using induction, whereas infini...
Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite m...
The aim of this of this paper is to study infinite games and to prove formally some properties in th...
International audienceWe study a new application of coinduction, namely escalation which is a typica...
International audienceEscalation is the fact that in a game (for instance an auction), the agents pl...
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in inf...
International audienceWe present infinite extensive strategy profiles with perfect information and w...
We consider extensive games with perfect information with well-founded game trees and study the prob...
We show that a strategy is a Nash equilibrium in a game with a continuum of players if and only if t...
This paper considers subgame perfect equilibria of continuous-time repeated games with perfect monit...
We consider a dynamical approach to game in extensive forms. By restricting the convertibility relat...
Nash equilibrium in every subgame of the game. In a series of papers, Douglas Bridges investigated c...
Escalation in games is when agents keep playing forever. Based on formal proofs we claim that if age...