Vahab S. Mirrokni

Soheil Behnezhad

Mahsa Derakhshan

MohammadTaghi Hajiaghayi

Raimondas Kiveris

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

Dynamic Revenue Sharing.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

Scalable Feature Selection via Distributed Diversity Maximization.

[BibT_eX]

[DOI]

Sepehr Abbasi Zadeh

Mehrdad Ghadiri

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

A Study of Compact Reserve Pricing Languages.

[BibT_eX]

[DOI]

Saeed Seddighin

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Market Games and Content Distribution.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

Optimizing Display Advertising Markets: Challenges and Directions.

[BibT_eX]

[DOI]

Hamid Nazerzadeh

IEEE Internet Comput., 2016

GeoCUTS: Geographic Clustering Using Travel Statistics.

[BibT_eX]

[DOI]

CoRR, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Distributed Coverage Maximization via Sketching.

[BibT_eX]

[DOI]

CoRR, 2016

Expanders via Local Edge Flips.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Bi-Objective Online Matching and Submodular Allocations.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Dynamic Auctions with Bank Accounts.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Greedy Column Subset Selection: New Bounds and Distributed Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 33nd International Conference on Machine Learning, 2016

Reservation Exchange Markets for Internet Advertising.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Dynamic Coordination Mechanisms: [Extended Abstract].

[BibT_eX]

[DOI]

Janardhan Kulkarni

SIGMETRICS Perform. Evaluation Rev., 2015

Ego-net Community Mining Applied to Friend Suggestion.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Polyhedral Clinching Auctions and the AdWords Polytope.

[BibT_eX]

[DOI]

Gagan Goel

Renato Paes Leme

J. ACM, 2015

Optimal Coordination Mechanisms for Unrelated Machine Scheduling.

[BibT_eX]

[DOI]

Oper. Res., 2015

Decentralized utilitarian mechanisms for scheduling games.

[BibT_eX]

[DOI]

Games Econ. Behav., 2015

Distributed Graph Algorithmics: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

Randomized Composable Core-sets for Distributed Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Robust Price of Anarchy Bounds via LP and Fenchel Duality.

[BibT_eX]

[DOI]

Janardhan Kulkarni

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Efficient Algorithms for Public-Private Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Robust Hierarchical k-Center Clustering.

[BibT_eX]

[DOI]

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Automated Decomposition of Build Targets.

[BibT_eX]

[DOI]

Mohsen Vakilian

Raluca Sauciuc

J. David Morgenthaler

Proceedings of the 37th IEEE/ACM International Conference on Software Engineering, 2015

2014

On non-progressive spread of influence through social networks.

[BibT_eX]

[DOI]

MohammadAmin Fazli

Mohammad Ghodsi

Jafar Habibi

Pooya Jalaly Khalilabadi

Sina Sadeghian Sadeghabad

Theor. Comput. Sci., 2014

Yield Optimization of Display Advertising with Ad Exchange.

[BibT_eX]

[DOI]

Manag. Sci., 2014

On the Advantage of Overlapping Clusters for Minimizing Conductance.

[BibT_eX]

[DOI]

Rohit Khandekar

Guy Kortsarz

Algorithmica, 2014

Optimal revenue-sharing double auctions with applications to ad exchanges.

[BibT_eX]

[DOI]

Renato Gomes

Proceedings of the 23rd International World Wide Web Conference, 2014

Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs.

[BibT_eX]

[DOI]

Proceedings of the 23rd International World Wide Web Conference, 2014

Partner tiering in display advertising.

[BibT_eX]

[DOI]

Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014

Clinching auctions beyond hard budget constraints.

[BibT_eX]

[DOI]

Gagan Goel

Renato Paes Leme

Proceedings of the ACM Conference on Economics and Computation, 2014

Multiplicative bidding in online advertising.

[BibT_eX]

[DOI]

Jon Feldman

Sam Chiu-wai Wong

Proceedings of the ACM Conference on Economics and Computation, 2014

Composable core-sets for diversity and coverage maximization.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Distributed Balanced Clustering via Mapping Coresets.

[BibT_eX]

[DOI]

Aditya Bhaskara

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.

[BibT_eX]

[DOI]

Sayan Bhattacharya

Janardhan Kulkarni

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Connected Components in MapReduce and Beyond.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Cloud Computing, 2014

2013

Optimal Auctions with Positive Network Externalities.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2013

Equilibrium pricing with positive externalities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Two-stage Robust Network Design with Exponential Scenarios.

[BibT_eX]

[DOI]

Rohit Khandekar

Guy Kortsarz

Mohammad R. Salavatipour

