In the Densest k-Subgraph (D k S) problem, given an undirected graph G and an integer k,
the goal is to find a subgraph of G on k vertices that contains maximum number of edges …

In our recent paper [Rubinstein 2016] we rule out a PTAS for the 2-Player Nash Equilibrium
Problem. More precisely, we prove that there exists a constant ϵ> 0 such that, assuming the …

Reinforcement learning with function approximation has recently achieved tremendous
results in applications with large state spaces. This empirical success has motivated a …

A $(k\times l) $-birthday repetition $\mathcal {G}^{k\times l} $ of a two-prover game $\mathcal
{G} $ is a game in which the two provers are sent random sets of questions from $\mathcal …

The technological advancements made in recent times, particularly in artificial intelligence
(AI) and quantum computing, have brought about significant changes in technology. These …

We study the optimization problem faced by a perfectly informed principal in a Bayesian
game, who reveals information to the players about the state of nature to obtain a desirable …

Many results in fine-grained complexity reveal intriguing consequences from solving various
SAT problems even slightly faster than exhaustive search. We prove a “self-improving”(or …

We formulate a new hardness assumption, the Strongish Planted Clique Hypothesis
(SPCH), which postulates that any algorithm for planted clique must run in time $ n^{\Omega …

We present algorithmic applications of an approximate version of Caratheodory's theorem.
The theorem states that given a set of vectors X in Rd, for every vector in the convex hull of X …

The 3SUM problem is to decide, given a set of n real numbers, whether any three sum to
zero. It is widely conjectured that a trivial O (n 2)-time algorithm is optimal on the Real RAM …