Search Results for author:
Found 8 papers, 1 papers with code
Axiomatic Aggregations of Abductive Explanations
We also evaluate them on multiple datasets and show that these explanations are robust to the attacks that fool SHAP and LIME.
Simple Steps to Success: Axiomatics of Distance-Based Algorithmic Recourse
We propose a novel data-driven framework for algorithmic recourse that offers users interventions to change their predicted outcome.
Weighted Notions of Fairness with Binary Supermodular Chores
We study the problem of allocating indivisible chores among agents with binary supermodular cost functions.
Dividing Good and Better Items Among Agents with Bivalued Submodular Valuations
This is surprising since for the simpler classes of bivalued additive valuations and binary submodular valuations, MNW allocations are known to be envy free up to any good (EFX).
Graphical House Allocation
The classical house allocation problem involves assigning $n$ houses (or items) to $n$ agents according to their preferences.
Yankee Swap: a Fast and Simple Fair Allocation Mechanism for Matroid Rank Valuations
We study fair allocation of indivisible goods when agents have matroid rank valuations.
Model Explanations via the Axiomatic Causal Lens
Thus, our work is the first to formally bridge the gap between model explanations, game-theoretic influence, and causal analysis.
The Price is (Probably) Right: Learning Market Equilibria from Samples
Equilibrium computation in markets usually considers settings where player valuation functions are known.
