Computational Aspects of Distortion By Soroush Ebadian, Aris Filos-Ratsikas, Mohamad Latifian, and Nisarg Shah
Explainable and Efficient Randomized Voting Rules By Soroush Ebadian, Aris Filos-Ratsikas, Mohamad Latifian, and Nisarg Shah In NeurIPS-23: Proc. of 37th Annual Conference on Neural Information Processing Systems, 2023. (Forthcoming) [Paper]
The Distortion of Approval Voting with Runoff By Soroush Ebadian, Mohamad Latifian, and Nisarg Shah In AAMAS-23: Proc. of 22nd International Conference on Autonomous Agents and Multi-Agent Systems, pp 1752–1760, 2023. [Paper]
Is Sortition Both Representative and Fair? By Soroush Ebadian, Gregory Kehne, Evi Micha, Ariel Procaccia, and Nisarg Shah In NeurIPS-22: Proc. of 36th Annual Conference on Neural Information Processing Systems, pp. 3431–3443, 2022. [Paper]
Optimized Distortion and Proportional Fairness in Voting By Soroush Ebadian, Anson Kahng, Dominik Peters, and Nisarg Shah In EC-22: Proc. of 23rd ACM Conference on Economics and Computation, pp. 563–600, 2022. [Paper]
Efficient Resource Allocation with Secretive Agents By Soroush Ebadian, Rupert Freeman, and Nisarg Shah In IJCAI-22: Proc. of 31st International Joint Conference on Artificial Intelligence, pp. 272–278, 2022. [Paper]
How to Fairly Allocate Easy and Difficult Chores By Soroush Ebadian, Dominik Peters, and Nisarg Shah In AAMAS-22: Proc. of 21st International Conference on Autonomous Agents and Multi-Agent Systems, pp. 372–380, 2022. [Paper]
Fast Algorithm for K-Truss Discovery on Public-Private Graphs By Soroush Ebadian and Xin Huang In IJCAI-19: Proc. of 28st International Joint Conference on Artificial Intelligence, pp. 2258–2264, 2019. [Paper]
A Simple Randomized Algorithm for All Nearest Neighbors By Soroush Ebadian and Hamid Zarrabi-Zadeh In CCCG-19: Proc. of 31st Canadian Conference on Computational Geometry, pp. 94–98, 2019. [Paper]