activity
20112024
most citedA Maximum Likelihood Approach For Selecting Sets of Alternatives

35 citations · 79 across the 12 of their papers we have counts for

collaborators

18 papers

cs.GT2024★ 2 cited

Group Fairness in Peer Review

Haris Aziz, Evi Micha, Nisarg Shah

Large conferences such as NeurIPS and AAAI serve as crossroads of various AI fields, since they attract submissions from a vast number of communities. However, in some cases, this…

cs.GT2022★ 1 cited

Proportionally Fair Online Allocation of Public Goods with Predictions

Siddhartha Banerjee, Vasilis Gkatzelis, Safwan Hossain +3

We design online algorithms for the fair allocation of public goods to a set of agents over a sequence of rounds and focus on improving their performance using predictions.…

cs.GT2022★ 10 cited

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…

cs.GT2022

Class Fairness in Online Matching

Hadi Hosseini, Zhiyi Huang, Ayumi Igarashi +1

In the classical version of online bipartite matching, there is a given set of offline vertices (aka agents) and another set of vertices (aka items) that arrive online. When each i…

cs.GT2022

The Metric Distortion of Multiwinner Voting

Ioannis Caragiannis, Nisarg Shah, Alexandros A. Voudouris

We extend the recently introduced framework of metric distortion to multiwinner voting. In this framework, agents and alternatives are located in an underlying metric space…

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).…