• Publications
  • Influence
Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity
TLDR
We show that if D is a distribution over subadditive valuations with independent items, then the better of pricing each item separately or pricing only the grand bundle achieves a constant-factor approximation to the revenue of the optimal mechanism. Expand
  • 95
  • 10
  • PDF
The Hunting of the SNARK
TLDR
We formulate a general and relatively natural notion of an extractable collision-resistant hash function (ECRH) and show that, if ECRHs exist, then a modified version of Di Crescenzo and Lipmaa’s protocol is a succinct non-interactive argument for NP. Expand
  • 91
  • 5
  • PDF
Inapproximability of Nash Equilibrium
TLDR
We prove that finding an ε-approximate Nash equilibrium is PPAD-complete for constant ε and a particularly simple class of games: polymatrix, degree 3 graphical games, in which each player has only two actions. Expand
  • 48
  • 5
  • PDF
Distributed PCP Theorems for Hardness of Approximation in P
TLDR
We present a new distributed} model of probabilistically checkable proofs (PCP). Expand
  • 61
  • 5
  • PDF
Hardness of approximate nearest neighbor search
TLDR
We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Expand
  • 64
  • 4
  • PDF
On the Complexity of Dynamic Mechanism Design
TLDR
We introduce a dynamic mechanism design problem in which the designer wants to offer for sale an item to an agent, and another item to the same agent at some point in the future. Expand
  • 35
  • 4
  • PDF
Settling the Complexity of Computing Approximate Two-Player Nash Equilibria
  • A. Rubinstein
  • Mathematics, Computer Science
  • IEEE 57th Annual Symposium on Foundations of…
  • 14 June 2016
TLDR
We prove that there exists a constant ε > 0 such that, assuming the Exponential Time Hypothesis for PPAD, computing an ε-approximate Nash equilibrium in a two-player (n × n) game requires quasi-polynomial time, nlog1-o(1) n. Expand
  • 49
  • 3
  • PDF
Can Almost Everybody be Almost Happy?
TLDR
We conjecture that PPAD has a PCP-like complete problem, seeking a near equilibrium in which all but very few players have very little incentive to deviate. Expand
  • 27
  • 3
  • PDF
An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
TLDR
We study the adaptivity of submodular maximization and show that no algorithm can achieve a constant factor approximation in $\tilde{o}(\log n) adaptive rounds. Expand
  • 45
  • 2
  • PDF
Combinatorial Prophet Inequalities
TLDR
We introduce a novel framework of Prophet Inequalities for combinatorial valuation functions. Expand
  • 47
  • 2
  • PDF