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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Find related papers by JEL classification: C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory D8 - Microeconomics - - Information, Knowledge, and Uncertainty
This paper has been announced in the following NEP Reports: