SIAM J. on Computing

Keyword
DOI
Citation
Advanced Search

Search Content Type

article doi:

Citation:

Journal Description

Publication Info

ISSN info
Print: 0097-5397
Electronic: 1095-7111
Coden: SMJCAT

The SIAM Journal on Computing contains research articles on the mathematical and formal aspects of computer science and nonnumerical computing. Topics include analysis and design of algorithms, data structures, computational complexity, computational algebra, computational aspects of combinatorics and graph theory, computational geometry, computational robotics, the mathematical aspects of programming languages, artificial intelligence, computational learning, databases, information retrieval, cryptography, networks, distributed computing, parallel algorithms, and computer architecture.

Featured Article

How Hard Is It to Approximate the Best Nash Equilibrium?

Elad Hazan and Robert Krauthgamer

The quest for a polynomial-time approximation scheme (PTAS) for Nash equilibrium in a two-player game, which emerged as a major open question in algorithmic game theory, seeks to circumvent the PPAD-completeness of finding an (exact) Nash equilibrium by finding an approximate equilibrium. The closely related problem of finding an equilibrium maximizing a certain objective, such as social welfare, was shown to be NP-hard [Gilboa and Zemel, Games Econom. Behav., 1 (1989), pp. 80–93].

SIAM J. Comput. 40, pp. 79-91