Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
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
- 2022
[j59]MohammadHossein Bateni, Yiwei Chen
, Dragos Florin Ciocan, Vahab S. Mirrokni:
Fair Resource Allocation in a Volatile Marketplace. Oper. Res. 70(1): 288-308 (2022)- [c184]Hossein Esfandiari, Vahab S. Mirrokni, Umar Syed, Sergei Vassilvitskii:
Label differential privacy via clustering. AISTATS 2022: 7055-7075 - [c183]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems. ALT 2022: 465-487 - [c182]Sara Ahmadian, Hossein Esfandiari, Vahab S. Mirrokni, Binghui Peng:
Robust Load Balancing with Machine Learned Advice. SODA 2022: 20-34 - [c181]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. SODA 2022: 1613-1660 - [c180]Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Almost Tight Approximation Algorithms for Explainable Clustering. SODA 2022: 2641-2663 - [c179]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. SODA 2022: 3005-3042 - [c178]Vincent Cohen-Addad, Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets. STOC 2022: 1621-1628 - [i81]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni, Balasubramanian Sivan:
From Online Optimization to PID Controllers: Mirror Descent with Momentum. CoRR abs/2202.06152 (2022) - [i80]Vincent Cohen-Addad, Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Improved Approximations for Euclidean k-means and k-median, via Nested Quasi-Independent Sets. CoRR abs/2204.04828 (2022) - [i79]Seyed Mehran Kazemi, Anton Tsitsulin, Hossein Esfandiari, MohammadHossein Bateni, Deepak Ramachandran, Bryan Perozzi, Vahab S. Mirrokni:
Tackling Provably Hard Representative Selection via Graph Neural Networks. CoRR abs/2205.10403 (2022) - [i78]Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab S. Mirrokni, Chen Wang:
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. CoRR abs/2206.07554 (2022) - [i77]Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi, Vahab S. Mirrokni, Andres Munoz, David Saulpic, Chris Schwiegelshohn, Sergei Vassilvitskii:
Scalable Differentially Private Clustering via Hierarchically Separated Trees. CoRR abs/2206.08646 (2022) - 2021
- [j58]Negin Golrezaei, Adel Javanmard, Vahab S. Mirrokni:
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions. Oper. Res. 69(1): 297-314 (2021) - [j57]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget-Management Strategies in Repeated Auctions. Oper. Res. 69(3): 859-876 (2021) - [j56]Anthony Kim, Vahab S. Mirrokni, Hamid Nazerzadeh:
Deals or No Deals: Contract Design for Online Advertising. Oper. Res. 69(5): 1450-1467 (2021) - [j55]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. Proc. VLDB Endow. 14(11): 2305-2313 (2021) - [j54]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. ACM Trans. Parallel Comput. 8(3): 13:1-13:25 (2021) - [c177]MohammadHossein Bateni, Hossein Esfandiari, Manuela Fischer, Vahab S. Mirrokni:
Extreme k-Center Clustering. AAAI 2021: 3941-3949 - [c176]Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni:
Regret Bounds for Batched Bandits. AAAI 2021: 7340-7348 - [c175]Hossein Esfandiari, Vahab S. Mirrokni, Peilin Zhong:
Almost Linear Time Density Level Set Estimation via DBSCAN. AAAI 2021: 7349-7357 - [c174]Hossein Esfandiari, Amin Karbasi, Vahab S. Mirrokni:
Adaptivity in Adaptive Submodularity. COLT 2021: 1823-1846 - [c173]Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu:
Feature Cross Search via Submodular Optimization. ESA 2021: 31:1-31:16 - [c172]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
Regularized Online Allocation Problems: Fairness and Beyond. ICML 2021: 630-639 - [c171]Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni, Song Zuo:
Revenue-Incentive Tradeoffs in Dynamic Reserve Pricing. ICML 2021: 2601-2610 - [c170]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. ICML 2021: 2676-2686 - [c169]Negin Golrezaei, Max Lin, Vahab S. Mirrokni, Hamid Nazerzadeh:
Boosted Second Price Auctions: Revenue Optimization for Heterogeneous Bidders. KDD 2021: 447-457 - [c168]Alessandro Epasto, Andrés Muñoz Medina, Steven Avery, Yijian Bai, Róbert Busa-Fekete, C. J. Carey, Ya Gao, David Guthrie, Subham Ghosh, James Ioannidis, Junyi Jiao, Jakub Lacki, Jason Lee, Arne Mauser, Brian Milch, Vahab S. Mirrokni, Deepak Ravichandran, Wei Shi, Max Spero, Yunting Sun, Umar Syed, Sergei Vassilvitskii, Shuo Wang:
Clustering for Private Interest-based Advertising. KDD 2021: 2802-2810 - [c167]Nick Doudchenko, Khashayar Khosravi, Jean Pouget-Abadie, Sébastien Lahaie, Miles Lubin, Vahab S. Mirrokni, Jann Spiess, Guido Imbens:
Synthetic Design: An Optimization Approach to Experimental Design with Synthetic Controls. NeurIPS 2021: 8691-8701 - [c166]Amin Karbasi, Vahab S. Mirrokni, Mohammad Shadravan:
Parallelizing Thompson Sampling. NeurIPS 2021: 10535-10548 - [c165]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Robust Auction Design in the Auto-bidding World. NeurIPS 2021: 17777-17788 - [c164]Shipra Agrawal, Eric Balkanski, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated First Price Auctions. EC 2021: 4 - [c163]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
The Landscape of Auto-bidding Auctions: Value versus Utility Maximization. EC 2021: 132-133 - [c162]Yuan Deng, Vahab S. Mirrokni, Song Zuo:
Non-Clairvoyant Dynamic Mechanism Design with Budget Constraints and Beyond. EC 2021: 369 - [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 - [i76]Quanquan Gu, Amin Karbasi, Khashayar Khosravi, Vahab S. Mirrokni, Dongruo Zhou:
Batched Neural Bandits. CoRR abs/2102.13028 (2021) - [i75]Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Towards Efficient Auctions in an Auto-bidding World. CoRR abs/2103.13356 (2021) - [i74]Amin Karbasi, Vahab S. Mirrokni, Mohammad Shadravan:
Parallelizing Thompson Sampling. CoRR abs/2106.01420 (2021) - [i73]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. CoRR abs/2106.02685 (2021) - [i72]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. CoRR abs/2106.05610 (2021) - [i71]Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Almost Tight Approximation Algorithms for Explainable Clustering. CoRR abs/2107.00774 (2021) - [i70]Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu:
Feature Cross Search via Submodular Optimization. CoRR abs/2107.02139 (2021) - [i69]Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, Vahab S. Mirrokni:
Bidding and Pricing in Budget and ROI Constrained Markets. CoRR abs/2107.07725 (2021) - [i68]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. CoRR abs/2108.01731 (2021) - [i67]Hossein Esfandiari, Vahab S. Mirrokni, Umar Syed, Sergei Vassilvitskii:
Label differential privacy via clustering. CoRR abs/2110.02159 (2021) - [i66]Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Tight and Robust Private Mean Estimation with Few Users. CoRR abs/2110.11876 (2021) - [i65]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. CoRR abs/2110.15533 (2021) - [i64]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Robust Auction Design in the Auto-bidding World. CoRR abs/2111.02468 (2021) - [i63]MohammadHossein Bateni, Hossein Esfandiari, Rajesh Jayaram, Vahab S. Mirrokni:
Optimal Fully Dynamic k-Centers Clustering. CoRR abs/2112.07050 (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,