Vahab S. Mirrokni

According to our database1, Vahab S. Mirrokni authored at least 196 papers between 2000 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Regularized Online Allocation Problems: Fairness and Beyond.
CoRR, 2020

The Landscape of Nonconvex-Nonconcave Minimax Optimization.
CoRR, 2020

Bandits with adversarial scaling.
CoRR, 2020

Contextual Reserve Price Optimization in Auctions.
CoRR, 2020

A Data-Driven Metric of Incentive Compatibility.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Accelerating Gradient Boosting Machines.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Cache-aware load balancing of data center applications.
Proc. VLDB Endow., 2019

Overcommitment in Cloud Services: Bin Packing with Chance Constraints.
Manag. Sci., 2019

Concise Bid Optimization Strategies with Multiple Budget Constraints.
Manag. Sci., 2019

Adaptivity in Adaptive Submodularity.
CoRR, 2019

Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time.
CoRR, 2019

Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond.
CoRR, 2019

Batched Multi-Armed Bandits with Optimal Regret.
CoRR, 2019

Streaming Balanced Clustering.
CoRR, 2019

Dynamic First Price Auctions Robust to Heterogeneous Buyers.
CoRR, 2019

Accelerating Gradient Boosting Machine.
CoRR, 2019

Distributed Balanced Partitioning via Linear Embedding.
Algorithms, 2019

On-Device Algorithms for Public-Private Data with Absolute Privacy.
Proceedings of the World Wide Web Conference, 2019

Dynamic Algorithms for the Massively Parallel Computation Model.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement).
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Massively Parallel Computation via Remote Memory Access.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Dynamic Double Auctions: Towards First Best.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Variance Reduction in Bipartite Experiments through Correlation Clustering.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Contextual Bandits with Cross-Learning.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Randomized Experimental Design via Geographic Clustering.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Preferred Deals in General Environments.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity.
Proceedings of the 36th International Conference on Machine Learning, 2019

Categorical Feature Compression via Submodular Optimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

Distributed Weighted Matching via Randomized Composable Coresets.
Proceedings of the 36th International Conference on Machine Learning, 2019

Near-Optimal Massively Parallel Graph Connectivity.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Optimal Dynamic Auctions Are Virtual Welfare Maximizers.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Pareto Efficient Auctions with Interest Rates.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models.
ACM Trans. Economics and Comput., 2018

Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order.
SIAM J. Comput., 2018

Dynamic Mechanisms with Martingale Utilities.
Manag. Sci., 2018

Approximate Leave-One-Out for High-Dimensional Non-Differentiable Learning Problems.
CoRR, 2018

Massively Parallel Dynamic Programming on Trees.
CoRR, 2018

Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity.
CoRR, 2018

Connected Components at Scale via Local Contractions.
CoRR, 2018

Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity.
CoRR, 2018

Dynamic Mechanism Design in the Field.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Incentive-Aware Learning for Large Markets.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Stochastic bandits robust to adversarial corruptions.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Consistent Hashing with Bounded Loads.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Non-clairvoyant Dynamic Mechanism Design.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Robust Repeated Auctions under Heterogeneous Buyer Behavior.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Optimizing Cluster-based Randomized Experiments under Monotonicity.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Optimal Distributed Submodular Optimization via Sketching.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions.
Proceedings of the 35th International Conference on Machine Learning, 2018

Accelerating Greedy Coordinate Descent Methods.
Proceedings of the 35th International Conference on Machine Learning, 2018

Parallel and Streaming Algorithms for K-Core Decomposition.
Proceedings of the 35th International Conference on Machine Learning, 2018

Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy.
Proceedings of the 35th International Conference on Machine Learning, 2018

Brief Announcement: MapReduce Algorithms for Massive Trees.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
ASYMP: Fault-tolerant Mining of Massive Graphs.
CoRR, 2017

Deals or No Deals: Contract Design for Online Advertising.
Proceedings of the 26th International Conference on World Wide Web, 2017

Budget Management Strategies in Repeated Auctions.
Proceedings of the 26th International Conference on World Wide Web, 2017

Bicriteria Distributed Submodular Maximization in a Few Rounds.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Almost Optimal Streaming Algorithms for Coverage Problems.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Online Optimization for Markets and the Cloud: Theory and Practice.
Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Urbana-Champaign, IL, USA, June 05, 2017

Affinity Clustering: Hierarchical Clustering at Scale.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Dynamic Revenue Sharing.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Tight Bounds for Approximate Carathéodory and Beyond.
Proceedings of the 34th International Conference on Machine Learning, 2017

Scalable Feature Selection via Distributed Diversity Maximization.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

A Study of Compact Reserve Pricing Languages.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Market Games and Content Distribution.
Encyclopedia of Algorithms, 2016

Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders.
ACM Trans. Economics and Comput., 2016

