16 citations · 28 across the 9 of their papers we have counts for
9 papers
Policy Aggregation
Parand A. Alamdari, Soroush Ebadian, Ariel D. Procaccia
We consider the challenge of AI value alignment with multiple individuals that have different reward functions and optimal policies in an underlying Markov decision process. We for…
Constrained Fair and Efficient Allocations
Benjamin Cookson, Soroush Ebadian, Nisarg Shah
Fairness and efficiency have become the pillars of modern fair division research, but prior work on achieving both simultaneously is largely limited to the unconstrained setting. W…
Temporal Fair Division
Benjamin Cookson, Soroush Ebadian, Nisarg Shah
We study temporal fair division, whereby a set of agents are allocated a (possibly different) set of goods on each day for a period of days. We study this setting, as well as a num…
Fair Division with Market Values
Siddharth Barman, Soroush Ebadian, Mohamad Latifian +1
We introduce a model of fair division with market values, where indivisible goods must be partitioned among agents with (additive) subjective valuations, and each good additionally…
Harm Ratio: A Novel and Versatile Fairness Criterion
Soroush Ebadian, Rupert Freeman, Nisarg Shah
Envy-freeness has become the cornerstone of fair division research. In settings where each individual is allocated a disjoint share of collective resources, it is a compelling fair…
Boosting Sortition via Proportional Representation
Soroush Ebadian, Evi Micha
Sortition is based on the idea of choosing randomly selected representatives for decision making. The main properties that make sortition particularly appealing are fairness -- all…
Optimized Distortion and Proportional Fairness in Voting
Soroush Ebadian, Anson Kahng, Dominik Peters +1
A voting rule decides on a probability distribution over a set of m alternatives, based on rankings of those alternatives provided by agents. We assume that agents have cardinal ut…
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).…
Fast Algorithm for K-Truss Discovery on Public-Private Graphs
Soroush Ebadian, Xin Huang
In public-private graphs, users share one public graph and have their own private graphs. A private graph consists of personal private contacts that only can be visible to its owne…