Timing games and shared memory

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

doi:10.1007/11561927_44

Timing games and shared memory

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	Distributed Computing - 19th International Conference, DISC 2005, Proceedings
Pages	507-508
Number of pages	2
DOIs	https://doi.org/10.1007/11561927_44
State	Published - 1 Dec 2005
Externally published	Yes
Event	19th International Conference on Distributed Computing, DISC 2005 - Cracow, Poland Duration: 26 Sep 2005 → 29 Sep 2005

Publication series

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

Conference

Conference	19th International Conference on Distributed Computing, DISC 2005
Country/Territory	Poland
City	Cracow
Period	26/09/05 → 29/09/05

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11561927_44

Cite this

@inproceedings{7460d8e889c9417aae0901f90d2505d0,

title = "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.",

author = "Zvi Lotker and Boaz Patt-Shamir and Tuttle, {Mark R.}",

year = "2005",

month = dec,

day = "1",

doi = "10.1007/11561927_44",

language = "English",

isbn = "3540291636",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "507--508",

booktitle = "Distributed Computing - 19th International Conference, DISC 2005, Proceedings",

note = "19th International Conference on Distributed Computing, DISC 2005 ; Conference date: 26-09-2005 Through 29-09-2005",

}

Lotker, Z, Patt-Shamir, B & Tuttle, MR 2005, Timing games and shared memory. in Distributed Computing - 19th International Conference, DISC 2005, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3724 LNCS, pp. 507-508, 19th International Conference on Distributed Computing, DISC 2005, Cracow, Poland, 26/09/05. https://doi.org/10.1007/11561927_44

Timing games and shared memory. / Lotker, Zvi; Patt-Shamir, Boaz; Tuttle, Mark R.
Distributed Computing - 19th International Conference, DISC 2005, Proceedings. 2005. p. 507-508 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3724 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Timing games and shared memory

AU - Lotker, Zvi

AU - Patt-Shamir, Boaz

AU - Tuttle, Mark R.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33646410412&partnerID=8YFLogxK

U2 - 10.1007/11561927_44

DO - 10.1007/11561927_44

M3 - Conference contribution

AN - SCOPUS:33646410412

SN - 3540291636

SN - 9783540291633

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 507

EP - 508

BT - Distributed Computing - 19th International Conference, DISC 2005, Proceedings

T2 - 19th International Conference on Distributed Computing, DISC 2005

Y2 - 26 September 2005 through 29 September 2005

ER -

Timing games and shared memory

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this