Soroush Ebadian
Soroush Ebadian
Verified email at - Homepage
Cited by
Cited by
How to fairly allocate easy and difficult chores
S Ebadian, D Peters, N Shah
arXiv preprint arXiv:2110.11285, 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
Fast algorithm for k-truss discovery on public-private graphs
S Ebadian, X Huang
arXiv preprint arXiv:1906.00140, 2019
Is Sortition Both Representative and Fair?
S Ebadian, G Kehne, E Micha, A Procaccia, N Shah
NeurIPS, 2022
The Distortion of Approval Voting with Runoff
S Ebadian, M Latifian, N Shah
Proceedings of the 22nd International Conference on Autonomous Agents and …, 2023
Efficient resource allocation with secretive agents
S Ebadian, R Freeman, N Shah
Proceedings of the 31st International Joint Conference on Artificial …, 2022
Explainable and efficient randomized voting rules
S Ebadian, A Filos-Ratsikas, M Latifian, N Shah
Advances in Neural Information Processing Systems 36, 2024
Boosting Sortition via Proportional Representation
S Ebadian, E Micha
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
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
Metric Distortion with Elicited Pairwise Comparisons
S Ebadian, D Halpern, E Micha
How to Fairly Allocate Easy and Difficult Chores
S Ebadian, D Peters, N Shah
The system can't perform the operation now. Try again later.
Articles 1–12