activity
20142026
most citedWeighted Envy-Freeness in Indivisible Item Allocation

58 citations · 163 across the 32 of their papers we have counts for

collaborators
Showing 2023Show all

8 papers · 1 filter

cs.AI2023★ 3 cited

Axiomatic Aggregations of Abductive Explanations

Gagan Biradar, Yacine Izza, Elita Lobo +2

The recent criticisms of the robustness of post hoc model approximation explanation methods (like LIME and SHAP) have led to the rise of model-precise abductive explanations. For e…

cs.GT2023

The Good, the Bad and the Submodular: Fairly Allocating Mixed Manna Under Order-Neutral Submodular Preferences

Cyrus Cousins, Vignesh Viswanathan, Yair Zick

We study the problem of fairly allocating indivisible goods (positively valued items) and chores (negatively valued items) among agents with decreasing marginal utilities over item…

cs.CY2023★ 2 cited

Towards AI Transparency and Accountability: A Global Framework for Exchanging Information on AI Systems

Warren Buckley, Adrian Byrne, Nicholas Perello +4

We propose that future AI transparency and accountability regulations are based on an open global standard for exchanging information about AI systems, which allows co-existence of…

cs.LG2023★ 1 cited

Simple Steps to Success: A Method for Step-Based Counterfactual Explanations

Jenny Hamer, Nicholas Perello, Jake Valladares +2

Algorithmic recourse is a process that leverages counterfactual explanations, going beyond understanding why a system produced a given classification, to providing a user with acti…

cs.GT2023

Weighted Notions of Fairness with Binary Supermodular Chores

Vignesh Viswanathan, Yair Zick

We study the problem of allocating indivisible chores among agents with binary supermodular cost functions. In other words, each chore has a marginal cost of or and chores…

cs.GT2023★ 6 cited

For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods

Jonathan Scarlett, Nicholas Teh, Yair Zick

Fair allocation of indivisible goods is a well-explored problem. Traditionally, research focused on individual fairness - are individual agents satisfied with their allotted share?…

cs.GT2023★ 1 cited

Dividing Good and Better Items Among Agents with Bivalued Submodular Valuations

Cyrus Cousins, Vignesh Viswanathan, Yair Zick

We study the problem of fairly allocating a set of indivisible goods among agents with {\em bivalued submodular valuations} -- each good provides a marginal gain of either or $…

cs.GT2023★ 2 cited

Into the Unknown: Assigning Reviewers to Papers with Uncertain Affinities

Cyrus Cousins, Justin Payan, Yair Zick

A successful peer review process requires that qualified and interested reviewers are assigned to each paper. Most automated reviewer assignment approaches estimate a real-valued a…