Introducing the expohedron for efficient pareto-optimal fairness-utility amortizations in repeated rankings

T Kletti, JM Renders, P Loiseau - … Conference on Web Search and Data …, 2022 - dl.acm.org
We consider the problem of computing a sequence of rankings that maximizes consumer-
side utility while minimizing producer-side individual unfairness of exposure. While prior …

Hide-and-seek game with capacitated locations and imperfect detection

B Bahamondes, M Dahan - Decision Analysis, 2024 - pubsonline.informs.org
We consider a variant of the hide-and-seek game in which a seeker inspects multiple hiding
locations to find multiple items hidden by a hider. Each hiding location has a maximum …

Anonymous bandits for multi-user systems

H Esfandiari, V Mirrokni… - Advances in Neural …, 2022 - proceedings.neurips.cc
In this work, we present and study a new framework for online learning in systems with
multiple users that provide user anonymity. Specifically, we extend the notion of bandits to …

Quasi-Newton algorithm for optimal approximate linear regression design: Optimization in matrix space

N Gaffke, R Schwabe - Journal of Statistical Planning and Inference, 2019 - Elsevier
Given a linear regression model and an experimental region for the independent variable,
the problem of finding an optimal approximate design calls for minimizing a convex …

Ranking systems and methods using a dynamic bayesian network exposure model

T Kletti, JM Renders - US Patent 12,216,667, 2025 - Google Patents
A method for ranking a set of objects includes: receiving the set of objects to rank, a
relevance score for each object, and a set of objective functions; based on the relevance …