The problem of designing a weighted voting game that (exactly or approximately) achieves a desired set of Shapley values has received considerable attention in the social choice literature, where several heuristics and exponential time algorithms ha…
We have considered inverse problems in approximate uniform generation for a range of interesting and well-studied classes of functions including LTFs, DNFs, CNFs, polynomial threshold functions, and more. While our findings have determined the compu…
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 that achieves the optimal approximation factor. This result is existen…
There exist many results modifying and improving Trevisan’s extractor. We briefly describe a few of them here, and refer to [Sha02] for a more extensive review.
Credentials & highlights
- Project Views