stat.MLSep 19, 2026

Bayesian Deck-of-cards-based Ordinal Regression with Sequential Preference Elicitation

Authors: Marco Grillo, Silvano Zappalà

Organizations: Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965, Poznań, Poland · Department of Economics and Business, University of Catania, Corso Italia 55, 95129, Catania, Italy

Abstract

The Deck-of-cards-based Ordinal Regression (DOR) infers a value function from a ranking of reference alternatives in which the Decision Maker (DM) inserts blank cards between consecutive levels to express preference intensity. DOR, and its stochastic extension (SMAA-DOR), treat these answers as hard constraints defining a set of compatible value functions. We propose B-DOR, a probabilistic reformulation of DOR in which each pair of adjacent levels yields an ordinal observation, the declared direction and the number of cards, modelled through a cumulative-link likelihood that relates the number of blank cards to the latent value difference between alternatives. Two Bayesian inference algorithms are proposed: BAYES-DOR samples the whole posterior distribution by Hamiltonian Monte Carlo; FTRL-DOR tracks the maximum a posteriori estimate by constrained convex optimization. Moreover, through a multi-step elicitation process, elicitation can be spread over several short sessions reducing the cognitive burden on the DM. Both algorithms enjoy logarithmic regret bounds for prediction that hold for any sequence of DM responses and that guide the choice of the prior hyperparameters. A Monte Carlo study over 768 configurations shows that accuracy grows with the number of sessions, that blank cards add significant information over preference directions alone, that both algorithms maintain good performance under inconsistent answers, and that both outperform DOR and SMAA-DOR. An illustrative application to Italian regional healthcare performance demonstrates the practical applicability of the approach for building composite indicators.

Figures & tables

Explore similar work

CardsList
  1. On the Complexity of Preference-Based Bandits

    Sep 30, 2026Ahmed Ben Yahmed, Marc Abeille, Clément CalauzènesPairwise Preference LearningMulti-Armed Bandits

  2. DiffoR: A Unified Continuous Generative Framework for Universal Ordinal Regression

    May 29, 2026Hongxu Ma, Lin Wang, Chenghou Jin +6Ordinal Regression