Google NYC Algorithms Publications

Mission

Perform cutting-edge research in algorithms, optimization and economics, and use it to deliver solutions to fundamental challenges across Google's business.

Google NYC Algorithms consists of three teams: Market Algorithms, Graph Mining, and Large-scale Optimization.

Publications

2017

• A Study of Compact Reserve Pricing Languages
  • MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni, Saeed Seddighin
  • AAAI 2017

• Almost Optimal Streaming Algorithms for Coverage Problems
  • Mohammadhossein Bateni, Hossein Esfandiari, Vahab Mirrokni
  • 29th ACM Symposium on Parallelism in Algorithms and Architectures (2017)

• Bicriteria Distributed Submodular Maximization in a Few Rounds
  • Alessandro Epasto, Vahab Mirrokni, Morteza Zadimoghaddam
  • SPAA (2017)

• Budget Management Strategies in Repeated Auctions
  • Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni
  • WWW (2017)

• Computing Walrasian Equilibria: Fast Algorithms and Structural Properties
  • Renato Paes Leme, Sam Chiu-wai Wong
  • ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)

• Deals or No Deals: Contract Design for Online Advertising
  • Vahab S. Mirrokni, Hamid Nazerzadeh
  • WWW (2017)

• Dynamic Mechanisms with Martingale Utilities
  • Santiago Balseiro, Vahab Mirrokni, Renato Paes Leme
  • ACM EC (2017)

• Indexing Public-Private Graphs
  • Aaron Archer, Silvio Lattanzi, Peter Likarish, Sergei Vassilvitskii
  • WWW'17

• Scalable Feature Selection via Distributed Diversity Maximization
  • Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam
  • AAAI (2017)

• Submodular Optimization Over Sliding Windows
  • Alessandro Epasto, Morteza Zadimoghaddam, Sergei Vassilvitskii, Silvio Lattanzi
  • Proceedings of the 26th International World Wide Web Conference, WWW (2017)

• The Spread of Physical Activity Through Social Networks
  • Alessandro Epasto
  • Proceedings of the 26th International World Wide Web Conference, WWW (2017)

• Ties That Bind: Characterizing Classes by Attributes and Social Ties
  • Aria Rezaei, Bryan Perozzi, Leman Akoglu
  • WWW'17

2016

• A Field Guide to Personalized Reserve Prices
  • Renato Paes Leme, Martin Pál, Sergei Vassilvitskii
  • WWW'16 (2016)

• Almost Optimal Streaming Algorithms for Coverage Problems
  • Mohammadhossein Bateni, Hossein Esfandiari, Vahab Mirrokni
  • CoRR (2016)

• Bi-Objective Online Matching and Submodular Allocations
  • Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni
  • NIPS (2016)

• Consistent Hashing with Bounded Loads
  • Vahab Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
  • CoRR (2016)

• Distributed Balanced Partitioning via Linear Embedding
  • Kevin Aydin, Mohammadhossein Bateni, Vahab Mirrokni
  • WSDM 2016: Ninth ACM International Conference on Web Search and Data Mining, ACM

• Distributed Coverage Maximization via Sketching
  • MohammadHossein Bateni, Hossein Esfandiari, Vahab Mirrokni
  • arXiv (2016)

• Dynamic Auctions with Bank Accounts
  • Vahab Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo
  • IJCAI (2016)

• Dynamic Mechanisms with Martingale Utilities
  • Santiago Balseiro, Vahab Mirrokni, Renato Paes Leme
  • SSRN (2016)

• Ego-net Community Mining Applied to Friend Suggestion
  • Alessandro Epasto, Silvio Lattanzi, Vahab S. Mirrokni, Ismail Sebe, Ahmed Taei, Sunita Verma
  • Proceedings of VLDB (2016)

• Expander via Local Edge Flips
  • Zeyuan Allen-Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab Mirrokni, Lorenzo Orecchia
  • SODA (2016)

• Fair Resource Allocation in A Volatile Marketplace
  • MohammadHossein Bateni, Yiwei Chen, Dragos Florin Ciocan, Vahab S. Mirrokni
  • EC 2016

• Feature-based Dynamic Pricing
  • Maxime Cohen, Ilan Lobel, Renato Paes Leme
  • Proceedings of the 2016 ACM Conference on Economics and Computation

