Search Results for author:
Found 2 papers, 1 papers with code
Pareto-Optimal Fairness-Utility Amortizations in Rankings with a DBN Exposure Model
We lay out the structure of a new geometrical object (the DBN-expohedron), and propose for it a Carath\'eodory decomposition algorithm of complexity $O(n^3)$, where $n$ is the number of documents to rank.
Introducing the Expohedron for Efficient Pareto-optimal Fairness-Utility Amortizations in Repeated Rankings
Such a decomposition makes it possible to express any feasible target exposure as a distribution over at most $n$ rankings.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
