| Axiomatic attribution for deep networks M Sundararajan, A Taly, Q Yan International conference on machine learning, 3319-3328, 2017 | 7434 | 2017 |
| Revenue maximization with a single sample P Dhangwatnotai, T Roughgarden, Q Yan Proceedings of the 11th ACM conference on Electronic commerce, 129-138, 2010 | 347 | 2010 |
| Online bipartite matching with random arrivals: an approach based on strongly factor-revealing lps M Mahdian, Q Yan Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 318 | 2011 |
| Mechanism design via correlation gap Q Yan Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 173 | 2011 |
| How important is a neuron? K Dhamdhere, M Sundararajan, Q Yan arXiv preprint arXiv:1805.12233, 2018 | 169 | 2018 |
| Gradients of counterfactuals M Sundararajan, A Taly, Q Yan arXiv preprint arXiv:1611.02639, 2016 | 143 | 2016 |
| Analyza: Exploring data with conversation K Dhamdhere, KS McCurley, R Nahmias, M Sundararajan, Q Yan Proceedings of the 22nd International Conference on Intelligent User …, 2017 | 115 | 2017 |
| Lower bounds for complementation of ω-automata via the full automata technique Q Yan Automata, Languages and Programming, 589-600, 2006 | 104 | 2006 |
| From convex optimization to randomized mechanisms: toward optimal combinatorial auctions S Dughmi, T Roughgarden, Q Yan Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 86 | 2011 |
| Whole-page optimization and submodular welfare maximization with online bidders NR Devanur, Z Huang, N Korula, VS Mirrokni, Q Yan ACM Transactions on Economics and Computation (TEAC) 4 (3), 1-20, 2016 | 66 | 2016 |
| Envy, truth, and profit J Hartline, Q Yan Proceedings of the 12th ACM conference on Electronic commerce, 243-252, 2011 | 65 | 2011 |
| Supply-limiting mechanisms T Roughgarden, I Talgam-Cohen, Q Yan Proceedings of the 13th ACM conference on electronic commerce, 844-861, 2012 | 58 | 2012 |
| Axiomatic attribution for deep networks (2017) M Sundararajan, A Taly, Q Yan arXiv preprint arXiv:1703.01365, 0 | 50 | |
| Envy freedom and prior-free mechanism design NR Devanur, JD Hartline, Q Yan Journal of Economic Theory 156, 103-143, 2015 | 43 | 2015 |
| Techniques for utilizing a natural language interface to perform data analysis and retrieval K McCurley, Q Yan, K Dirckx, K Dhamdhere, RR Nahmias, ... US Patent App. 15/134,010, 2017 | 31 | 2017 |
| Robust auctions for revenue via enhanced competition T Roughgarden, I Talgam-Cohen, Q Yan Operations Research 68 (4), 1074-1094, 2020 | 21 | 2020 |
| Robust mechanisms for risk-averse sellers M Sundararajan, Q Yan Proceedings of the 11th ACM conference on Electronic commerce, 139-148, 2010 | 18 | 2010 |
| Online bipartite matching with random arrivals: A strongly factor revealing lp approach M Mahdian, Q Yan STOC’11 Proceedings of the 43rd Annual ACM Symposium on Theory of Computing …, 2011 | 17 | 2011 |
| Optimal mechanisms for combinatorial auctions and combinatorial public projects via convex rounding S Dughmi, T Roughgarden, Q Yan Journal of the ACM (JACM) 63 (4), 1-33, 2016 | 15 | 2016 |
| An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries S Dughmi, T Roughgarden, J Vondrák, Q Yan arXiv preprint arXiv:1109.1053, 2011 | 12 | 2011 |
Mohammad MahdianResearch Scientist, GooglePatvirtintas el. paštas alum.mit.edu