• Greedy Column Subset Selection: New Bounds and Distributed Algorithms
  • Aditya Bhaskara, Afshin Rostamizadeh, Jason Altschuler, Morteza Zadimoghaddam, Thomas Fu, Vahab Mirrokni
  • ICML (2016)

• Linear Relaxations for Finding Diverse Elements in Metric Spaces
  • Aditya Bhaskara, Mehrdad Ghadiri, Vahab S. Mirrokni, Ola Svensson
  • NIPS 2016

• Linking Users Across Domains with Location Data: Theory and Validation
  • Chistopher Riederer, Yunsung Kim, Nitish Korula, Silvio Lattanzi, Augustin Chaintreau
  • WWW (2016)

• Multidimensional Binary Search for Contextual Decision-Making
  • Ilan Lobel, Renato Paes Leme, Adrian Vladu
  • CoRR (2016)

• Oblivious Dynamic Mechanism Design
  • Vahab Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo
  • SSRN (2016)

• On Sampling Nodes in a Network
  • Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi, Tamas Sarlos
  • WWW (2016)

• Optimal Content Placement for a Large-Scale VoD System
  • David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K.K. Ramakrishnan
  • IEEE/ACM Transactions on Networking, vol. 24 (2016), pp. 2114-2127

• Pricing a low-regret seller
  • Hoda Heidari, Mohammad Mahdian, Umar Syed, Sergei Vassilvitskii, Sadra Yazdanbod
  • Proceedings of the Thirty-Third International Conference on Machine Learning (ICML 2016)

• Reservation Exchange Markets for Internet Advertising
  • Gagan Goel, Stefano Leonardi, Vahab Mirrokni, Afshin Nikzad, Renato Paes-Leme
  • LIPIcs, vol. 55, 142:1-142:13

• TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size
  • Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal
  • ACM SIGKDD (2016)

• When Recommendation Goes Wrong - Anomalous Link Discovery in Recommendation Networks
  • Bryan Perozzi, Michael Schueppert, Jack Saalweachter, Mayur Thakur
  • Proceedings of the 22th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2016)

• Where to sell: Simulating auctions from learning algorithms
  • Hamid Nazerzadeh, Renato Paes Leme, Afshin Rostamizadeh, Umar Syed
  • Proceedings of the Seventeenth ACM Conference on Economics and Computation (EC2016)

2015

• Automated Decomposition of Build Targets
  • Mohsen Vakilian, Raluca Sauciuc, J. David Morgenthaler, Vahab Mirrokni
  • Proceedings of the 37th International Conference on Software Engineering, IEEE Computer Society (2015), pp. 123-133

• Decentralized utilitarian mechanisms for scheduling games
  • Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver
  • Games and Economic Behavior 92 (2015)

• Distributed Graph Algorithmics: Theory and Practice
  • Silvio Lattanzi, Vahab S. Mirrokni
  • WSDM (2015), pp. 419-420

• Efficient Algorithms for Public-Private Social Networks
  • Flavio Chierichetti, Alessandro Epasto, Ravi Kumar, Silvio Lattanzi, Vahab Mirrokni
  • KDD (2015)

• On Learning Mixture Models for Permutations
  • Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi
  • ITCS (2015)

• Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models
  • Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni
  • EC (2015), pp. 169-186

• Online Stochastic Matching with Unequal Probabilities
  • Aranyak Mehta, Bo Waggoner, Morteza Zadimoghaddam
  • SODA, SIAM (2015), pp. 1388-1404

• Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order
  • Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
  • STOC (2015), pp. 889-898

• Optimal Coordination Mechanisms for Unrelated Machine Scheduling
  • Yossi Azar, Lisa Fleischer, Kamal Jain, Vahab S. Mirrokni, Zoya Svitkina
  • Operations Research, vol. 63 (2015), pp. 489-500

• Optimizing Display Advertising Markets: Challenges and Directions
  • Nitish Korula, Vahab Mirrokni, Hamid Nazerzadeh
  • IEEE Internet Computing (2015), pp. 28-35

• Randomized Composable Core-sets for Distributed Submodular Maximization
  • Vahab S. Mirrokni, Morteza Zadimoghaddam
  • CoRR, vol. abs/1506.06715 (2015)

