Inferring Sparse Preference Lists from Partial Information

DOI10.1287/STSY.2019.0060MaRDI QIDQ5141707zbMATH OpenOpenAlexFDO

Authors Vivek Farias, Srikanth Jagabathula, Devavrat Shah

Publication date 18 December 2020

Published in Stochastic Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1287/stsy.2019.0060

zbMATH Keywords

compressive sensingnonparametric modelsrankingssparse

Mathematics Subject Classification ID

Missing data (62D10) Nonparametric estimation (62G05) Applications of statistics to psychology (62P15) Measures of information, entropy (94A17)

Recommendations

• Preference inference based on lexicographic models
• Recovering preferences from finite data
• scientific article; zbMATH DE number 2018601
• Preference aggregation with incomplete information
• Deriving rankings from incomplete preference information: a comparison of different approaches
• Preference elicitation and query learning
• Preference programming with incomplete ordinal information
• Preference Learning and Ranking by Pairwise Comparison

Cites work

• A generalization of spectral analysis with application to ranked data
• Combinatorial Algorithms for Compressed Sensing
• Compressed sensing
• Decoding by Linear Programming
• Expander codes
• Exponential models for directional data
• Exponential Models, Maximum Likelihood Estimation, and the Haar Condition
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Graphical models, exponential families, and variational inference
• Greed is Good: Algorithmic Results for Sparse Approximation
• scientific article; zbMATH DE number 3152611 (Why is no real title available?)
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 5485456 (Why is no real title available?)
• scientific article; zbMATH DE number 3965301 (Why is no real title available?)
• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• scientific article; zbMATH DE number 847276 (Why is no real title available?)
• scientific article; zbMATH DE number 3399008 (Why is no real title available?)
• scientific article; zbMATH DE number 3078983 (Why is no real title available?)
• scientific article; zbMATH DE number 3095897 (Why is no real title available?)
• Improved low-density parity-check codes using irregular graphs
• Inferring Rankings Using Constrained Sensing
• Just relax: convex programming methods for identifying sparse signals in noise
• On Distributions Admitting a Sufficient Statistic
• On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
• Paradoxes of Preferential Voting
• Polynomial Codes Over Certain Finite Fields
• Quantitative robust uncertainty principles and optimally sparse decompositions
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Semiparametric estimation of a work-trip mode choice model
• Stable signal recovery from incomplete and inaccurate measurements
• The multiplicative weights update method: a meta-algorithm and applications
• The relationship between Luce's choice axiom, Thurstone's theory of comparative judgment, and the double exponential distribution

Cited in

(4)

• Uncovering the riffled independence structure of ranked data
• Riffled independence for efficient inference with partial rankings
• Non-parametric modeling of partially ranked data
• Recognizing when a preference system is close to admitting a master list

This page was built for publication: Inferring Sparse Preference Lists from Partial Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5141707)