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
Query complexity and the polynomial Freiman–Ruzsa conjecture
Sign Up to like & getrecommendations! Published in 2021 at "Advances in Mathematics"
DOI: 10.1016/j.aim.2021.108043
Abstract: We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at… read more here.
Keywords: ruzsa conjecture; freiman ruzsa; polynomial freiman; complexity ... See more keywords
Query complexity and cutoff dependence of the CFT2 ground state
Sign Up to like & getrecommendations! Published in 2021 at "Physical Review D"
DOI: 10.1103/physrevd.103.026015
Abstract: We present the vacuum of a two-dimensional conformal field theory as a network of Wilson lines in $SL(2,\mathbb{R})\ifmmode\times\else\texttimes\fi{}SL(2,\mathbb{R})$ Chern-Simons theory, which is conventionally used to study gravity in three-dimensional anti--de Sitter space. The position and… read more here.
Keywords: query complexity; ground state; cutoff; complexity ... See more keywords