abstract: Quitting games are discrete time games where, at each time step, the players choose independently between stopping the game or continue. If at least one player decides to stop, the game is over and everybody obtain a reward which depends on whom were the stoppers. While the discounted case is well understood, the question about the existence of an equilibria for undiscounted games is open since a very long time. Our contribution consist to embed the game in a continuous time setting. This permits to use tools from functional analysis to study the game and develop an algorithm to search for equilibria.