6 citations · 6 across the 1 of their papers we have counts for
2 papers
cs.GT2009★ 6 cited
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension
Elchanan Mossel, Christos Papadimitriou, Michael Schapira +1
The existence of incentive-compatible computationally-efficient protocols for combinatorial auctions with decent approximation ratios is the paradigmatic problem in computational m…
cs.CC2006
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Parikshit Gopalan, Phokion G. Kolaitis, Elitza Maneva +1
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satisf…