The repeated insertion model for rankings: missing link between two subset choice models
From MaRDI portal
Publication:2259977
Recommendations
Cites work
- A discrete choice model when context matters
- A nonparametric multiple choice method within the random utility framework
- A random utility model for approval voting
- A representation theorem for finite random scale systems
- An approval-voting polytope for linear orders
- Falmagne and the Rationalizability of Stochastic Choices in Terms of Random Orderings
- scientific article; zbMATH DE number 3156726 (Why is no real title available?)
- scientific article; zbMATH DE number 177211 (Why is no real title available?)
- scientific article; zbMATH DE number 177222 (Why is no real title available?)
- scientific article; zbMATH DE number 847276 (Why is no real title available?)
- Maximum likelihood estimation of a binary choice model with random coefficients of unknown distribution
- Modeling within-subject dependencies in ordinal paired comparison data
- Multistage Ranking Models
- NON-NULL RANKING MODELS. I
- Nonparametric two-stage estimation of conditional choice probabilities in a binary choice model under uncertainty
- On the combinatorial structure of the approval-voting polytope
- Optimal product positioning based on paired comparison data
- Probability models on rankings
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- Remarks on the identifiability of Thurstonian ranking models: Case V, Case III, or neither?
- Semiparametric qualitative response model estimation with unknown heteroscedasticity or instrumental variables
- Signed orders, choice probabilities, and linear polytopes
- The choice probabilities of the latent-scale model satisfy the size-independent model when \(n\) is small.
- The facets and the symmetries of the approval-voting polytope
Cited in
(17)- The choice probabilities of the latent-scale model satisfy the size-independent model when \(n\) is small.
- Learning mixtures of permutations: groups of pairwise comparisons and combinatorial method of moments
- A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
- Computer science and decision theory
- Choosing subsets: a size-independent probabilistic model and the quest for a social welfare ordering
- Social order statistics models for ranking data with analysis of preferences in social networks
- Probabilistic abductive logic programming using Dirichlet priors
- Probabilistic preference learning with the Mallows rank model
- Mallows-smoothed distribution over rankings approach for modeling choice
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
- A characterization of the existence of succinct linear representation of subset-valuations
- An axiomatic distance methodology for aggregating multimodal evaluations
- Analysis of ranking data
- A phase transition in Arrow's theorem with three alternatives
- Approximate maximum rank aggregation: beyond the worst-case
- Consensus formation from heterogeneous rankings based on minimum variance
- On L-decomposability of random orderings
This page was built for publication: The repeated insertion model for rankings: missing link between two subset choice models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259977)
