| On bitcoin and red balloons M Babaioff, S Dobzinski, S Oren, A Zohar Proceedings of the 13th ACM conference on electronic commerce, 56-73, 2012 | 395 | 2012 |
| Approximation algorithms for combinatorial auctions with complement-free bidders S Dobzinski, N Nisan, M Schapira Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 327 | 2005 |
| Multi-unit auctions with budget limits S Dobzinski, R Lavi, N Nisan Games and Economic Behavior 74 (2), 486-503, 2012 | 277 | 2012 |
| An improved approximation algorithm for combinatorial auctions with submodular bidders S Dobzinski, M Schapira Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 223 | 2006 |
| Truthful randomized mechanisms for combinatorial auctions S Dobzinski, N Nisan, M Schapira Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 177 | 2006 |
| On the power of randomization in algorithmic mechanism design S Dobzinski, S Dughmi SIAM Journal on Computing 42 (6), 2287-2304, 2013 | 127 | 2013 |
| Mechanisms for multi-unit auctions S Dobzinski, N Nisan Proceedings of the 8th ACM conference on Electronic commerce, 346-351, 2007 | 126 | 2007 |
| Two randomized mechanisms for combinatorial auctions S Dobzinski International Workshop on Approximation Algorithms for Combinatorial …, 2007 | 123 | 2007 |
| An impossibility result for truthful combinatorial auctions with submodular valuations S Dobzinski Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 103 | 2011 |
| Sketching valuation functions A Badanidiyuru, S Dobzinski, H Fu, R Kleinberg, N Nisan, T Roughgarden Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 91 | 2012 |
| An optimal lower bound for anonymous scheduling mechanisms I Ashlagi, S Dobzinski, R Lavi Proceedings of the 10th ACM conference on Electronic commerce, 169-176, 2009 | 83 | 2009 |
| Truthful approximation schemes for single-parameter agents P Dhangwatnotai, S Dobzinski, S Dughmi, T Roughgarden SIAM Journal on Computing 40 (3), 915-933, 2011 | 82 | 2011 |
| Optimal auctions with correlated bidders are easy S Dobzinski, H Fu, RD Kleinberg Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 81 | 2011 |
| Limitations of vcg-based mechanisms S Dobzinski, N Nisan Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 78 | 2007 |
| Efficiency guarantees in auctions with budgets S Dobzinski, RP Leme International Colloquium on Automata, Languages, and Programming, 392-404, 2014 | 77 | 2014 |
| Economic efficiency requires interaction S Dobzinski, N Nisan, S Oren Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 72 | 2014 |
| The computational complexity of truthfulness in combinatorial auctions S Dobzinski, J Vondrák Proceedings of the 13th ACM Conference on Electronic Commerce, 405-422, 2012 | 72 | 2012 |
| On characterizations of truthful mechanisms for combinatorial auctions and scheduling S Dobzinski, M Sundararajan Proceedings of the 9th ACM conference on Electronic commerce, 38-47, 2008 | 66 | 2008 |
| Mechanisms for complement-free procurement S Dobzinski, CH Papadimitriou, Y Singer Proceedings of the 12th ACM conference on Electronic commerce, 273-282, 2011 | 61 | 2011 |
| From query complexity to computational complexity S Dobzinski, J Vondrák Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 59 | 2012 |
