ID:14360
Type of Publication: Conference Proceedings
Authors: Zvi Lotker, B.Patt-Shamir, M.R.Tuttle
Title: Timing games and shared memory
ConferenceName: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publication: Distributed Computing. 19th International Conference, DISC 2005. Proceedings (Lecture Notes in Computer Science Vol. 3724)
Year: 2005
Volume: 3724 NCS
Pages: 507 - 508
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.
Keywords: Data storage equipment;Problem solving;Algorithms;Discrete time control systems; ,
Last Updated: 9/4/2007 12:00:00 AM
Powered by Rami Palombo © 2005
Search in: Google Scholar  |  Scitation