Eliciting Thinking Hierarchy without a Prior
Yuqing Kong, Yunqi Li, Yubo Zhang, Zhihuan Huang, Jinzhao Wu
Abstract
When we use the wisdom of the crowds, we usually rank the answers according to their popularity, especially when we cannot verify the answers. However, this can be very dangerous when the majority make systematic mistakes. A fundamental question arises: can we build a hierarchy among the answers without any prior where the higher-ranking answers, which may not be supported by the majority, are from more sophisticated people? To address the question, we propose 1) a novel model to describe people's thinking hierarchy; 2) two algorithms to learn the thinking hierarchy without any prior; 3) a novel open-response based crowdsourcing approach based on the above theoretic framework. In addition to theoretic justifications, we conduct four empirical crowdsourcing studies and show that a) the accuracy of the top-ranking answers learned by our approach is much higher than that of plurality voting (In one question, the plurality answer is supported by 74 respondents but the correct answer is only supported by 3 respondents. Our approach ranks the correct answer the highest without any prior); b) our model has a high goodness-of-fit, especially for the questions where our top-ranking answer is correct. To the best of our knowledge, we are the first to propose a thinking hierarchy model with empirical validations in the general problem-solving scenarios; and the first to propose a practical open-response based crowdsourcing approach that beats plurality voting without any prior. * corresponding author 1 Interested readers are referred to https://math.stackexchange.com/questions/1351058/ circle-revolutions-rolling-around-another-circle for explanations.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 986688b1-90d1-4a00-b151-96813892b07dCited by top-tier papers5
- Encouraging Divergent Thinking in Large Language Models through Multi-Agent DebateTian Liang, Zhiwei He, Wenxiang Jiao, Xing Wang et al.EMNLP 2024 · 177 citations
- Beyond Majority Voting: LLM Aggregation by Leveraging Higher-Order InformationRui Ai, Yuqi Pan, David Simchi-Levi, Milind Tambe et al.ICML 2026 · 20 citations
- Robust Decision Aggregation with Second-order InformationYuqi Pan, Zhaohua Chen, Yuqing KongWWW 2024 · 9 citations
- Spot Check Equivalence: An Interpretable Metric for Information Elicitation MechanismsShengwei Xu, Yichi Zhang, Paul Resnick, Grant SchoenebeckWWW 2024 · 7 citations
- BIPro: Zero-shot Chinese Poem Generation via Block Inverse Prompting Constrained Generation FrameworkXu ZouACL 2025
Builds on2
Related papers
- Hierarchical Crowdsourcing for Data Labeling with Heterogeneous CrowdHaodi Zhang, Wenxi Huang, Zhenhan Su, Junyang Chen et al.ICDE 2023 · 4 citations
- Origins of Algorithmic Instabilities in Crowdsourced RankingKeith Burghardt, Tad Hogg, Raissa M. D'Souza, Kristina Lerman et al.CSCW 2020 · 4 citations
- Surprisingly Popular Voting with Concentric Rank-Order ModelsHadi Hosseini, Debmalya Mandal, Amrit PuhanWWW 2025
- The Surprising Effectiveness of SP Voting with Partial PreferencesHadi Hosseini, Debmalya Mandal, Amrit PuhanNeurIPS 2024 · 5 citations
- Efficient Algorithms for Crowd-Aided CategorizationYuanbing Li, Xian Wu, Yifei Jin, Jian Li et al.VLDB 2020 · 13 citations
