FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
