NON-NULL RANKING MODELS. I
From MaRDI portal
Publication:3260016
DOI10.1093/biomet/44.1-2.114zbMath0087.34001OpenAlexW2063445365MaRDI QIDQ3260016
Publication date: 1957
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biomet/44.1-2.114
Related Items
Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice, On adding a list of numbers (and other one-dependent determinantal processes), A new nonparametric approach to the problem of agreement between two groups of judges, Testing for the Presence of a Maverick Judge, Exploring the No-Show Paradox for Condorcet Extensions, Ewens Sampling and Invariable Generation, Unnamed Item, Phase uniqueness for the Mallows measure on permutations, The band structure of a model of spatial random permutation, Median constrained bucket order rank aggregation, Model fitting using partially ranked data, Query-based selection of optimal candidates under the Mallows model, Sequential selections with minimization of failure, Cycles in Mallows random permutations, An Extended Class of Ranking Models, The height of record‐biased trees, Regenerative random permutations of integers, A Kemeny distance-based robust fuzzy clustering for preference data, Strategyproof allocation mechanisms with endowments and M-convex distributional constraints, Limit distributions for Euclidean random permutations, \textsc{PeerNomination}: a novel peer selection algorithm to handle strategic and noisy assessments, Strategyproof mechanism for two-sided matching with resource allocation, Partition–Mallows Model and Its Inference for Rank Aggregation, PLMIX: an R package for modelling and clustering partially ranked data, Computing welfare-maximizing fair allocations of indivisible goods, Informative priors for the consensus ranking in the Bayesian Mallows model, Unnamed Item, Remarkable properties for diagnostics and inference of ranking data modelling, Social order statistics models for ranking data with analysis of preferences in social networks, A non-utilitarian discrete choice model for preference aggregation, Top-\(k\) list aggregation: mathematical formulations and polyhedral comparisons, A family of distances for preference-approvals, Efficient and accurate inference for mixtures of Mallows models with Spearman distance, Multi-dimensional Bayesian network classifiers for partial label ranking, Ensemble learning for the partial label ranking problem, The Bradley-Terry regression trunk approach for modeling preference data with small trees, An axiomatic distance methodology for aggregating multimodal evaluations, Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations, Lazy Gale-Shapley for many-to-one matching with partial information, The asymptotics of ranking algorithms, Hidden Hamiltonian Cycle Recovery via Linear Programming, An Extended Mallows Model for Ranked Data Aggregation, Distance-based tree models for ranking data, A non-iterative procedure for maximum likelihood estimation of the parameters of mallows' model based on partial rankings, Model-based clustering for multivariate partial ranking data, Models for network evolution, Using partial ranking information in the design of small-sample comparisons, Voting rules as statistical estimators, Mixtures of Weighted Distance-Based Models for Ranking Data, Revealing Subgroup Structure in Ranked Data Using a Bayesian WAND, Estimation of Distribution Algorithms for the Firefighter Problem, An Inference and Integration Approach for the Consolidation of Ranked Lists, Hierarchical orbital decompositions and extended decomposable distributions, A Mixture Model for Longitudinal Partially Ranked Data, Conjugacy Class Prior Distributions on Metric-Based Ranking Models, Unnamed Item, On Incomplete Label Ranking with IF-sets, Efficient Clustering for Orders, A model for the analysis of multiple strategies, Some probabilistic models of simple choice and ranking, A paired comparison approach for the analysis of sets of Likert-scale responses, Bayesian Aggregation of Order-Based Rank Data, Liquid Democracy: An Algorithmic Perspective, Time-homogeneous top-K ranking using tensor decompositions, Arcsine laws for random walks generated from random permutations with applications to genomics, Bayesian rank-based hypothesis testing for the rank sum test, the signed rank test, and Spearman's ρ, Mallows permutations as stable matchings, Detecting the end of agreement between two long ranked lists, A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation, Fair in the Eyes of Others, Choice Functions Generated by Mallows and Plackett–Luce Relations, Combining dependent tests based on data depth with applications to the two-sample problem for data of arbitrary types, Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron, A review on instance ranking problems in statistical learning, Information efficient learning of complexly structured preferences: elicitation procedures and their application to decision making under uncertainty, Comparing boosting and bagging for decision trees of rankings, Stagewise learning for noisy \(k\)-ary preferences, Metric inference for social networks, A generalized Mallows model based on \(\phi\)-divergence measures, Robust Plackett-Luce model for \(k\)-ary crowdsourced preferences, Dyad ranking using Plackett-Luce models based on joint feature representations, A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances, Statistics for phylogenetic trees, Recursive inversion models for permutations, Multidimensional medians arising from geodesics on graphs, A central limit theorem for descents of a Mallows permutation and its inverse, Partial evaluation in rank aggregation problems, FOPA-MC: fuzzy multi-criteria group decision making for peer assessment, Efficient parameter estimation of truncated Boolean product distributions, A novel method for estimating the common signals for consensus across multiple ranked lists, The length of the longest increasing subsequence of a random Mallows permutation, Angle-based models for ranking data, Finding the second-best candidate under the Mallows model, A weighted distance metric for assessing ranking dissimilarity and inter-group heterogeneity, Monotonicity as a tool for differentiating between truth and optimality in the aggregation of rankings, The Mallows measures on the hyperoctahedral group, \(q\)-exchangeability via quasi-invariance, Space reduction constraints for the median of permutations problem, A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings, Mallows permutations and finite dependence, Voting rules as error-correcting codes, Hit and run as a unifying device, The two-sided infinite extension of the Mallows model for random permutations, Level \(r\) consensus and stable social choice, Limit theorems for longest monotone subsequences in random Mallows permutations, Sampling and learning Mallows and generalized Mallows models under the Cayley distance, Modelling rankings in R: the \textbf{PlackettLuce} package, Flexible level-1 consensus ensuring stable social choice: analysis and algorithms, On the likelihood of single-peaked preferences, Uncovering the riffled independence structure of ranked data, Exploring the median of permutations problem, Experiments with Kemeny ranking: What works when?, Mallows' models for imperfect ranking in ranked set sampling, Probability models on rankings, Loglinear representation for multivariate choice data, Mallows and generalized Mallows model for matchings, On the cycle structure of Mallows permutations, Mixtures of distance-based models for ranking data, Covariance structure analysis of ordinal ipsative data, On rank statistics: An approach via metrics on the permutation group, A multistage ranking model, Supervised clustering of label ranking data using label preference information, A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach, Mixtures of weighted distance-based models for ranking data with applications in political studies, Paired comparison, triple comparison, and ranking experiments as generalized linear models, and their implementation on GLIM, Estimation in exponential families on permutations, Right invariant metrics and measures of presortedness, Modeling heterogeneity in ranked responses by nonparametric maximum likelihood: How do Europeans get their scientific knowledge?, The repeated insertion model for rankings: missing link between two subset choice models, Geometric representation of association between categories, Prior distributions on symmetric groups, Directed connection measurement for evaluating reconstructed stroke sequence in handwriting images, A generative model for rank data based on insertion sort algorithm, Quantile-based clustering, Efficient algorithms using subiterative convergence for Kemeny ranking problem, Discrete choice models based on random walks, A mixture of experts model for rank data with applications in election studies, Preference elicitation and robust winner determination for single- and multi-winner social choice, On L-decomposability of random orderings, Inferring a consensus problem list using penalized multistage models for ordered data, Utilitarian welfare and representation guarantees of approval-based multiwinner rules, Signal processing on the permutahedron: tight spectral frames for ranked data analysis, Generalized transitivity: a systematic comparison of concepts with an application to preferences in the Babington Smith model, Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments, Estimating the number of clusters in a ranking data context, Adjacency-based regularization for partially ranked data with non-ignorable missing, The height of Mallows trees, Margin of victory for tournament solutions, Asymptotic properties of Lee distance, Probabilistic preferences and topset voting, A stochastic theory for the emergence and the evolution of preference relations, Learning context-dependent choice functions, \(k\)-majority digraphs and the hardness of voting with a constant number of voters, On testing transitivity in online preference learning, Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem, Optimizing positional scoring rules for rank aggregation, Empathetic decision making in social networks, Mixing of permutations by biased transpositions, Comparing the efficacy of ranking methods for multiple round-robin tournaments, Bayesian analysis of rank data with covariates and heterogeneous rankers, Correlation for permutations, The importance of being clustered: uncluttering the trends of statistics from 1970 to 2015, Multi-label classification using a fuzzy rough neighborhood consensus, Rank aggregation using latent-scale distance-based models, Antithetic and Monte Carlo kernel estimators for partial rankings, The limit of the empirical measure of the product of two independent Mallows permutations, On the correlation of a group of rankings with an external ordering relative to the internal concordance, Learning mixtures of permutations: groups of pairwise comparisons and combinatorial method of moments, Lengths of monotone subsequences in a Mallows permutation, Random relations, random utilities, and random functions, Geometry of the space of phylogenetic trees, A general concept of majority rule
