# Geometric Preference Elicitation for Minimax Regret Optimization in Uncertainty Matroids

arXiv: https://arxiv.org/abs/2503.18668 · HTML: https://mlsanity.com/paper/2503.18668/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 37 references that are in the map.
- First posted on arXiv 24 Mar 2025.

## Builds on (most cited first, 3 of 3)

- [Adapting a Kidney Exchange Algorithm to Align with Human Values](https://mlsanity.com/paper/2005.09755/) (2020)
- [Robust Active Preference Elicitation](https://mlsanity.com/paper/2003.01899/) (2020)
- [The minimum cost query problem on matroids with uncertainty areas](https://mlsanity.com/paper/1904.11668/) (2019)

## Abstract (arXiv)

This paper presents an efficient preference elicitation framework for uncertain matroid optimization, where precise weight information is unavailable, but insights into possible weight values are accessible. The core innovation of our approach lies in its ability to systematically elicit user preferences, aligning the optimization process more closely with decision-makers' objectives. By incrementally querying preferences between pairs of elements, we iteratively refine the parametric uncertainty regions, leveraging the structural properties of matroids. Our method aims to achieve the exact optimum by reducing regret with a few elicitation rounds. Additionally, our approach avoids the computation of Minimax Regret and the use of Linear programming solvers at every iteration, unlike previous methods. Experimental results on four standard matroids demonstrate that our method reaches optimality more quickly and with fewer preference queries than existing techniques.