A Game Theoretic Approach to Computer Science: Survey and Research Directions

Crescenzio Gallo ()

Game Theory and Information from EconWPA

Abstract: 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.

Keywords: computer science; game theory; network; protocol (search for similar items in EconPapers)
JEL-codes: C7 D8 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-gth, nep-hpe and nep-ict
Date: 2005-09-07
Note: Type of Document - pdf; pages: 20. ISBN 88-495-1012-8

Downloads: (external link)
http://129.3.20.41/eps/game/papers/0509/0509003.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:wpa:wuwpga:0509003

Access Statistics for this paper

More papers in Game Theory and Information from EconWPA
Series data maintained by EconWPA ().