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
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
TL;DR: All algorithms presented in this paper can be used to minimize power while maintaining -edge connectivity with guaranteed approximation factors and are shown to compare favorably with existing heuristics.
Proceedings ArticleDOI
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
TL;DR: Tight information-theoretic lower bounds are provided for the welfare maximization problem in combinatorial auctions and the well-known value query model in which the permitted query to a valuation function is in the form of a subset of items, and the reply is the value assigned to that subset of Items by the valuation function.
Posted Content
Non-monotone submodular maximization under matroid and knapsack constraints
TL;DR: For the problem of maximizing a non-monotone submodular function subject to multiple matroid or knapsack constraints, a constant factor approximation algorithm was proposed in this paper.
Proceedings ArticleDOI
Fast convergence to nearly optimal solutions in potential games
TL;DR: It is shown that for asymmetric congestion games with linear and polynomial delay functions, the convergence time of α-Nash dynamics to an approximate optimal solution isPolynomial in the number of players, with approximation ratio that is arbitrarily close to the price of anarchy of the game.
Proceedings ArticleDOI
On spectrum sharing games
TL;DR: The price of anarchy of these games is related to the approximation factor of local optimization algorithms for the maximum k-colorable subgraph problem in these games and the speed of convergence is studied.