117 citations · 167 across the 5 of their papers we have counts for
5 papers
Quasi-Proportional Mechanisms: Prior-free Revenue Maximization
Vahab Mirrokni, S. Muthukrishnan, Uri Nadav
Inspired by Internet ad auction applications, we study the problem of allocating a single item via an auction when bidders place very different values on the item. We formulate thi…
Online Stochastic Matching: Beating 1-1/e
Jon Feldman, Aranyak Mehta, Vahab Mirrokni +1
We study the online stochastic bipartite matching problem, in a form motivated by display ad allocation on the Internet. In the online, but adversarial case, the celebrated result…
On the complexity of Nash dynamics and Sink Equilibria
Vahab Mirrokni, Alexander Skopalik
Studying Nash dynamics is an important approach for analyzing the outcome of games with repeated selfish behavior of self-interested agents. Sink equilibria has been introduced by…
Non-monotone submodular maximization under matroid and knapsack constraints
Jon Lee, Vahab Mirrokni, Viswanath Nagarjan +1
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hyp…
Bid Optimization in Broad-Match Ad auctions
Eyal Even-dar, Yishay Mansour, Vahab Mirrokni +2
Ad auctions in sponsored search support ``broad match'' that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expr…