APPROX
2010
Springer
13 years 11 months ago
2010
Springer
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
IMC
2007
ACM
13 years 11 months ago
2007
ACM
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...