Abstract
Game theory has played a progressively more noticeable and important role in computer science topics, such as artificial intelligence, computer networking, and distributed computing, in recent years. In this paper, we provide a preliminary review of where efforts on this topic have been focused over the past several decades and find that currently, the most remarkable interface between algorithmic game theory and theoretical computer science is the computational complexity of computing a Nash equilibrium.
Author supplied keywords
Cite
CITATION STYLE
Lu, Y., & He, Y. (2014). Towards the computation of a Nash equilibrium. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8866, pp. 90–99). Springer Verlag. https://doi.org/10.1007/978-3-319-12436-0_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
