| How to fairly allocate easy and difficult chores S Ebadian, D Peters, N Shah arXiv preprint arXiv:2110.11285, 2021 | 39 | 2021 |
| Optimized distortion and proportional fairness in voting S Ebadian, A Kahng, D Peters, N Shah Proceedings of the 23rd ACM Conference on Economics and Computation, 563-600, 2022 | 31 | 2022 |
| Fast algorithm for k-truss discovery on public-private graphs S Ebadian, X Huang arXiv preprint arXiv:1906.00140, 2019 | 27 | 2019 |
| Is Sortition Both Representative and Fair? S Ebadian, G Kehne, E Micha, A Procaccia, N Shah NeurIPS, 2022 | 8 | 2022 |
| The Distortion of Approval Voting with Runoff. S Ebadian, M Latifian, N Shah AAMAS, 1752-1760, 2023 | 3 | 2023 |
| Explainable and efficient randomized voting rules S Ebadian, A Filos-Ratsikas, M Latifian, N Shah Advances in Neural Information Processing Systems 36, 2024 | 2 | 2024 |
| Boosting Sortition via Proportional Representation S Ebadian, E Micha | 2 | 2023 |
| Efficient Resource Allocation with Secretive Agents. S Ebadian, R Freeman, N Shah IJCAI, 272-278, 2022 | 2 | 2022 |
| Economics and Computation P Levy, D Sarne, Y Aumann, A Abeliuk, K Elbassioni, T Rahwan, ... ACM Transactions on 12 (1), 2024 | | 2024 |
| Computational Aspects of Distortion S Ebadian, A Filos-Ratsikas, A Filos, M Latifian, N Shah The 23rd International Conference on Autonomous Agents and Multi-Agent …, 2023 | | 2023 |
| A Simple Randomized Algorithm for All Nearest Neighbors S Ebadian, H Zarrabi-Zadeh Proceedings of the 31st Canadian Conference on Computational Geometry, 94-98, 2019 | | 2019 |
| Metric Distortion with Elicited Pairwise Comparisons S Ebadian, D Halpern, E Micha | | |
Nisarg ShahAssociate Professor, University of TorontoVerified email at cs.toronto.edu
