Timing games and shared memory

  • Authors:

  • Zvi Lotker;Boaz Patt-Shamir;Mark R. Tuttle

  • Affiliations:

  • CWI;Tel Aviv University;HP Labs

  • Venue:
  • DISC'05 Proceedings of the 19th international conference on Distributed Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.