A Simple Randomized Algorithm for All Nearest Neighbors. - Soroush Ebadian; Hamid Zarrabi-Zadeh (CCCG, 2019)

Fast Algorithm for K-Truss Discovery on Public-Private Graphs. - Soroush Ebadian; Xin Huang 001 (IJCAI, 2019)

How to Fairly Allocate Easy and Difficult Chores. - Soroush Ebadian; Dominik Peters; Nisarg Shah 001 (AAMAS, 2022)

Efficient Resource Allocation with Secretive Agents. - Soroush Ebadian; Rupert Freeman; Nisarg Shah 001 (IJCAI, 2022)

Is Sortition Both Representative and Fair? - Soroush Ebadian; Gregory Kehne; Evi Micha; Ariel D. Procaccia; Nisarg Shah 001 (NeurIPS, 2022)

The Distortion of Approval Voting with Runoff. - Soroush Ebadian; Mohamad Latifian; Nisarg Shah 001 (AAMAS, 2023)

Explainable and Efficient Randomized Voting Rules. - Soroush Ebadian; Aris Filos-Ratsikas; Mohamad Latifian; Nisarg Shah 001 (NeurIPS, 2023)

Computational Aspects of Distortion. - Soroush Ebadian; Aris Filos-Ratsikas; Mohamad Latifian; Nisarg Shah 001 (AAMAS, 2024)

Harm Ratio: A Novel and Versatile Fairness Criterion. - Soroush Ebadian; Rupert Freeman; Nisarg Shah 001 (EAAMO, 2024)

Metric Distortion with Elicited Pairwise Comparisons. - Soroush Ebadian; Daniel Halpern 002; Evi Micha (IJCAI, 2024)

Policy Aggregation. - Parand A. Alamdari; Soroush Ebadian; Ariel D. Procaccia (NeurIPS, 2024)

Optimized Distortion and Proportional Fairness in Voting. - Soroush Ebadian; Anson Kahng; Dominik Peters; Nisarg Shah 001 (ACM Trans. Economics and Comput., 2024)

Fair Division with Market Values. - Siddharth Barman; Soroush Ebadian; Mohamad Latifian; Nisarg Shah 001 (AAAI, 2025)

Constrained Fair and Efficient Allocations. - Benjamin Cookson; Soroush Ebadian; Nisarg Shah 001 (AAAI, 2025)

Temporal Fair Division. - Benjamin Cookson; Soroush Ebadian; Nisarg Shah 001 (AAAI, 2025)

Every Bit Helps: Achieving the Optimal Distortion with a Few Queries. - Soroush Ebadian; Nisarg Shah 001 (AAAI, 2025)

Boosting Sortition via Proportional Representation. - Soroush Ebadian; Evi Micha (AAMAS, 2025)