160 citations · 224 across the 30 of their papers we have counts for
6 papers · 1 filter
The Inverse Shapley Value Problem
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
For a weighted voting scheme used by voters to choose between two candidates, the \emph{Shapley-Shubik Indices} (or {\em Shapley values}) of provide a measure of ho…
Inverse problems in approximate uniform generation
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
We initiate the study of \emph{inverse} problems in approximate uniform generation, focusing on uniform generation of satisfying assignments of various types of Boolean functions.…
Majority is Stablest : Discrete and SoS
Anindya De, Elchanan Mossel, Joe Neeman
The Majority is Stablest Theorem has numerous applications in hardness of approximation and social choice theory. We give a new proof of the Majority is Stablest Theorem by inducti…
A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
This paper makes two contributions towards determining some well-studied optimal constants in Fourier analysis \newa{of Boolean functions} and high-dimensional geometry. \begin{enu…
Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces
Anindya De, Ilias Diakonikolas, Vitaly Feldman +1
The \emph{Chow parameters} of a Boolean function are its degree-0 and degree-1 Fourier coefficients. It has been known since 1961 (Chow, Tannenba…
Explicit Optimal Hardness via Gaussian stability results
Anindya De, Elchanan Mossel
The results of Raghavendra (2008) show that assuming Khot's Unique Games Conjecture (2002), for every constraint satisfaction problem there exists a generic semi-definite program t…