Determining possible and necessary winners given partial orders L Xia, V Conitzer Journal of Artificial Intelligence Research 41, 25-67, 2011 | 279 | 2011 |
Profit-maximizing incentive for participatory sensing T Luo, HP Tan, L Xia IEEE INFOCOM 2014-IEEE Conference on Computer Communications, 127-135, 2014 | 230 | 2014 |
Preference functions that score rankings and maximum likelihood estimation V Conitzer, M Rognlie, L Xia Twenty-First International Joint Conference on Artificial Intelligence, 2009 | 213 | 2009 |
Random utility theory for social choice H Azari, D Parks, L Xia Advances in Neural Information Processing Systems 25, 2012 | 166 | 2012 |
Sequential composition of voting rules in multi-issue domains J Lang, L Xia Mathematical social sciences 57 (3), 304-324, 2009 | 147 | 2009 |
Complexity of Unweighted Coalitional Manipulation under Some Common Voting Rules. L Xia, M Zuckerman, AD Procaccia, V Conitzer, JS Rosenschein IjCAI 9, 348-352, 2009 | 140 | 2009 |
Computing the margin of victory for various voting rules L Xia Proceedings of the 13th ACM conference on electronic commerce, 982-999, 2012 | 133 | 2012 |
Generalized scoring rules and the frequency of coalitional manipulability L Xia, V Conitzer Proceedings of the 9th ACM Conference on Electronic Commerce, 109-118, 2008 | 130 | 2008 |
Voting in Combinatorial Domains. J Lang, L Xia Handbook of computational social choice, 197-222, 2016 | 122 | 2016 |
Generalized method-of-moments for rank aggregation H Azari Soufiani, W Chen, DC Parkes, L Xia Advances in Neural Information Processing Systems 26, 2013 | 109 | 2013 |
Dominating manipulations in voting with partial information V Conitzer, T Walsh, L Xia Proceedings of the AAAI conference on artificial intelligence 25 (1), 638-643, 2011 | 103 | 2011 |
A maximum likelihood approach towards aggregating partial orders L Xia, V Conitzer IJCAI Proceedings-International Joint Conference on Artificial Intelligence …, 2011 | 88 | 2011 |
A complexity-of-strategic-behavior comparison between Schulze's rule and ranked pairs D Parkes, L Xia Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 1429-1435, 2012 | 84 | 2012 |
A sufficient condition for voting rules to be frequently manipulable L Xia, V Conitzer Proceedings of the 9th ACM Conference on Electronic Commerce, 99-108, 2008 | 82 | 2008 |
Computing parametric ranking models via rank-breaking HA Soufiani, D Parkes, L Xia International Conference on Machine Learning, 360-368, 2014 | 79 | 2014 |
Stackelberg voting games: Computational aspects and paradoxes L Xia, V Conitzer Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 921-926, 2010 | 75 | 2010 |
Incentive mechanism design for crowdsourcing: An all-pay auction approach T Luo, SK Das, HP Tan, L Xia ACM Transactions on Intelligent Systems and Technology (TIST) 7 (3), 1-26, 2016 | 74 | 2016 |
Incentive compatible budget elicitation in multi-unit auctions S Bhattacharya, V Conitzer, K Munagala, L Xia Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 72 | 2010 |
Preference elicitation for general random utility models HA Soufiani, DC Parkes, L Xia arXiv preprint arXiv:1309.6864, 2013 | 71 | 2013 |
Differential privacy for eye-tracking data A Liu, L Xia, A Duchowski, R Bailey, K Holmqvist, E Jain Proceedings of the 11th ACM Symposium on Eye Tracking Research …, 2019 | 68 | 2019 |