default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoroush Ebadian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Soroush Ebadian
, Anson Kahng, Dominik Peters, Nisarg Shah:
Optimized Distortion and Proportional Fairness in Voting. ACM Trans. Economics and Comput. 12(1): 3:1-3:39 (2024)- [c11]Soroush Ebadian, Aris Filos-Ratsikas, Mohamad Latifian, Nisarg Shah:
Computational Aspects of Distortion. AAMAS 2024: 499-507 - [c10]Soroush Ebadian, Rupert Freeman, Nisarg Shah:
Harm Ratio: A Novel and Versatile Fairness Criterion. EAAMO 2024: 3:1-3:14 - [c9]Soroush Ebadian, Daniel Halpern, Evi Micha:
Metric Distortion with Elicited Pairwise Comparisons. IJCAI 2024: 2791-2798 - [i9]Soroush Ebadian, Evi Micha:
Boosting Sortition via Proportional Representation. CoRR abs/2406.00913 (2024) - [i8]Soroush Ebadian, Rupert Freeman, Nisarg Shah:
Harm Ratio: A Novel and Versatile Fairness Criterion. CoRR abs/2410.02977 (2024) - [i7]Siddharth Barman, Soroush Ebadian, Mohamad Latifian, Nisarg Shah:
Fair Division with Market Values. CoRR abs/2410.23137 (2024) - [i6]Benjamin Cookson, Soroush Ebadian, Nisarg Shah:
Temporal Fair Division. CoRR abs/2410.23416 (2024) - [i5]Benjamin Cookson, Soroush Ebadian, Nisarg Shah:
Constrained Fair and Efficient Allocations. CoRR abs/2411.00133 (2024) - [i4]Parand A. Alamdari, Soroush Ebadian, Ariel D. Procaccia:
Policy Aggregation. CoRR abs/2411.03651 (2024) - 2023
- [c8]Soroush Ebadian, Mohamad Latifian, Nisarg Shah:
The Distortion of Approval Voting with Runoff. AAMAS 2023: 1752-1760 - [c7]Soroush Ebadian, Aris Filos-Ratsikas, Mohamad Latifian, Nisarg Shah:
Explainable and Efficient Randomized Voting Rules. NeurIPS 2023 - 2022
- [c6]Soroush Ebadian, Dominik Peters, Nisarg Shah:
How to Fairly Allocate Easy and Difficult Chores. AAMAS 2022: 372-380 - [c5]Soroush Ebadian, Rupert Freeman, Nisarg Shah:
Efficient Resource Allocation with Secretive Agents. IJCAI 2022: 272-278 - [c4]Soroush Ebadian, Gregory Kehne, Evi Micha, Ariel D. Procaccia, Nisarg Shah:
Is Sortition Both Representative and Fair? NeurIPS 2022 - [c3]Soroush Ebadian, Anson Kahng, Dominik Peters, Nisarg Shah:
Optimized Distortion and Proportional Fairness in Voting. EC 2022: 563-600 - [i3]Soroush Ebadian, Anson Kahng, Nisarg Shah, Dominik Peters:
Optimized Distortion and Proportional Fairness in Voting. CoRR abs/2205.15760 (2022) - 2021
- [i2]Soroush Ebadian, Dominik Peters, Nisarg Shah:
How to Fairly Allocate Easy and Difficult Chores. CoRR abs/2110.11285 (2021)
2010 – 2019
- 2019
- [c2]Soroush Ebadian, Hamid Zarrabi-Zadeh:
A Simple Randomized Algorithm for All Nearest Neighbors. CCCG 2019: 94-98 - [c1]Soroush Ebadian, Xin Huang:
Fast Algorithm for K-Truss Discovery on Public-Private Graphs. IJCAI 2019: 2258-2264 - [i1]Soroush Ebadian, Xin Huang:
Fast Algorithm for K-Truss Discovery on Public-Private Graphs. CoRR abs/1906.00140 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
