Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDVahab S. Mirrokni
Seyed Vahab Mirrokni
Person information
- affiliation: Google Research, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j54]Negin Golrezaei
, Adel Javanmard, Vahab S. Mirrokni:
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions. Oper. Res. 69(1): 297-314 (2021)- [c164]MohammadHossein Bateni, Hossein Esfandiari, Manuela Fischer, Vahab S. Mirrokni:
Extreme k-Center Clustering. AAAI 2021: 3941-3949 - [c163]Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni:
Regret Bounds for Batched Bandits. AAAI 2021: 7340-7348 - [c162]Hossein Esfandiari, Vahab S. Mirrokni, Peilin Zhong:
Almost Linear Time Density Level Set Estimation via DBSCAN. AAAI 2021: 7349-7357 - [c161]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Non-Excludable Dynamic Mechanism Design. SODA 2021: 1357-1373 - [c160]Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Towards Efficient Auctions in an Auto-bidding World. WWW 2021: 3965-3973 - [i66]Quanquan Gu, Amin Karbasi, Khashayar Khosravi, Vahab S. Mirrokni, Dongruo Zhou:
Batched Neural Bandits. CoRR abs/2102.13028 (2021) - [i65]Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Towards Efficient Auctions in an Auto-bidding World. CoRR abs/2103.13356 (2021) - [i64]Amin Karbasi, Vahab S. Mirrokni, Mohammad Shadravan:
Parallelizing Thompson Sampling. CoRR abs/2106.01420 (2021) - [i63]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. CoRR abs/2106.02685 (2021) - 2020
- [j53]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching auctions with online supply. Games Econ. Behav. 123: 342-358 (2020) - [j52]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. Proc. VLDB Endow. 13(13): 3588-3602 (2020) - [c159]Haihao Lu, Sai Praneeth Karimireddy, Natalia Ponomareva, Vahab S. Mirrokni:
Accelerating Gradient Boosting Machines. AISTATS 2020: 516-526 - [c158]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
Dual Mirror Descent for Online Allocation Problems. ICML 2020: 613-628 - [c157]Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni:
Robust Pricing in Dynamic Mechanism Design. ICML 2020: 2494-2503 - [c156]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Bandits with Adversarial Scaling. ICML 2020: 6511-6521 - [c155]Alessandro Epasto, Mohammad Mahdian, Jieming Mao, Vahab S. Mirrokni, Lijie Ren:
Smoothly Bounding User Contributions in Differential Privacy. NeurIPS 2020 - [c154]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Emmanouil Zampetakis:
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions. NeurIPS 2020 - [c153]Joey Huchette, Haihao Lu, Hossein Esfandiari, Vahab S. Mirrokni:
Contextual Reserve Price Optimization in Auctions via Mixed Integer Programming. NeurIPS 2020 - [c152]Mahsa Derakhshan, Negin Golrezaei, Vahideh H. Manshadi, Vahab S. Mirrokni:
Product Ranking on Online Platforms. EC 2020: 459 - [c151]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget-Constrained Incentive Compatibility for Stationary Mechanisms. EC 2020: 607-608 - [c150]Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni:
Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time. SODA 2020: 2492-2508 - [c149]Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni, Song Zuo:
A Data-Driven Metric of Incentive Compatibility. WWW 2020: 1796-1806 - [i62]Joey Huchette, Haihao Lu, Hossein Esfandiari, Vahab S. Mirrokni:
Contextual Reserve Price Optimization in Auctions. CoRR abs/2002.08841 (2020) - [i61]Negin Golrezaei, Adel Javanmard, Vahab S. Mirrokni:
Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions. CoRR abs/2002.11137 (2020) - [i60]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Bandits with adversarial scaling. CoRR abs/2003.02287 (2020) - [i59]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
The Landscape of Nonconvex-Nonconcave Minimax Optimization. CoRR abs/2006.08667 (2020) - [i58]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
Regularized Online Allocation Problems: Fairness and Beyond. CoRR abs/2007.00514 (2020) - [i57]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. CoRR abs/2009.11552 (2020) - [i56]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems. CoRR abs/2010.10628 (2020) - [i55]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Manolis Zampetakis:
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions. CoRR abs/2010.11450 (2020) - [i54]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems. CoRR abs/2011.10124 (2020)
2010 – 2019
- 2019
- [j51]Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Balanced Partitioning via Linear Embedding. Algorithms 12(8): 162 (2019) - [j50]Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Overcommitment in Cloud Services: Bin Packing with Chance Constraints. Manag. Sci. 65(7): 3255-3271 (2019) - [j49]Arash Asadpour, MohammadHossein Bateni, Kshipra Bhawalkar, Vahab S. Mirrokni:
Concise Bid Optimization Strategies with Multiple Budget Constraints. Manag. Sci. 65(12): 5785-5812 (2019) - [j48]Aaron Archer, Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni, Aaron Schild, Ray Yang, Richard Zhuang:
Cache-aware load balancing of data center applications. Proc. VLDB Endow. 12(6): 709-723 (2019) - [c148]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Pareto Efficient Auctions with Interest Rates. AAAI 2019: 1989-1995 - [c147]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Optimal Dynamic Auctions Are Virtual Welfare Maximizers. AAAI 2019: 2125-2132 - [c146]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. FOCS 2019: 1615-1636 - [c145]Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Weighted Matching via Randomized Composable Coresets. ICML 2019: 333-343 - [c144]MohammadHossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni, Afshin Rostamizadeh:
Categorical Feature Compression via Submodular Optimization. ICML 2019: 515-523 - [c143]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity. ICML 2019: 1833-1842 - [c142]Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni:
Preferred Deals in General Environments. IJCAI 2019: 231-237 - [c141]David Rolnick, Kevin Aydin, Jean Pouget-Abadie, Shahab Kamali, Vahab S. Mirrokni, Amir Najmi:
Randomized Experimental Design via Geographic Clustering. KDD 2019: 2745-2753 - [c140]Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni:
A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions. NeurIPS 2019: 8654-8664 - [c139]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, Jon Schneider:
Contextual Bandits with Cross-Learning. NeurIPS 2019: 9676-9685 - [c138]Negin Golrezaei, Adel Javanmard, Vahab S. Mirrokni:
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions. NeurIPS 2019: 9756-9766 - [c137]Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni:
Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond. NeurIPS 2019: 10044-10054 - [c136]Jean Pouget-Abadie, Kevin Aydin, Warren Schudy, Kay Brodersen, Vahab S. Mirrokni:
Variance Reduction in Bipartite Experiments through Correlation Clustering. NeurIPS 2019: 13288-13298 - [c135]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Dynamic Double Auctions: Towards First Best. SODA 2019: 157-172 - [c134]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity. SODA 2019: 255-273 - [c133]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. SODA 2019: 1616-1635 - [c132]Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement). SPAA 2019: 41-42 - [c131]Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis:
Dynamic Algorithms for the Massively Parallel Computation Model. SPAA 2019: 49-58 - [c130]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. SPAA 2019: 59-68 - [c129]Alessandro Epasto, Hossein Esfandiari, Vahab S. Mirrokni:
On-Device Algorithms for Public-Private Data with Absolute Privacy. WWW 2019: 405-416 - [e1]Ioannis Caragiannis, Vahab S. Mirrokni, Evdokia Nikolova:
Web and Internet Economics - 15th International Conference, WINE 2019, New York, NY, USA, December 10-12, 2019, Proceedings. Lecture Notes in Computer Science 11920, Springer 2019, ISBN 978-3-030-35388-9 [contents] - [i53]Haihao Lu, Sai Praneeth Karimireddy, Natalia Ponomareva, Vahab S. Mirrokni:
Accelerating Gradient Boosting Machine. CoRR abs/1903.08708 (2019) - [i52]MohammadHossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni, Afshin Rostamizadeh:
Categorical Feature Compression via Submodular Optimization. CoRR abs/1904.13389 (2019) - [i51]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Warren Schudy, Vahab S. Mirrokni:
Massively Parallel Computation via Remote Memory Access. CoRR abs/1905.07533 (2019) - [i50]Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis:
Dynamic Algorithms for the Massively Parallel Computation Model. CoRR abs/1905.09175 (2019) - [i49]Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Weighted Matching via Randomized Composable Coresets. CoRR abs/1906.01993 (2019) - [i48]Shipra Agrawal, Eric Balkanski, Vahab S. Mirrokni, Balasubramanian Sivan:
Dynamic First Price Auctions Robust to Heterogeneous Buyers. CoRR abs/1906.03286 (2019) - [i47]Hossein Esfandiari, Vahab S. Mirrokni, Peilin Zhong:
Streaming Balanced Clustering. CoRR abs/1910.00788 (2019) - [i46]Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni:
Batched Multi-Armed Bandits with Optimal Regret. CoRR abs/1910.04959 (2019) - [i45]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. CoRR abs/1910.05385 (2019) - [i44]Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni:
Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond. CoRR abs/1910.12414 (2019) - [i43]Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni:
Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time. CoRR abs/1911.01839 (2019) - [i42]Hossein Esfandiari, Amin Karbasi, Vahab S. Mirrokni:
Adaptivity in Adaptive Submodularity. CoRR abs/1911.03620 (2019) - 2018
- [j47]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme:
Dynamic Mechanisms with Martingale Utilities. Manag. Sci. 64(11): 5062-5082 (2018) - [j46]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. SIAM J. Comput. 47(3): 1056-1086 (2018) - [j45]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. ACM Trans. Economics and Comput. 6(3-4): 14:1-14:23 (2018) - [c128]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Brief Announcement: MapReduce Algorithms for Massive Trees. ICALP 2018: 162:1-162:4 - [c127]Shipra Agrawal, Morteza Zadimoghaddam, Vahab S. Mirrokni:
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy. ICML 2018: 99-108 - [c126]Hossein Esfandiari, Silvio Lattanzi, Vahab S. Mirrokni:
Parallel and Streaming Algorithms for K-Core Decomposition. ICML 2018: 1396-1405 - [c125]Haihao Lu, Robert M. Freund, Vahab S. Mirrokni:
Accelerating Greedy Coordinate Descent Methods. ICML 2018: 3263-3272 - [c124]Shuaiwen Wang, Wenda Zhou, Haihao Lu, Arian Maleki, Vahab S. Mirrokni:
Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions. ICML 2018: 5215-5224 - [c123]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Optimal Distributed Submodular Optimization via Sketching. KDD 2018: 1138-1147 - [c122]Jean Pouget-Abadie, Vahab S. Mirrokni, David C. Parkes, Edoardo M. Airoldi:
Optimizing Cluster-based Randomized Experiments under Monotonicity. KDD 2018: 2090-2099 - [c121]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Non-clairvoyant Dynamic Mechanism Design. EC 2018: 169 - [c120]Shipra Agrawal, Constantinos Daskalakis, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated Auctions under Heterogeneous Buyer Behavior. EC 2018: 171 - [c119]Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam:
Consistent Hashing with Bounded Loads. SODA 2018: 587-604 - [c118]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Stochastic bandits robust to adversarial corruptions. STOC 2018: 114-122 - [c117]Vahab S. Mirrokni, Renato Paes Leme, Rita Ren, Song Zuo:
Dynamic Mechanism Design in the Field. WWW 2018: 1359-1368 - [c116]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Song Zuo:
Incentive-Aware Learning for Large Markets. WWW 2018: 1369-1378 - [i41]Shipra Agrawal, Constantinos Daskalakis, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated Auctions under Heterogeneous Buyer Behavior. CoRR abs/1803.00494 (2018) - [i40]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Stochastic bandits robust to adversarial corruptions. CoRR abs/1803.09353 (2018) - [i39]Shuaiwen Wang, Wenda Zhou, Haihao Lu, Arian Maleki, Vahab S. Mirrokni:
Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions. CoRR abs/1807.02694 (2018) - [i38]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity. CoRR abs/1807.07889 (2018) - [i37]Jakub Lacki, Vahab S. Mirrokni, Michal Wlodarczyk:
Connected Components at Scale via Local Contractions. CoRR abs/1807.10727 (2018) - [i36]Hossein Esfandiari, Silvio Lattanzi, Vahab S. Mirrokni:
Parallel and Streaming Algorithms for K-Core Decomposition. CoRR abs/1808.02546 (2018) - [i35]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity. CoRR abs/1808.06932 (2018) - [i34]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Massively Parallel Dynamic Programming on Trees. CoRR abs/1809.03685 (2018) - [i33]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, Jon Schneider:
Contextual Bandits with Cross-learning. CoRR abs/1809.09582 (2018) - [i32]Shuaiwen Wang, Wenda Zhou, Arian Maleki, Haihao Lu, Vahab S. Mirrokni:
Approximate Leave-One-Out for High-Dimensional Non-Differentiable Learning Problems. CoRR abs/1810.02716 (2018) - [i31]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Optimal Dynamic Auctions are Virtual Welfare Maximizers. CoRR abs/1812.02993 (2018) - 2017
- [c115]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni, Saeed Seddighin:
A Study of Compact Reserve Pricing Languages. AAAI 2017: 363-368 - [c114]Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Scalable Feature Selection via Distributed Diversity Maximization. AAAI 2017: 2876-2883 - [c113]Vahab S. Mirrokni, Renato Paes Leme, Adrian Vladu, Sam Chiu-wai Wong:
Tight Bounds for Approximate Carathéodory and Beyond. ICML 2017: 2440-2448 - [c112]Santiago R. Balseiro, Max Lin, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Dynamic Revenue Sharing. NIPS 2017: 2681-2689 - [c111]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni:
Affinity Clustering: Hierarchical Clustering at Scale. NIPS 2017: 6864-6874 - [c110]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme:
Dynamic Mechanisms with Martingale Utilities. EC 2017: 165 - [c109]Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Overcommitment in Cloud Services Bin packing with Chance Constraints. SIGMETRICS (Abstracts) 2017: 7 - [c108]Vahab S. Mirrokni:
Online Optimization for Markets and the Cloud: Theory and Practice. SIGMETRICS (Abstracts) 2017: 47-48 - [c107]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Almost Optimal Streaming Algorithms for Coverage Problems. SPAA 2017: 13-23 - [c106]Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Bicriteria Distributed Submodular Maximization in a Few Rounds. SPAA 2017: 25-33 - [c105]Vahab S. Mirrokni, Hamid Nazerzadeh:
Deals or No Deals: Contract Design for Online Advertising. WWW 2017: 7-14 - [c104]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget Management Strategies in Repeated Auctions. WWW 2017: 15-23 - [i30]Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Overcommitment in Cloud Services - Bin packing with Chance Constraints. CoRR abs/1705.09335 (2017) - [i29]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR abs/1711.03076 (2017) - [i28]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. CoRR abs/1711.05764 (2017) - [i27]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. CoRR abs/1712.05450 (2017) - [i26]Eduardo Fleury, Silvio Lattanzi, Vahab S. Mirrokni, Bryan Perozzi:
ASYMP: Fault-tolerant Mining of Massive Graphs. CoRR abs/1712.09731 (2017) - 2016
- [j44]Nitish Korula, Vahab S. Mirrokni, Hamid Nazerzadeh:
Optimizing Display Advertising Markets: Challenges and Directions. IEEE Internet Comput. 20(1): 28-35 (2016) - [j43]Nikhil R. Devanur, Zhiyi Huang, Nitish Korula, Vahab S. Mirrokni, Qiqi Yan:
Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders. ACM Trans. Economics and Comput. 4(3): 14:1-14:20 (2016) - [c103]Gagan Goel, Stefano Leonardi, Vahab S. Mirrokni, Afshin Nikzad, Renato Paes Leme:
Reservation Exchange Markets for Internet Advertising. ICALP 2016: 142:1-142:13 - [c102]Jason Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam:
Greedy Column Subset Selection: New Bounds and Distributed Algorithms. ICML 2016: 2539-2548 - [c101]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Dynamic Auctions with Bank Accounts. IJCAI 2016: 387-393 - [c100]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Bi-Objective Online Matching and Submodular Allocations. NIPS 2016: 2739-2747 - [c99]Aditya Bhaskara, Mehrdad Ghadiri, Vahab S. Mirrokni, Ola Svensson:
Linear Relaxations for Finding Diverse Elements in Metric Spaces. NIPS 2016: 4098-4106 - [c98]MohammadHossein Bateni, Yiwei Chen, Dragos Florin Ciocan, Vahab S. Mirrokni:
Fair Resource Allocation in A Volatile Marketplace. EC 2016: 819 - [c97]Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia:
Expanders via Local Edge Flips. SODA 2016: 259-269 - [c96]Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Balanced Partitioning via Linear Embedding. WSDM 2016: 387-396 - [r2]Vahab S. Mirrokni:
Market Games and Content Distribution. Encyclopedia of Algorithms 2016: 1189-1195 - [i25]Jason Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam:
Greedy Column Subset Selection: New Bounds and Distributed Algorithms. CoRR abs/1605.08795 (2016) - [i24]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Optimal dynamic mechanisms with ex-post IR via bank accounts. CoRR abs/1605.08840 (2016) - [i23]Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam:
Consistent Hashing with Bounded Loads. CoRR abs/1608.01350 (2016) - [i22]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Almost Optimal Streaming Algorithms for Coverage Problems. CoRR abs/1610.08096 (2016) - [i21]David Rolnick, Kevin Aydin, Shahab Kamali, Vahab S. Mirrokni, Amir Najmi:
GeoCUTS: Geographic Clustering Using Travel Statistics. CoRR abs/1611.03780 (2016) - [i20]