65 citations · 195 across the 64 of their papers we have counts for
4 papers · 1 filter
Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders
Sepehr Assadi, Sahil Singla
A longstanding open problem in Algorithmic Mechanism Design is to design computationally-efficient truthful mechanisms for (approximately) maximizing welfare in combinatorial aucti…
Distributed Weighted Matching via Randomized Composable Coresets
Sepehr Assadi, MohammadHossein Bateni, Vahab Mirrokni
Maximum weight matching is one of the most fundamental combinatorial optimization problems with a wide range of applications in data mining and bioinformatics. Developing distribut…
Polynomial Pass Lower Bounds for Graph Streaming Algorithms
Sepehr Assadi, Yu Chen, Sanjeev Khanna
We present new lower bounds that show that a polynomial number of passes are necessary for solving some fundamental graph problems in the streaming model of computation. For instan…
Distributed and Streaming Linear Programming in Low Dimensions
Sepehr Assadi, Nikolai Karpov, Qin Zhang
We study linear programming and general LP-type problems in several big data (streaming and distributed) models. We mainly focus on low dimensional problems in which the number of…