Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990

From MaRDI portal
Revision as of 07:04, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1202177


zbMath0754.00011MaRDI QIDQ1202177

No author found.

Publication date: 23 January 1993

Published in: Lecture Notes in Statistics (Search for Journal in Brave)


62-06: Proceedings, conferences, collections, etc. pertaining to statistics

00B25: Proceedings of conferences of miscellaneous specific interest

60-06: Proceedings, conferences, collections, etc. pertaining to probability theory


Related Items

Unnamed Item, A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach, A generative model for rank data based on insertion sort algorithm, Modeling heterogeneity in ranked responses by nonparametric maximum likelihood: How do Europeans get their scientific knowledge?, Mixtures of weighted distance-based models for ranking data with applications in political studies, On L-decomposability of random orderings, A mixture model for preferences data analysis, What do we know about the Metropolis algorithm?, Ranked set sampling, coherent rankings and size-biased permutations, Presorting algorithms: an average-case point of view, On the comparison of the Spearman and Kendall metrics between linear orders., Limit theorems for longest monotone subsequences in random Mallows permutations, Sampling and learning Mallows and generalized Mallows models under the Cayley distance, Leading the field: fortune favors the bold in Thurstonian choice models, A general concept of majority rule, Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron, A parametric procedure for ultrametric tree estimation from conditional rank order proximity data, On the estimation of latent distances using graph distances, Estimating the number of clusters in a ranking data context, Worst-case versus average-case design for estimation from partial pairwise comparisons, Adjacency-based regularization for partially ranked data with non-ignorable missing, The limit of the empirical measure of the product of two independent Mallows permutations, Detecting the end of agreement between two long ranked lists, On adding a list of numbers (and other one-dependent determinantal processes)