Bayesian decision process for cost-efficient dynamic ranking via crowdsourcing

MaRDI QIDQ2953642zbMATH OpenFDO

Authors Xi Chen, Kevin Jiao, Qihang Lin

Publication date 5 January 2017

Full work available at URL https://arxiv.org/abs/1612.07222, http://jmlr.csail.mit.edu/papers/v17/16-066.html

zbMATH Keywords

Bayesiancrowdsourced rankingdynamic programmingknowledge gradientMarkov decision processmoment matching

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling
• Stagewise learning for noisy \(k\)-ary preferences
• Rank Centrality: Ranking from Pairwise Comparisons
• Analysis of crowdsourced sampling strategies for HodgeRank with sparse random graphs
• Top-\(\kappa\) selection with pairwise comparisons

Cited in

(6)

• Stagewise learning for noisy \(k\)-ary preferences
• Stochastic multichannel ranking with brain dynamics preferences
• Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling
• Asymptotically Optimal Sequential Design for Rank Aggregation
• Approximating the crowd
• Analysis of crowdsourced sampling strategies for HodgeRank with sparse random graphs

Describes a project that uses

Uses Software

• trueskill
• TrueSkill

This page was built for publication: Bayesian decision process for cost-efficient dynamic ranking via crowdsourcing

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