Search Results for author:
Found 6 papers, 2 papers with code
Graphical House Allocation
The classical house allocation problem involves assigning $n$ houses (or items) to $n$ agents according to their preferences.
Equitable Division of a Path
We show that achieving EQ1 in conjunction with well-studied measures of economic efficiency (such as Pareto optimality, non-wastefulness, maximum egalitarian or utilitarian welfare) is computationally hard even for binary additive valuations.
Fairness
Computer Science and Game Theory
Fair and Efficient Allocations under Lexicographic Preferences
Envy-freeness up to any good (EFX) provides a strong and intuitive guarantee of fairness in the allocation of indivisible goods.
Fairness
Computer Science and Game Theory
Accomplice Manipulation of the Deferred Acceptance Algorithm
We show that the optimal manipulation strategy for an accomplice comprises of promoting exactly one woman in his true list (i. e., an inconspicuous manipulation).
Computer Science and Game Theory
Minimizing Time-to-Rank: A Learning and Recommendation Approach
Consider the following problem faced by an online voting platform: A user is provided with a list of alternatives, and is asked to rank them in order of preference using only drag-and-drop operations.
On the Statistical Consistency of Plug-in Classifiers for Non-decomposable Performance Measures
In this work, we consider plug-in algorithms that learn a classifier by applying an empirically determined threshold to a suitable `estimate' of the class probability, and provide a general methodology to show consistency of these methods for any non-decomposable measure that can be expressed as a continuous function of true positive rate (TPR) and true negative rate (TNR), and for which the Bayes optimal classifier is the class probability function thresholded suitably.
