Timing games and shared memory

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

Volumn 3724 LNCS, Issue , 2005, Pages 507-508

  Lotker, Zvi ^a   Patt Shamir, Boaz ^b   Tuttle, Mark R ^c  

^a CWI   (Netherlands)

^b TEL AVIV UNIVERSITY   (Israel)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NASH EQUILIBRIUM; SHARED MEMORY; TIMING GAMES;

ALGORITHMS; DATA STORAGE EQUIPMENT; DISCRETE TIME CONTROL SYSTEMS; PROBLEM SOLVING;

GAME THEORY;

EID: 33646410412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561927_44     Document Type: Conference Paper

References (5)

1. M. R. Baye, D. Kovenock, and C. de Vries. A general linear model of contests. Mimeo, 1998. Unpublished manscript available from http://www.nash- equilibrium.com/baye/Contests.pdf.
2. D. Fudenberg and J. Tirole. Game Theory. MIT Press, 1991.
3. K. Hendricks, A. Weiss, and C. Wilson. The war of attrition in continuous time with complete information. International Economic Review, 29(4):663-680, Nov. 1988.
4. H. Hotelling. Stability in competition. Economic Journal, 39:41-57, 1929.
5. J. Maynard Smith. The theory of games and the evolution in animal conflicts. Journal of Theoretical Biology, 47:209-221, 1974.