https://ens-lyon.hal.science/ensl-00376141v1Lescanne, PierrePierreLescanneLIP - Laboratoire de l'Informatique du Parallélisme - ENS de Lyon - École normale supérieure de Lyon - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - Inria - Institut National de Recherche en Informatique et en Automatique - Université de Lyon - CNRS - Centre National de la Recherche ScientifiqueDeconstruction of Infinite Extensive Games using coinductionHAL CCSD2009game theorycoinductionproof assistantextensive gameescalation[INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT]Lescanne, Pierre2009-04-16 17:03:092023-05-11 11:56:102009-04-22 20:45:49enPreprints, Working Papers, ...https://ens-lyon.hal.science/ensl-00376141v1/documenthttps://ens-lyon.hal.science/ensl-00376141v1application/pdf1Finite objects and more specifically finite games are formalized using induction, whereas infinite objects are formalized using coinduction. In this article, after an introduction to the concept of coinduction, we revisit on infinite (discrete) extensive games the basic notions of game theory. Among others, we introduce a definition of Nash equilibrium and a notion of subgame perfect equilibrium for infinite games. We use those concepts to analyze well known infinite games, like the dollar auction game and the centipede game and we show that human behaviors that are often considered as illogic are perfectly rational, if one admits that human agents reason coinductively.