Papers

Robust Optimization for Non-Convex Objectives
with Robert Chen, Brendan Lucier, and Vasilis Syrgkanis
Annual Conference on Neural Information Processing Systems (NIPS) 2017
Oral presentation

Minimizing a Submodular Function from Samples
with Eric Balkanski
Annual Conference on Neural Information Processing Systems (NIPS) 2017

The Importance of Communities for Influence Maximization
with Eric Balkanski and Nicole Immorlica
Annual Conference on Neural Information Processing Systems (NIPS) 2017

Robust Guarantees of Stochastic Greedy Algorithms
with Avinatan Hassidim
International Conference of Machine Learning (ICML) 2017

Submodular Optimization under Noise
with Avinatan Hassidim
Conference on Learning Theory (COLT) 2017

The Sample Complexity of Optimizing a Convex Function
with Eric Balkanski
Conference on Learning Theory (COLT) 2017

The Limitations of Optimization from Samples
with Eric Balkanski and Aviad Rubinstein
ACM Symposium on the Theory of Computation (STOC) 2017

The Power of Optimization from Samples
with Eric Balkanski and Aviad Rubinstein
Annual Conference on Neural Information Processing Systems (NIPS) 2016

Maximizing Approximately Submodular Functions
with Thibaut Horel
Annual Conference on Neural Information Processing Systems (NIPS) 2016

Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization
with Eric Balkanski, Andreas Krause, and Baharan Mirzasoleiman
International Conference of Machine Learning (ICML) 2016

Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
with Ashwinkumar Badanidiyuru, Christos Papadimitriou, Aviad Rubinstein, and Lior Seeman
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016

Information-theoretic Lower Bounds for Convex Optimization with Erroneous Oracles
with Jan Vondrak
Annual Conference on Neural Information Processing Systems (NIPS) 2015
Spotlight presentation

Learnability of Influence in Networks
with Harikrishna Narasimhan and David Parkes
Annual Conference on Neural Information Processing Systems (NIPS) 2015

Influence at Scale: Distributed Computation of Contagion in Networks
with Brendan Lucier and Joel Oren
The ACM Conference on Knowledge Discovery and Data Mining (KDD) 2015

Mechanisms for Fair Attribution
with Eric Balkanski
The ACM Conference on Economics and Computation (EC) 2015

Approximability of Adaptive Seeding under Knapsack Constraints
with Lior Seeman and Aviad Rubinstein
The ACM Conference on Economics and Computation (EC) 2015

Scalable Methods for Adaptively Seeding a Social Network
with Thibaut Horel
The International World Wide Web Conference (WWW) 2015

The Power of Random Neighbors in Social Networks
with Silvio Lattanzi
The ACM Conference on Web Search and Data Mining (WSDM) 2015

Adaptive Seeding in Social Networks
with Lior Seeman
Symposium on Foundations of Computer Science (FOCS) 2013

Pricing Mechanisms in Crowdsourcing Markets
with Manas Mittal
The International World Wide Web Conference (WWW) 2013
A preliminary version appeared in HCOMP 2011


Equilibrium in Combinatorial Public Projects
with Brendan Lucier, Eva Tardos, and Vasilis Syrgkanis
The Conference on Web and Internet Economics (WINE) 2013

How to Win Friends and Influence People, Truthfully: Influence Maximization Mechanisms for Social Networks
Yaron Singer
The ACM Conference on Web Search and Data Mining (WSDM) 2012
Best Student Paper Award

Learning on a Budget: Posted Price Mechanisms for Online Procurement
with Ashwinkumar Badanidiyuru and Robert Kleinberg
The ACM Conference on Electronic Commerce (EC) 2012

Complexity of Efficiency-Revenue Trade-offs in Bayesian Auctions
with Ilias Diakonikolas, Christos Papadimitriou and George Pierrakos
The Intl. Colloquium on Automata, Languages and Programming (ICALP) 2012

Mechanisms for Complement Free Procurement
with Shahar Dobzinski and Christos Papadimitriou
The ACM Conference on Electronic Commerce (EC) 2011

Posting Prices with Unknown Distributions
with Moshe Babaioff, Liad Blumrosen and Shaddin Dughmi
Symposium on Innovations in Computer Science (ICS) 2011

Budget Feasible Mechanisms
Yaron Singer
Symposium on Foundations of Computer Science (FOCS) 2010

Computation and Incentives in Combinatorial Public Projects
with Dave Buchfuhrer and Michael Schapira
The ACM Conference on Electronic Commerce (EC) 2010

Path Trading Between Autonomous Systems
with Yuval Shavitt
The IEEE Conference on Computer Communications (INFOCOM) 2010
A preliminary version appeared in NetEcon 2008


VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension
with Elchanan Mossel, Christos Papadimitriou and Michael Schapira
See merged version in:
Inapproximability for VCG-Based Combinatorial Auctions
Buchfuhrer et. al
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2010


Inapproximability of Combinatorial Public Projects
with Michael Schapira
Workshop on Internet and Network Economics (WINE) 2008

On the Hardness of Being Truthful
with Christos Papadimitriou and Michael Schapira
Symposium on Foundations of Computer Science (FOCS) 2008

Beyond Centrality: Classifying Topological Significance using Backup Efficiency and Alternative Paths
with Yuval Shavitt
New Journal of Physics (focus issue: Complex Networked Systems: Theory and Applications) August 2007

PROMO: A Method for Identifying Modules in Protein Interaction Networks
with Omer Tamuz and Roded Sharan
European Conference on Computational Biology (ECCB) 2006
Selected to be presented at the "Late-Breaking Results" session

Book Chapters

Network Visualization with Parallel Coordinates
with Ohad Greenshpan.
VISUAL Multidimensional Geometry and its Applications" by Alfred Inselberg.
Springer-Verlag, New York, 2008.