| Budget feasible mechanisms Y Singer 2010 IEEE 51st Annual Symposium on foundations of computer science, 765-774, 2010 | 322 | 2010 |
| Pricing mechanisms for crowdsourcing markets Y Singer, M Mittal Proceedings of the 22nd international conference on World Wide Web, 1157-1166, 2013 | 308 | 2013 |
| 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 | 174 | 2008 |
| 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 | 154 | 2012 |
| 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 | 151 | 2012 |
| Adaptive seeding in social networks L Seeman, Y Singer 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 459-468, 2013 | 141 | 2013 |
| Robust optimization for non-convex objectives RS Chen, B Lucier, Y Singer, V Syrgkanis Advances in Neural Information Processing Systems 30, 2017 | 131 | 2017 |
| Maximization of approximately submodular functions T Horel, Y Singer Advances in neural information processing systems 29, 2016 | 131 | 2016 |
| 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 | 122 | 2018 |
| 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 | 100 | 2019 |
| Submodular optimization under noise A Hassidim, Y Singer Conference on Learning Theory, 1069-1122, 2017 | 77 | 2017 |
| Learnability of influence in networks H Narasimhan, DC Parkes, Y Singer Advances in Neural Information Processing Systems 28, 2015 | 77 | 2015 |
| 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 | 77 | 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 | 72 | 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 | 65 | 2017 |
| Mechanisms for complement-free procurement S Dobzinski, CH Papadimitriou, Y Singer Proceedings of the 12th ACM conference on Electronic commerce, 273-282, 2011 | 58 | 2011 |
| Non-monotone submodular maximization in exponentially fewer iterations E Balkanski, A Breuer, Y Singer Advances in Neural Information Processing Systems 31, 2018 | 56 | 2018 |
| 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 | 56 | 2015 |
| Pricing tasks in online labor markets Y Singer, M Mittal Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011 | 51 | 2011 |
| The power of optimization from samples E Balkanski, A Rubinstein, Y Singer Advances in Neural Information Processing Systems 29, 2016 | 50 | 2016 |
