◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Soroush Ebadian

University of Toronto

9 papers hereh-index 8248 citations18 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author5
  • middle author4

Across the 9 of 9 papers where every author was matched, so the position is known.

fields
  • cs.GT7
  • cs.AI1
  • cs.DB1
affiliations
  • University of Toronto
Homepage

identity via Semantic Scholar / OpenAlex

activity
20192024
most citedHow to Fairly Allocate Easy and Difficult Chores

16 citations · 28 across the 9 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.GT2021★ 16 cited

How to Fairly Allocate Easy and Difficult Chores

Soroush Ebadian, Dominik Peters, Nisarg Shah

A major open question in fair allocation of indivisible items is whether there always exists an allocation of chores that is Pareto optimal (PO) and envy-free up to one item (EF1).…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.