Logarithmic Query Complexity for Approximate Nash Computation in Large Games
Sign Up to like & getrecommendations! Published in 2018 at "Theory of Computing Systems"
DOI: 10.1007/s00224-018-9851-8
Abstract: We investigate the problem of equilibrium computation for “large” n-player games. Large games have a Lipschitz-type property that no single player’s utility is greatly affected by any other individual player’s actions. In this paper, we… read more here.
Keywords: large games; logarithmic query; player; query complexity ... See more keywords
On the computation of large-scale self-consistent-field iterations
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Mathematical Chemistry"
DOI: 10.1007/s10910-017-0731-2
Abstract: The computation of the subspace spanned by the eigenvectors associated to the N lowest eigenvalues of a large symmetric matrix (or, equivalently, the projection matrix onto that subspace) is a difficult numerical linear algebra problem… read more here.
Keywords: large scale; consistent field; self consistent; computation large ... See more keywords