Algorithmica, 2013

PASS Approximation: A Framework for Analyzing and Designing Heuristics.

[BibT_eX]

[DOI]

Algorithmica, 2013

Bicriteria Online Matching: Maximizing Weight and Cardinality.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Clinching Auction with Online Supply.

[BibT_eX]

[DOI]

Gagan Goel

Renato Paes Leme

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Diversity maximization under matroid constraints.

[BibT_eX]

[DOI]

Zeinab Abbassi

Mayur Thakur

Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

A Local Algorithm for Finding Well-Connected Clusters.

[BibT_eX]

[DOI]

Zeyuan Allen Zhu

Proceedings of the 30th International Conference on Machine Learning, 2013

2012

Convergence and approximation in potential games.

[BibT_eX]

[DOI]

George Christodoulou

Anastasios Sidiropoulos

Theor. Comput. Sci., 2012

How to approximate optimal auctions.

[BibT_eX]

[DOI]

SIGecom Exch., 2012

On the Implications of Lookahead Search in Game Playing

[BibT_eX]

[DOI]

Nithum Thain

CoRR, 2012

Overlapping clusters for distributed computation.

[BibT_eX]

[DOI]

Reid Andersen

David F. Gleich

Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

On Fixed-Price Marketing for Goods with Positive Network Externalities.

[BibT_eX]

[DOI]

Sebastien Roch

Mukund Sundararajan

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Budget Optimization for Online Campaigns with Positive Carryover Effects.

[BibT_eX]

[DOI]

Nikolay Archak

S. Muthukrishnan

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Simultaneous approximations for adversarial and stochastic online budgeted allocation.

[BibT_eX]

[DOI]

Shayan Oveis Gharan

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

A Theoretical Examination of Practical Game Playing: Lookahead Search.

[BibT_eX]

[DOI]

Nithum Thain

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Online allocation of display ads with smooth delivery.

[BibT_eX]

[DOI]

Anand Bhalgat

Jon Feldman

Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

2011

Competitive routing over time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Maximizing Non-monotone Submodular Functions.

[BibT_eX]

[DOI]

Uriel Feige

Jan Vondrák

SIAM J. Comput., 2011

Uncoordinated Two-Sided Matching Markets.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Tight Approximation Algorithms for Maximum Separable Assignment Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 2011

Approximating Minimum-Power Degree and Connectivity Problems.

[BibT_eX]

[DOI]

Algorithmica, 2011

Permutation Betting Markets: Singleton Betting with Extra Information.

[BibT_eX]

[DOI]

Mohammad Ghodsi

Hamid Mahini

Algorithmica, 2011

Online Stochastic Weighted Matching: Improved Approximation Algorithms.

[BibT_eX]

[DOI]

Bernhard Haeupler

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Inner product spaces for MinSum coordination mechanisms.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Large-Scale Community Detection on YouTube for Topic Discovery and Exploration.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Weblogs and Social Media, 2011

2010

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

On spectrum sharing games.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Joseph Y. Halpern

Li Erran Li

Distributed Comput., 2010

Coordination Mechanisms for Weighted Sum of Completion Times in Machine Scheduling

[BibT_eX]

[DOI]

Richard Cole

Vasilis Gkatzelis

CoRR, 2010

Online Stochastic Ad Allocation: Efficiency and Fairness

[BibT_eX]

[DOI]

CoRR, 2010

Secure Overlay Network Design.

[BibT_eX]

[DOI]

Li (Erran) Li

Algorithmica, 2010

Optimal marketing and pricing over social networks.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on World Wide Web, 2010

Mining advertiser-specific user behavior using adfactors.

[BibT_eX]

[DOI]

Nikolay Archak

S. Muthukrishnan

Proceedings of the 19th International Conference on World Wide Web, 2010

