Search Results for author:
Found 3 papers, 0 papers with code
Breaking the Metric Voting Distortion Barrier
To do so we study a handful of voting rules that are new to the problem.
Regret Minimization with Noisy Observations
In our model, the task is to pick the highest one out of $n$ values.
Fair for All: Best-effort Fairness Guarantees for Classification
Instead, we propose a fairness notion whose guarantee, on each group $g$ in a class $\mathcal{G}$, is relative to the performance of the best classifier on $g$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
