V
Vahab Mirrokni
Researcher at Google
Publications - 390
Citations - 16175
Vahab Mirrokni is an academic researcher from Google. The author has contributed to research in topics: Computer science & Common value auction. The author has an hindex of 57, co-authored 346 publications receiving 14255 citations. Previous affiliations of Vahab Mirrokni include Vassar College & Microsoft.
Papers
More filters
Proceedings ArticleDOI
Dynamic Algorithms for the Massively Parallel Computation Model
TL;DR: In this article, the authors study dynamic algorithms in the MPC model and provide new efficient dynamic MPC algorithms for a variety of fundamental graph problems, including connectivity, minimum spanning tree and matching.
Proceedings Article
Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions.
TL;DR: Two frameworks to obtain a computationally efficient approximation ALO of the leave-one-out cross validation (LOOCV) risk for nonsmooth losses and regularizers are proposed and the equivalence of the two approaches under smoothness conditions is proved.
Posted Content
On the complexity of Nash dynamics and Sink Equilibria
TL;DR: All of the above questions for a variety of classes of games with succinct representation are answered, including anonymous games, player-specific and weighted congestion games, valid-utility games, and two-sided market games.
Proceedings ArticleDOI
On the complexity of nash dynamics and sink equilibria
TL;DR: In this article, the complexity of sink equilibria in games with repeated selfish behavior of self-interested agents was studied, including anonymous games, player-specific and weighted congestion games, valid-utility games, and two-sided market games.
Posted Content
Distributed Balanced Partitioning via Linear Embedding
TL;DR: In this article, the authors study a distributed balanced partitioning problem where the goal is to partition the vertices of a given graph into k pieces so as to minimize the total cut size.