mlsanityData to 14 Oct 2026

Preference Elicitation and Robust Optimization with Multi-Attribute Quasi-Concave Choice Functions

arXiv 1805.06632 ↗First posted 17 May 2018q-fin.RM cs.AI cs.IRcited by 1

Not on the map. Why?

Abstract (arXiv)

Decision maker's preferences are often captured by some choice functions which are used to rank prospects. In this paper, we consider ambiguity in choice functions over a multi-attribute prospect space. Our main result is a robust preference model where the optimal decision is based on the worst-case choice function from an ambiguity set constructed through preference elicitation with pairwise comparisons of prospects. Differing from existing works in the area, our focus is on quasi-concave choice functions rather than concave functions and this enables us to cover a wide range of utility/risk preference problems including multi-attribute expected utility and S-shaped aspirational risk preferences. The robust choice function is increasing and quasi-concave but not necessarily translation invariant, a key property of monetary risk measures. We propose two approaches based respectively on the support functions and level functions of quasi-concave functions to develop tractable formulations of the maximin preference robust optimization model. The former gives rise to a mixed integer linear programming problem whereas the latter is equivalent to solving a sequence of convex risk minimization problems. To assess the effectiveness of the proposed robust preference optimization model and numerical schemes, we apply them to a security budget allocation problem and report some preliminary results from experiments.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 17 May 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2024On Tractability, Complexity, and Mixed-Integer Convex Programming Representability of Distributionally Favorable Optimization
  2. 2026On the Complexity of Preference-Based Bandits
  3. 2025Risk-sensitive Reinforcement Learning Based on Convex Scoring Functions
  4. 2025Semiparametric Preference Optimization: Your Language Model is Secretly a Single-Index Model
  5. 2024KTO: Model Alignment as Prospect Theoretic Optimization
  6. 2026Provably avoiding over-optimization in Direct Preference Optimization without knowing the data distribution
  7. 2026Understanding Gap-Dependent Regret for Optimism-Based Reinforcement Learning with Linear Function Approximation
  8. 2025Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspective