Timing games and shared memory

Abstract

We model a simple problem in advertising as a strategic timing game, and consider continuous and discrete versions of this game. For the continuous game, we completely characterize the Nash equilibrium for two players. For the discrete game, we give an efficient algorithm to compute the Nash equilibrium for n players. © Springer-Verlag Berlin Heidelberg 2005.