• Randomized Composable Core-sets for Distributed Submodular Maximization
  • Vahab S. Mirrokni, Morteza Zadimoghaddam
  • STOC (2015), pp. 153-162

• Revenue Maximization for Selling Multiple Correlated Items
  • Mohammadhossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin
  • 23rd Annual European Symposium on Algorithms (ESA), Springer-Verlag (2015)

• Revenue Maximization with Nonexcludable Goods
  • Mohammadhossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam
  • Transactions on Economics and Computation (2015)

• Robust Hierarchical k-center clustering
  • Silvio Lattanzi, Stefano Leonardi, Vahab Mirrokni, Ilya Razenshteyn
  • ITCS (2015)

• Robust Price of Anarchy Bounds via LP and Fenchel Duality
  • Janardhan Kulkarni, Vahab S. Mirrokni
  • SODA (2015), pp. 1030-1049

• The Power of Random Neighbors in Social Networks
  • Silvio Lattanzi, Yaron Singer
  • WSDM (2015)

2014

• An efficient reconciliation algorithm for social networks
  • Nitish Korula, Silvio Lattanzi
  • PVLDB (2014), pp. 377-388

• Clinching auctions beyond hard budget constraints
  • Gagan Goel, Vahab Mirrokni, Renato Paes Leme
  • EC, ACM (2014)

• Composable core-sets for diversity and coverage maximization
  • Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni
  • PODS (2014), pp. 100-108

• Concise Bid Optimization Strategies with Multiple Budget Constraints
  • Arash Asadpour, Mohammadhossein Bateni, Kshipra Bhawalkar, Vahab Mirrokni
  • WINE, The 10th Conference on Web and Internet Economics (2014)

• Connected Components in MapReduce and Beyond
  • Raimondas Kiveris, Silvio Lattanzi, Vahab Mirrokni, Vibhor Rastogi, Sergei Vassilvitskii
  • SOCC 2014

• Coordination Mechanisms for Selfish Routing over Time on a Tree
  • Sayan Bhattacharya, Janardhan Kulkarni, Vahab S. Mirrokni
  • ICALP (1) (2014), pp. 186-197

• Distributed Balanced Clustering via Mapping Coresets
  • Mohammadhossein Bateni, Aditya Bhaskara, Silvio Lattanzi, Vahab Mirrokni
  • NIPS, Neural Information Processing Systems Foundation (2014)

• Filter & Follow: Do Social Media Encourage Efficient News Curation?
  • Nitish Korula, Augustin Chaintreau, Avner May, Silvio Lattanzi
  • SIGMETRICS 2014

• Learning Entangled Single-Sample Gaussians
  • Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi
  • Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014

• Multiplicative Bidding in Online Advertising
  • Mohammadhossein Bateni, Jon Feldman, Vahab Mirrokni, Sam Chiu-wai Wong
  • ACM Conference on Economics and Computation (EC) (2014)

• Network Cournot Competition
  • Melika Abolhasani, Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Hamid Mahini, Anshul Sawant
  • WINE, The 10th Conference on Web and Internet Economics (2014)

• Optimal revenue-sharing double auctions with applications to ad exchanges
  • Renato Gomes, Vahab S. Mirrokni
  • WWW (2014), pp. 19-28

• Partner tiering in display advertising
  • Anand Bhalgat, Nitish Korula, Hennadiy Leontyev, Max Lin, Vahab S. Mirrokni
  • WSDM (2014), pp. 133-142

• Price Competition in Online Combinatorial Markets
  • Moshe Babaioff, Renato Paes Leme, Noam Nisan
  • Proceedings of the 23st World Wide Web Conference 2014

• Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs
  • Alessandro Epasto, Jon Feldman, Silvio Lattanzi, Stefano Leonardi, Vahab Mirrokni
  • WWW (2014), pp. 349-360

• Secretary Problems and Online Auctions
  • Mohammadhossein Bateni
  • Encyclopedia of Algorithms, Springer (2014), pp. 1-4

• Truthful germs are contagious: a local-to-global characterization of truthfulness
  • Aaron Archer, Robert Kleinberg
  • Games and Economic Behavior, vol. 86 (2014), pp. 340-366

2013

