How Hard is it to Approximate the Best Nash Equilibrium近似最佳的纳什均衡有多困难.pptVIP

September 23, 2008 Proximity algorithms for nearly-doubling spaces Proximity algorithms for nearly-doubling spaces Lee-Ad Gottlieb Robert Krauthgamer Weizmann Institute Proximity problems In arbitrary metric space, some proximity problems are hard For example, the nearest neighbor search problem requires Θ(n) time The doubling dimension parameterizes the “bad” case… Doubling Dimension Definition: Ball B(x,r) = all points within distance r from x. The doubling constant (of a metric M) is the minimum value ?0 such that every ball can be covered by ? balls of half the radius First