Timing games and shared memory

Zvi Lotker*, Boaz Patt-Shamir, Mark R. Tuttle

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


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.

Original languageEnglish
Title of host publicationDistributed Computing - 19th International Conference, DISC 2005, Proceedings
Number of pages2
StatePublished - 2005
Event19th International Conference on Distributed Computing, DISC 2005 - Cracow, Poland
Duration: 26 Sep 200529 Sep 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3724 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference19th International Conference on Distributed Computing, DISC 2005


Dive into the research topics of 'Timing games and shared memory'. Together they form a unique fingerprint.

Cite this