• A Local Algorithm for Finding Well-Connected Clusters
  • Zeyuan Allen Zhu, Silvio Lattanzi, Vahab Mirrokni
  • The 30th International Conference on Machine Learning, ICML 2013

• Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
  • Mohammadhossein Bateni, Julia Chuzhoy
  • Algorithmica, vol. 65 (2013), pp. 545-561

• Arrival and departure in Social Networks
  • Shaomei Wu, Atish Das Sarma, Alex Fabrikant, Silvio Lattanzi, Andrew Tomkins
  • Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013

• Bicriteria Online Matching: Maximizing Weight and Cardinality
  • Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
  • WINE (2013), pp. 305-318

• Clinching Auction with Online Supply
  • Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme
  • SODA (2013), pp. 605-619

• Clinching Auctions with Online Supply
  • Gagan Goel, Vahab Mirrokni, Renato Paes Leme
  • SODA (2013), pp. 605-619

• Designing Markets for Daily Deals
  • Yang Cai, Mohammad Mahdian, Aranyak Mehta, Bo Waggoner
  • Conference on Web and Internet Economics (WINE) (2013)

• Diversity maximization under matroid constraints
  • Zeinab Abbassi, Vahab Mirrokni, Mayur Thakur
  • KDD, ACM SIGKDD (2013), pp. 32-40

• Equilibrium pricing with positive externalities
  • Nima AhmadiPourAnari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni
  • Theor. Comput. Sci., vol. 476 (2013), pp. 1-15

• Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems
  • Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat
  • ICALP, Springer (2013)

• PASS Approximation: A Framework for Analyzing and Designing Heuristics
  • Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh
  • Algorithmica, vol. 66 (2013), pp. 450-478

• Revenue Maximization with Nonexcludable Goods
  • Mohammadhossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam
  • Internet and Network Economics - 9th International Workshop, WINE 2013, Springer

• Submodular secretary problems with extensions
  • Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam
  • ACM Transactions on Algorithms, vol. 9 (4) (2013)

• Two-stage Robust Network Design with Exponential Scenarios
  • Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour
  • Algorithmica, vol. 65 (2013), pp. 391-408

• Whole-page optimization and submodular welfare maximization with online bidders
  • Nikhil Devanur, Zhiyi Huang, Nitish Korula, Vahab Mirrokni, Qiqi Yan
  • ACM Conference on Electronic Commerce (EC) 2013, pp. 305-322

2012

• A polynomial-time approximation scheme for planar multiway cut
  • Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Philip Klein, Claire Mathieu
  • Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2012)

• A Theoretical Examination of Practical Game Playing: Lookahead Search
  • Vahab S. Mirrokni, Nithum Thain, Adrian Vetta
  • SAGT (2012), pp. 251-262

• Ad auctions with data
  • Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii
  • INFOCOM Workshops (2012), pp. 184-189

• Budget Optimization for Online Campaigns with Positive Carryover Effects
  • Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishnan
  • WINE (2012), pp. 86-99

• Convergence and approximation in potential games
  • George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos
  • Theor. Comput. Sci., vol. 438 (2012), pp. 13-27

• How to approximate optimal auctions
  • Nima Haghpanah, Nicole Immorlica, Vahab S. Mirrokni, Kamesh Munagala
  • SIGecom Exchanges, vol. 11 (2012), pp. 30-33

• On Fixed-Price Marketing for Goods with Positive Network Externalities
  • Vahab S. Mirrokni, Sebastien Roch, Mukund Sundararajan
  • WINE (2012), pp. 532-538

• On the Implications of Lookahead Search in Game Playing
  • Vahab S. Mirrokni, Nithum Thain, Adrian Vetta
  • CoRR, vol. abs/1202.4134 (2012)

• On the Non-progressive Spread of Influence through Social Networks
  • MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabad, Vahab Mirrokni, Sina Sadeghian
  • LATIN (2012)

• On the advantage of overlapping clusters for minimizing conductance
  • Rohit Khandekar, Guy Kortsarz, Vahab Mirrokni
  • Proceedings of the 10th Latin American international conference on Theoretical Informatics, Springer-Verlag, Berlin, Heidelberg (2012), pp. 494-505

• Online allocation of display ads with smooth delivery
  • Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni
  • KDD (2012), pp. 1213-1221

• Overlapping clusters for distributed computation
  • Reid Andersen, David Gleich, Vahab Mirrokni
  • ACM Conference on Web Search and Data Mining (WSDM) (2012)

• PageRank on an evolving graph
  • Bahman Bahmani, Ravi Kumar, Mohammad Mahdian, Eli Upfal
  • KDD (2012), pp. 24-32

• Polyhedral clinching auctions and the adwords polytope
  • Gagan Goel, Vahab Mirrokni, Renato Paes Leme
  • STOC, ACM (2012), pp. 107-122

• Simultaneous Approximations for Adversarial and Stochastic Online Budgeted Allocation
  • Vahab Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam
  • Symposium on Discrete Algorithms (SODA), ACM/SIAM (2012)

• To match or not to match: economics of cookie matching in online advertising
  • Mohammad Mahdian, Arpita Ghosh, Preston McAfee, Sergei Vassilvitskii
  • Proceedings of the 13th ACM Conference on Electronic Commerce, ACM, New York, NY, USA (2012), pp. 741-753

2011

• Evolutionary Models and Cyber-replicas of Large Small Worlds
  • Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar
  • WIN2011

• Filtering: a method for solving graph problems in MapReduce
  • Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii
  • SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 85-94

• Hiring a secretary from a poset
  • Ravi Kumar, Silvio Lattanzi, Sergei Vassilvitskii, Andrea Vattani
  • Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), pp. 39-48

• Inner Product Spaces for MinSum Coordination Mechanisms
  • Richard Cole, Jose R. Correa, Vasilis Gkatzelis, Vahab Mirrokni, Neil Olver
  • STOC (2011)

• Large-scale community detection on YouTube for Topic Discovery and Exploration
  • Ullas Gargi, Wenjun Lu, Vahab Mirrokni, Sangho Yoon
  • AAAI Conference on Weblogs and Social Media 2011

• Milgram-routing in social networks.
  • Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar
  • Proceedings of the 20th International Conference on World Wide Web, WWW 2011, pp. 725-734

• Online Stochastic Weighted Matching: Improved Approximation Algorithms
  • Bernard Haeupler, Vahab Mirrokni, Morteza Zadimoghaddam
  • Workshop of Network and Internet Economics (WINE) 2011

• Optimal Auctions with Positive Network Externalities
  • Nima Haghpanah, Nicole Immorlica, Vahab Mirrokni, K. Munagala
  • ACM Conference on Electronic Commerce (2011)

• Yield Optimization of Display Advertising with Ad Exchange
  • Santiago Balseiro, Jon Feldman, Vahab Mirrokni, S. Muthukrishnan
  • ACM Conference on Electronic Commerce (2011)

2010

• Auctions with intermediaries: extended abstract
  • Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan, Mallesh M. Pai
  • ACM Conference on Electronic Commerce (2010), pp. 23-32

• Equilibrium Pricing with Positive Externalities (Extended Abstract)
  • Nima Anari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab Mirrokni
  • WINE (2010), pp. 424-431

• Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
  • Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
  • SIAM J. Discrete Math., vol. 23 (2010), pp. 2053-2078

• Mining advertiser-specific user behavior using adfactors
  • Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishnan
  • WWW (2010), pp. 31-40

• Online Stochastic Packing Applied to Display Ad Allocation
  • Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein
  • ESA (1) (2010), pp. 182-194

• Optimal Iterative Pricing over Social Networks (Extended Abstract)
  • Hessameddin Akhlaghpour, Mohammad Ghodsi, Nima Haghpanah, Vahab Mirrokni, Hamid Mahini, Afshin Nikzad
  • WINE (2010), pp. 415-423

• Optimal marketing and pricing over social networks
  • Nicole Immorlica, Vahab S. Mirrokni
  • WWW (2010), pp. 1349-1350

• Quasi-Proportional Mechanisms: Prior-free Revenue Maximization
  • Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav
  • Latin (2010)

2009

• Affiliation Networks
  • Silvio Lattanzi, D. Sivakumar
  • Proceedings of the 41st Annual ACM Symposium on Theory of Computing, ACM (2009), pp. 427-434

• Algorithms for Secretary Problems on Graphs and Hypergraphs
  • Nitish Korula, Martin Pál
  • ICALP 2009

