Eliciting Thinking Hierarchy without a Prior
Not on the map. Why?
Abstract (arXiv)
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 textitwithout 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.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Sep 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 3; 2025: 1.
7 papers.
- 2023Encouraging Divergent Thinking in Large Language Models through Multi-Agent Debatecited by 995
- 2025Beyond Majority Voting: LLM Aggregation by Leveraging Higher-Order Informationcited by 25
- 2024Eliciting Informative Text Evaluations with Large Language Modelscited by 14
- 2023Robust Decision Aggregation with Second-order Informationcited by 7
- 2024Spot Check Equivalence: an Interpretable Metric for Information Elicitation Mechanismscited by 4
- 2022Sample Complexity of Forecast Aggregationcited by 0
- 2024BIPro: Zero-shot Chinese Poem Generation via Block Inverse Prompting Constrained Generation Frameworkcited by 0
- 2025Beyond Majority Voting: LLM Aggregation by Leveraging Higher-Order Information1 Oct 2025
- 2024BIPro: Zero-shot Chinese Poem Generation via Block Inverse Prompting Constrained Generation Framework20 Nov 2024
- 2024Eliciting Informative Text Evaluations with Large Language Models23 May 2024
- 2024Spot Check Equivalence: an Interpretable Metric for Information Elicitation Mechanisms21 Feb 2024
- 2023Robust Decision Aggregation with Second-order Information23 Nov 2023
- 2023Encouraging Divergent Thinking in Large Language Models through Multi-Agent Debate30 May 2023
- 2022Sample Complexity of Forecast Aggregation26 Jul 2022