Pricing mechanisms for crowdsourcing markets Y Singer, M Mittal Proceedings of the 22nd international conference on World Wide Web, 1157-1166, 2013 | 244 | 2013 |

Budget feasible mechanisms Y Singer 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 765-774, 2010 | 240 | 2010 |

On the hardness of being truthful C Papadimitriou, M Schapira, Y Singer 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 250-259, 2008 | 149 | 2008 |

How to win friends and influence people, truthfully: influence maximization mechanisms for social networks Y Singer Proceedings of the fifth ACM international conference on Web search and data …, 2012 | 130 | 2012 |

Learning on a budget: posted price mechanisms for online procurement A Badanidiyuru, R Kleinberg, Y Singer Proceedings of the 13th ACM conference on electronic commerce, 128-145, 2012 | 121 | 2012 |

Adaptive seeding in social networks L Seeman, Y Singer 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 459-468, 2013 | 114 | 2013 |

Maximization of Approximately Submodular Functions. T Horel, Y Singer NIPS 16, 3045-3053, 2016 | 76 | 2016 |

Robust optimization for non-convex objectives R Chen, B Lucier, Y Singer, V Syrgkanis arXiv preprint arXiv:1707.01047, 2017 | 68 | 2017 |

Inapproximability for vcg-based combinatorial auctions D Buchfuhrer, S Dughmi, H Fu, R Kleinberg, E Mossel, C Papadimitriou, ... Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010 | 67 | 2010 |

Influence at scale: Distributed computation of complex contagion in networks B Lucier, J Oren, Y Singer Proceedings of the 21th ACM SIGKDD International Conference on Knowledge …, 2015 | 55 | 2015 |

Submodular optimization under noise A Hassidim, Y Singer Conference on Learning Theory, 1069-1122, 2017 | 54 | 2017 |

The adaptive complexity of maximizing a submodular function E Balkanski, Y Singer Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 51 | 2018 |

Mechanisms for complement-free procurement S Dobzinski, CH Papadimitriou, Y Singer Proceedings of the 12th ACM conference on Electronic commerce, 273-282, 2011 | 51 | 2011 |

An exponential speedup in parallel running time for submodular maximization without loss in approximation E Balkanski, A Rubinstein, Y Singer Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 48 | 2019 |

Scalable methods for adaptively seeding a social network T Horel, Y Singer Proceedings of the 24th International Conference on World Wide Web, 441-451, 2015 | 47 | 2015 |

Learnability of influence in networks H Narasimhan, DC Parkes, Y Singer Proceedings of the 29th Annual Conference on Neural Information Processing …, 2015 | 47 | 2015 |

The limitations of optimization from samples E Balkanski, A Rubinstein, Y Singer Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 43 | 2017 |

Posting prices with unknown distributions M Babaioff, L Blumrosen, S Dughmi, Y Singer In ICS, 2011 | 42 | 2011 |

Pricing tasks in online labor markets Y Singer, M Mittal Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011 | 41 | 2011 |

Locally adaptive optimization: Adaptive seeding for monotone submodular functions A Badanidiyuru, C Papadimitriou, A Rubinstein, L Seeman, Y Singer Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 40 | 2016 |