Soroush Ebadian

Orcid: 0000-0002-8742-0256

According to our database1, Soroush Ebadian authored at least 15 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimized Distortion and Proportional Fairness in Voting.
ACM Trans. Economics and Comput., March, 2024

Constrained Fair and Efficient Allocations.
CoRR, 2024

Temporal Fair Division.
CoRR, 2024

Fair Division with Market Values.
CoRR, 2024

Boosting Sortition via Proportional Representation.
CoRR, 2024

Metric Distortion with Elicited Pairwise Comparisons.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Harm Ratio: A Novel and Versatile Fairness Criterion.
Proceedings of the 4th ACM Conference on Equity and Access in Algorithms, 2024

Computational Aspects of Distortion.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Explainable and Efficient Randomized Voting Rules.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

The Distortion of Approval Voting with Runoff.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Is Sortition Both Representative and Fair?
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Efficient Resource Allocation with Secretive Agents.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

How to Fairly Allocate Easy and Difficult Chores.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2019
Fast Algorithm for K-Truss Discovery on Public-Private Graphs.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

A Simple Randomized Algorithm for All Nearest Neighbors.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019


  Loading...