Optimizing Display Advertising Markets: Challenges and Directions.
IEEE Internet Comput., 2016

GeoCUTS: Geographic Clustering Using Travel Statistics.
CoRR, 2016

Optimal dynamic mechanisms with ex-post IR via bank accounts.
CoRR, 2016

Distributed Coverage Maximization via Sketching.
CoRR, 2016

Expanders via Local Edge Flips.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Fair Resource Allocation in A Volatile Marketplace.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Bi-Objective Online Matching and Submodular Allocations.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Linear Relaxations for Finding Diverse Elements in Metric Spaces.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Dynamic Auctions with Bank Accounts.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Greedy Column Subset Selection: New Bounds and Distributed Algorithms.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Reservation Exchange Markets for Internet Advertising.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Dynamic Coordination Mechanisms: [Extended Abstract].
SIGMETRICS Perform. Evaluation Rev., 2015

Ego-net Community Mining Applied to Friend Suggestion.
Proc. VLDB Endow., 2015

Polyhedral Clinching Auctions and the AdWords Polytope.
J. ACM, 2015

Optimal Coordination Mechanisms for Unrelated Machine Scheduling.
Oper. Res., 2015

Decentralized utilitarian mechanisms for scheduling games.
Games Econ. Behav., 2015

Distributed Graph Algorithmics: Theory and Practice.
Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

Randomized Composable Core-sets for Distributed Submodular Maximization.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Robust Price of Anarchy Bounds via LP and Fenchel Duality.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Efficient Algorithms for Public-Private Social Networks.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Robust Hierarchical k-Center Clustering.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Automated Decomposition of Build Targets.
Proceedings of the 37th IEEE/ACM International Conference on Software Engineering, 2015

2014
On non-progressive spread of influence through social networks.
Theor. Comput. Sci., 2014

Yield Optimization of Display Advertising with Ad Exchange.
Manag. Sci., 2014

On the Advantage of Overlapping Clusters for Minimizing Conductance.
Algorithmica, 2014

Optimal revenue-sharing double auctions with applications to ad exchanges.
Proceedings of the 23rd International World Wide Web Conference, 2014

Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs.
Proceedings of the 23rd International World Wide Web Conference, 2014

Partner tiering in display advertising.
Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014

Clinching auctions beyond hard budget constraints.
Proceedings of the ACM Conference on Economics and Computation, 2014

Multiplicative bidding in online advertising.
Proceedings of the ACM Conference on Economics and Computation, 2014

Composable core-sets for diversity and coverage maximization.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Distributed Balanced Clustering via Mapping Coresets.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Coordination Mechanisms for Selfish Routing over Time on a Tree.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Connected Components in MapReduce and Beyond.
Proceedings of the ACM Symposium on Cloud Computing, 2014

2013
Optimal Auctions with Positive Network Externalities.
ACM Trans. Economics and Comput., 2013

Equilibrium pricing with positive externalities.
Theor. Comput. Sci., 2013

Two-stage Robust Network Design with Exponential Scenarios.
Algorithmica, 2013

PASS Approximation: A Framework for Analyzing and Designing Heuristics.
Algorithmica, 2013

Bicriteria Online Matching: Maximizing Weight and Cardinality.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Clinching Auction with Online Supply.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Diversity maximization under matroid constraints.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

A Local Algorithm for Finding Well-Connected Clusters.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Convergence and approximation in potential games.
Theor. Comput. Sci., 2012

How to approximate optimal auctions.
SIGecom Exch., 2012

Clinching Auctions with Online Supply
CoRR, 2012

On the Implications of Lookahead Search in Game Playing
CoRR, 2012

Overlapping clusters for distributed computation.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

On Fixed-Price Marketing for Goods with Positive Network Externalities.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Budget Optimization for Online Campaigns with Positive Carryover Effects.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Simultaneous approximations for adversarial and stochastic online budgeted allocation.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

A Theoretical Examination of Practical Game Playing: Lookahead Search.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Online allocation of display ads with smooth delivery.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

2011
Competitive routing over time.
Theor. Comput. Sci., 2011

Maximizing Non-monotone Submodular Functions.
SIAM J. Comput., 2011

Tight Approximation Algorithms for Maximum Separable Assignment Problems.
Math. Oper. Res., 2011

Approximating Minimum-Power Degree and Connectivity Problems.
Algorithmica, 2011

Permutation Betting Markets: Singleton Betting with Extra Information.
Algorithmica, 2011

Online Stochastic Weighted Matching: Improved Approximation Algorithms.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Inner product spaces for MinSum coordination mechanisms.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Large-Scale Community Detection on YouTube for Topic Discovery and Exploration.
Proceedings of the Fifth International Conference on Weblogs and Social Media, 2011

