4 citations · 6 across the 3 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2009★ 2 cited
Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games
Pierre Lescanne
An abstraction of normal form games is proposed, called Feasibility/Desirability Games (or FD Games in short). FD Games can be seen from three points of view: as a new presentation…
cs.GT2009★ 4 cited
Deconstruction of Infinite Extensive Games using coinduction
Pierre Lescanne
Finite objects and more specifically finite games are formalized using induction, whereas infinite objects are formalized using coinduction. In this article, after an introduction…
cs.GT2008
(Mechanical) Reasoning on Infinite Extensive Games
Pierre Lescanne
In order to better understand reasoning involved in analyzing infinite games in extensive form, we performed experiments in the proof assistant Coq that are reported here.