Equilibrium Pricing with Positive Externalities (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Optimal Iterative Pricing over Social Networks (Extended Abstract).

[BibT_eX]

[DOI]

Hessameddin Akhlaghpour

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Auctions with intermediaries: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization.

[BibT_eX]

[DOI]

S. Muthukrishnan

Uri Nadav

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Online Stochastic Packing Applied to Display Ad Allocation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Coordination mechanisms for selfish scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Bid optimization for broad match ad auctions.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on World Wide Web, 2009

Online Ad Assignment with Free Disposal.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Non-monotone submodular maximization under matroid and knapsack constraints.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Approximating submodular functions everywhere.

[BibT_eX]

[DOI]

Michel X. Goemans

Nicholas J. A. Harvey

Satoru Iwata

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

On the complexity of nash dynamics and sink equilibria.

[BibT_eX]

[DOI]

Alexander Skopalik

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Tutorial summary: Convergence of natural dynamics to equilibria.

[BibT_eX]

[DOI]

Eyal Even-Dar

Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Online Stochastic Matching: Beating 1-1/e.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

PASS Approximation.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2009

2008

Market Games and Content Distribution.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Limitations of cross-monotonic cost-sharing schemes.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Local Computation of PageRank Contributions.

[BibT_eX]

[DOI]

Internet Math., 2008

A Unified Approach to Congestion Games and Two-Sided Markets.

[BibT_eX]

[DOI]

Internet Math., 2008

Optimal marketing strategies over social networks.

[BibT_eX]

[DOI]

Jason D. Hartline

Mukund Sundararajan

Proceedings of the 17th International Conference on World Wide Web, 2008

A combinatorial allocation mechanism with penalties for banner advertising.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on World Wide Web, 2008

Trust-based recommendation systems: an axiomatic approach.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on World Wide Web, 2008

(Almost) optimal coordination mechanisms for unrelated machine scheduling.

[BibT_eX]

[DOI]

Yossi Azar

Kamal Jain

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions.

[BibT_eX]

[DOI]

Michael Schapira

Jan Vondrák

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Fast convergence to nearly optimal solutions in potential games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

On the Stability of Web Crawling and Web Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Robust PageRank and locally computable spam detection features.

[BibT_eX]

[DOI]

Proceedings of the AIRWeb 2008, 2008

2007

Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2007

Cell Breathing in Wireless LANs: Algorithms and Evaluation.

[BibT_eX]

[DOI]

Paramvir Bahl

IEEE Trans. Mob. Comput., 2007

Subjective-cost policy routing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Power optimization for connectivity problems.

[BibT_eX]

[DOI]

Guy Kortsarz

Christos H. Papadimitriou

Zeev Nutov

Math. Program., 2007

The Myth of the Folk Theorem.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2007

A Recommender System Based on Local Random Walks and Spectral Methods.

[BibT_eX]

[DOI]

Zeinab Abbassi

Proceedings of the Advances in Web Mining and Web Usage Analysis, 2007

Robust Combinatorial Optimization with Exponential Scenarios.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

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

[BibT_eX]

[DOI]

Mohsen Bahramgiri

Wirel. Networks, 2006

Market sharing games applied to content distribution in ad hoc networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2006

A relation between choosability and uniquely list colorability.

[BibT_eX]

[DOI]

Saieed Akbari

Bashir S. Sadjad

J. Comb. Theory B, 2006

Assignment Problems in Rental Markets.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Tight approximation algorithms for maximum general assignment problems.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Bandwidth Sharing Network Design for Multi-Class Traffic.

[BibT_eX]

[DOI]

Li (Erran) Li

Marina Thottan

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2005

Cycle Cover with Short Cycles.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Sink Equilibria and Convergence.

[BibT_eX]

[DOI]

Michel X. Goemans

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Distributed Network Monitoring for Evolving IP Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), 2004

Locality-sensitive hashing scheme based on p-stable distributions.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Convergence Issues in Competitive Games.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2004

2003

The facility location problem with general cost functions.

[BibT_eX]

[DOI]

Networks, 2003

2002

Length-constrained path-matchings in graphs.

[BibT_eX]

[DOI]

Mohammad Ghodsi

Networks, 2002

RoboCup-2001: The Fifth Robotic Soccer World Championships.

[BibT_eX]

[DOI]

Ehsan Chiniforooshan

AI Mag., 2002

2001

Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges.

[BibT_eX]

[DOI]

Saeed Akbari

Seyed Vahab Mirrokni

Sayyed Bashir Sadjad

J. Comb. Theory B, 2001

A Fast Vision System for Middle Size Robots in RoboCup.

[BibT_eX]

[DOI]

Ehsan Chiniforooshan

Proceedings of the RoboCup 2001: Robot Soccer World Cup V, 2001

Basic Requirements for a Teamwork in Middle Size RoboCup.

[BibT_eX]

[DOI]

Mansour Jamzad

Hamid Reza Chitsaz

Amirali Foroughnassiraei

Proceedings of the RoboCup 2001: Robot Soccer World Cup V, 2001

2000

On the simultaneous edge-coloring conjecture.

[BibT_eX]

[DOI]

Ebadollah S. Mahmoodian

Seyed Vahab Mirrokni

Amin Saberi

Ruzbeh Tusserkani

Discret. Math., 2000

A Goal Keeper for Middle Size RoboCup.

[BibT_eX]

[DOI]

Mansour Jamzad

Amirali Foroughnassiraei