2010
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints.
SIAM J. Discret. Math., 2010

On spectrum sharing games.
Distributed Comput., 2010

Coordination Mechanisms for Weighted Sum of Completion Times in Machine Scheduling
CoRR, 2010

Online Stochastic Ad Allocation: Efficiency and Fairness
CoRR, 2010

Secure Overlay Network Design.
Algorithmica, 2010

Optimal marketing and pricing over social networks.
Proceedings of the 19th International Conference on World Wide Web, 2010

Mining advertiser-specific user behavior using adfactors.
Proceedings of the 19th International Conference on World Wide Web, 2010

Equilibrium Pricing with Positive Externalities (Extended Abstract).
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Optimal Iterative Pricing over Social Networks (Extended Abstract).
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Auctions with intermediaries: extended abstract.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Online Stochastic Packing Applied to Display Ad Allocation.
Proceedings of the Algorithms, 2010

2009
Coordination mechanisms for selfish scheduling.
Theor. Comput. Sci., 2009

Uncoordinated two-sided matching markets.
SIGecom Exch., 2009

Bid optimization for broad match ad auctions.
Proceedings of the 18th International Conference on World Wide Web, 2009

Online Ad Assignment with Free Disposal.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Non-monotone submodular maximization under matroid and knapsack constraints.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Approximating submodular functions everywhere.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

On the complexity of nash dynamics and sink equilibria.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Tutorial summary: Convergence of natural dynamics to equilibria.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Online Stochastic Matching: Beating 1-1/e.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

PASS Approximation.
Proceedings of the Approximation, 2009

2008
Market Games and Content Distribution.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Limitations of cross-monotonic cost-sharing schemes.
ACM Trans. Algorithms, 2008

Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees.
Theory Comput. Syst., 2008

Local Computation of PageRank Contributions.
Internet Math., 2008

A Unified Approach to Congestion Games and Two-Sided Markets.
Internet Math., 2008

Optimal marketing strategies over social networks.
Proceedings of the 17th International Conference on World Wide Web, 2008

A combinatorial allocation mechanism with penalties for banner advertising.
Proceedings of the 17th International Conference on World Wide Web, 2008

Trust-based recommendation systems: an axiomatic approach.
Proceedings of the 17th International Conference on World Wide Web, 2008

(Almost) optimal coordination mechanisms for unrelated machine scheduling.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Fast convergence to nearly optimal solutions in potential games.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

On the Stability of Web Crawling and Web Search.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Robust PageRank and locally computable spam detection features.
Proceedings of the AIRWeb 2008, 2008

2007
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks.
IEEE/ACM Trans. Netw., 2007

Cell Breathing in Wireless LANs: Algorithms and Evaluation.
IEEE Trans. Mob. Comput., 2007

Subjective-cost policy routing.
Theor. Comput. Sci., 2007

Power optimization for connectivity problems.
Math. Program., 2007

The Myth of the Folk Theorem.
Electronic Colloquium on Computational Complexity (ECCC), 2007

A Recommender System Based on Local Random Walks and Spectral Methods.
Proceedings of the Advances in Web Mining and Web Usage Analysis, 2007

Robust Combinatorial Optimization with Exponential Scenarios.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks.
Wirel. Networks, 2006

Market sharing games applied to content distribution in ad hoc networks.
IEEE J. Sel. Areas Commun., 2006

A relation between choosability and uniquely list colorability.
J. Comb. Theory, Ser. B, 2006

Assignment Problems in Rental Markets.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Tight approximation algorithms for maximum general assignment problems.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Bandwidth Sharing Network Design for Multi-Class Traffic.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2005
Cycle Cover with Short Cycles.
Proceedings of the STACS 2005, 2005

Sink Equilibria and Convergence.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A Simple Polynomial Time Framework For Reduced Path Decomposition in Multi-Path Routing.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Distributed Network Monitoring for Evolving IP Networks.
Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), 2004

Locality-sensitive hashing scheme based on p-stable distributions.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Convergence Issues in Competitive Games.
Proceedings of the Approximation, 2004

2003
The facility location problem with general cost functions.
Networks, 2003

2002
Length-constrained path-matchings in graphs.
Networks, 2002

RoboCup-2001: The Fifth Robotic Soccer World Championships.
AI Magazine, 2002

2001
Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges.
J. Comb. Theory, Ser. B, 2001

A Fast Vision System for Middle Size Robots in RoboCup.
Proceedings of the RoboCup 2001: Robot Soccer World Cup V, 2001

Basic Requirements for a Teamwork in Middle Size RoboCup.
Proceedings of the RoboCup 2001: Robot Soccer World Cup V, 2001

2000
On the simultaneous edge-coloring conjecture.
Discret. Math., 2000



  Loading...