A Game Theoretic Approach to Computer Science: Survey and Research Directions
Theoretical Computer Science classically aimed to develop a mathematical understanding of capabilities and limits of traditional computing architecture (Boole, von Neuman, Turing, Church, Godel), investigating in computability, complexity theory and algorithmics. Now it seems more natural to revisit classical computer science notions under a new game- theoretic model. The purpose of this work is to investigate some themes at the intersection of algorithmics and game theory, emphasizing both mathematical and technological issues.
|Date of creation:||07 Sep 2005|
|Date of revision:|
|Note:||Type of Document - pdf; pages: 20. ISBN 88-495-1012-8|
|Contact details of provider:|| Web page: http://econwpa.repec.org|
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:0509003. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA)
If references are entirely missing, you can add them using this form.