• An Online Mechanism for Ad Slot Reservations with Cancellations
  • Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pal
  • Fourth Workshop on Ad Auctions; Symposium on Discrete Algorithms (SODA) (2009)

• Approximating Submodular Functions Everywhere
  • Michel Goemans, Nick Harvey, S. Iwata, Vahab Mirrokni
  • Symposium on Discrete Algorithms (SODA) (2009)

• Bid optimization for broad match ad auctions
  • Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan, Yishay Mansour, Uri Nadav
  • WWW (2009), pp. 231-240

• Competitive Routing over Time
  • Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng
  • Workshop of Internet Economics (WINE) (2009), pp. 18-29

• Coordination mechanisms for selfish scheduling
  • Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz
  • Theor. Comput. Sci., vol. 410 (2009), pp. 1589-1598

• Non-monotone submodular maximization under matroid and knapsack
  • Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
  • STOC (2009), pp. 323-332

• On the complexity of nash dynamics and sink equilibria
  • Vahab S. Mirrokni, Alexander Skopalik
  • ACM Conference on Electronic Commerce (2009), pp. 1-10

• Online Ad Assignment with Free Disposal
  • Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál
  • Workshop of Internet Economics (WINE) (2009), pp. 374-385

• Online Stochastic Matching: Beating 1-1/e
  • Jon Feldman, Aranyak Mehta, Vahab Mirrokni, S. Muthukrishnan
  • Symposium on the Foundations of Computer Science (FOCS) (2009)

• PASS Approximation
  • Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh
  • APPROX-RANDOM (2009), pp. 111-124

• Tutorial summary: Convergence of natural dynamics to equilibria
  • Eyal Even-Dar, Vahab S. Mirrokni
  • ICML (2009), pp. 173

2008

• A Truthful Mechanism for Offline Ad Slot Scheduling
  • Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal
  • Symposium on Algorithmic Game Theory (2008)

• Algorithmic Methods for Sponsored Search Advertising
  • Jon Feldman, S. Muthukrishnan
  • Performance Modeling and Engineering (Proc. SIGMETRICS 2008 Tutorial Sessions), Springer, pp. 91-124

• On Distributing Symmetric Streaming Computations
  • Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Cliff Stein, Zoya Svitkina
  • Proc. 19th Annual Symposium on Discrete Algorithms (SODA) (2008)

• Position Auctions with Bidder-Specific Minimum Prices
  • Eyal Even-Dar, Jon Feldman, Yishay Mansour, S. Muthukrishnan
  • Fourth Workshop on Ad Auctions; Workshop on Internet and Network Economics (WINE) (2008)

• Sponsored Search Auctions for Markovian Users
  • Gagan Aggarwal, Jon Feldman, Martin Pal, S. Muthukrishnan
  • Fourth Workshop on Ad Auctions; Workshop on Internet and Network Economics (WINE). (2008)

• Theory research at Google
  • Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika R. Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos
  • SIGACT News, vol. 39 (2008), pp. 10-28

• Permutation betting markets: singleton betting with extra information
  • Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam
  • ACM Conference on Electronic Commerce (2008), pp. 180-189

• Two-Stage Robust Network Design with Exponential Scenarios
  • Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour
  • ESA (2008), pp. 589-600

2007

• Budget Optimization in Search-Based Advertising Auctions
  • Jon Feldman, S. Muthukrishnan, Martin Pál, Cliff Stein
  • Proc. ACM Conference on Electronic Commerce, ACM, San Diego (2007)

2006

• Bidding to the Top: VCG and Equilibria of Position-Based Auctions
  • Gagan Aggarwal, Jon Feldman, S. Muthukrishnan
  • Proceedings of the Fourth Workshop on Approximation and Online Algorithms (WAOA) (2006)

• Growth Codes: Maximizing Sensor Network Data Persistence
  • Abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rubenstein
  • Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, ACM, Pisa, Italy, pp. 255-266

• PAC Learning Mixtures of Gaussians with No Separation Assumption
  • Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
  • Proc. 19th Annual Conference on Learning Theory (COLT) (2006)

• Using Many Machines to Handle an Enormous Error-Correcting Code
  • Jon Feldman
  • Proc. IEEE Information Theory Workshop (ITW) (2006)