Effective sampling and learning for Mallows models with pairwise-preference data
From MaRDI portal
Publication:5249595
Recommendations
- Probabilistic preference learning with the Mallows rank model
- Mallows and generalized Mallows model for matchings
- Sampling and learning Mallows and generalized Mallows models under the Cayley distance
- Efficient and accurate inference for mixtures of Mallows models with Spearman distance
- Rank Centrality: Ranking from Pairwise Comparisons
Cited in
(18)- New learning methods for supervised and unsupervised preference aggregation
- Optimizing positional scoring rules for rank aggregation
- Learning from comparisons and choices
- Semiparametric preference learning
- Probabilistic preference learning with the Mallows rank model
- Analysis of ranking data
- On incomplete label ranking with IF-sets
- Scalable Bayesian preference learning for crowds
- Antithetic and Monte Carlo kernel estimators for partial rankings
- Efficient and accurate inference for mixtures of Mallows models with Spearman distance
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints
- Robust Plackett-Luce model for \(k\)-ary crowdsourced preferences
- Generalized rank-breaking: computational and statistical tradeoffs
- Strategyproof mechanism for two-sided matching with resource allocation
- Sampling and learning Mallows and generalized Mallows models under the Cayley distance
- Reaching a joint decision with minimal elicitation of voter preferences
- Uncovering the riffled independence structure of ranked data
- Riffled independence for efficient inference with partial rankings
This page was built for publication: Effective sampling and learning for Mallows models with pairwise-preference data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249595)
