Subtopic Deep Dive

Judgment Aggregation Procedures
Research Guide

What is Judgment Aggregation Procedures?

Judgment aggregation procedures aggregate individual binary judgments on logically interconnected propositions into collective judgments while respecting consistency and fairness.

Research addresses paradoxes like the discursive dilemma where majority aggregation violates collective rationality (List and Pettit, 2002). Key models include premise-based and conclusion-based procedures. Over 500 papers explore impossibility theorems and strategy-proof mechanisms since foundational works.

Curated Papers

Key Challenges

Why It Matters

Judgment aggregation procedures improve committee decision-making in legal juries and policy boards by resolving discursive dilemmas. Applied in AI governance for aligning collective AI ethics judgments with individual expert views (Friedman and Nissenbaum, 1996). Enables fair aggregation in multi-agent systems, as analyzed in social choice impossibilities (Sen, 1999). Supports Condorcet-consistent voting extensions (Young, 1988).

Key Research Challenges

Discursive Dilemma Paradox

Majority rule on premises yields collectively inconsistent conclusions despite individual consistency. List and Pettit formalized this paradox, showing tension between consistency and independence. Grofman et al. (1983) link it to thirteen voting theorems.

Impossibility Theorems

No procedure satisfies independence, consistency, and neutrality simultaneously (Sen, 1999). Dokow and Holzman extended Arrow's theorem to judgment aggregation. Challenges strategy-proofness under incomplete information.

Strategy-Proof Mechanisms

Individuals manipulate judgments to influence outcomes, akin to Gibbard-Satterthwaite. Feddersen (2004) connects to voting paradoxes. Developing incentive-compatible rules remains open.

Essential Papers

Bias in computer systems

Batya Friedman, Helen Nissenbaum · 1996 · ACM Transactions on Information Systems · 1.1K citations

From an analysis of actual cases, three categories of bias in computer systems have been developed: preexisting, technical, and emergent. Preexisting bias has its roots in social institutions, prac...

Anomalies: The Ultimatum Game

Richard H. Thaler · 1988 · The Journal of Economic Perspectives · 812 citations

This paper discusses simple ultimatum games, two-stage bargaining ultimatum games, and multistage ultimatum games. Finally, I discuss ultimatums in the market. Any time a monopolist (or monopsonist...

Condorcet's Theory of Voting

H. P. Young · 1988 · American Political Science Review · 755 citations

Condcrcet's criterion states that an alternative that defeats every other by a simple majority is the socially optimal choice. Condorcet argued that if the object of voting is to determine the “bes...

The Possibility of Social Choice

Amartya Sen · 1999 · American Economic Review · 752 citations

The subject of social choice includes within its capacious frame various problems with the common feature of relating social judgments and group decisions to the views and interests of the individu...

The Social Cost of Cheap Pseudonyms

Eric J. Friedman, Paul Resnick · 2001 · Journal of Economics & Management Strategy · 543 citations

We consider the problems of societal norms for cooperation and reputation when it is possible to obtain cheap pseudonyms, something that is becoming quite common in a wide variety of interactions o...

Iterated Dominance and Iterated Best-Response in Experimental P-Beauty Contests

Teck‐Hua Ho, Colin F. Camerer, Keith Weigelt · 1996 · The Caltech Institute Archives (California Institute of Technology) · 488 citations

We study a dominance-solvable 'p-beauty contest' game in which a group of players simultaneously choose numbers from a closed interval. The winner is the player whose number is the closest top time...

Thirteen theorems in search of the truth

Bernard Grofman, Guillermo Owen, Scott L. Feld · 1983 · Theory and Decision · 470 citations

Reading Guide

Foundational Papers

Start with Sen (1999) 'The Possibility of Social Choice' for impossibility foundations, Young (1988) 'Condorcet's Theory of Voting' for majority rule extensions, Grofman et al. (1983) 'Thirteen theorems' for paradox catalog.

Recent Advances

Feddersen (2004) 'Paradox of Not Voting' for strategic manipulation, Friedman and Resnick (2001) for reputation in pseudonymous aggregation applicable to online judgments.

Core Methods

Majority rule, premise-independence, universal domain, consistency properties. Impossibility via Arrow-style theorems. Randomized dictatorship for strategy-proofness.

How PapersFlow Helps You Research Judgment Aggregation Procedures

Discover & Search

Research Agent uses searchPapers for 'judgment aggregation discursive dilemma' retrieving 200+ papers including List-Pettit foundations, citationGraph on Sen (1999) revealing 752 downstream works, findSimilarPapers on Grofman et al. (1983) surfacing thirteen theorems extensions, and exaSearch for 'strategy-proof judgment aggregation' uncovering niche impossibility results.

Analyze & Verify

Analysis Agent applies readPaperContent to extract discursive dilemma formalizations from Young (1988), verifyResponse with CoVe chain-of-verification cross-checks impossibility claims against Sen (1999), runPythonAnalysis simulates majority aggregation paradoxes with NumPy/pandas on synthetic judgment profiles, and GRADE grading scores procedure efficiency with statistical verification of Condorcet consistency.

Synthesize & Write

Synthesis Agent detects gaps in strategy-proof mechanisms via contradiction flagging across Feddersen (2004) and Grofman papers, Writing Agent uses latexEditText for theorem proofs, latexSyncCitations integrates 50+ references, latexCompile generates polished reports, and exportMermaid diagrams judgment aggregation flowcharts.

Use Cases

"Simulate discursive dilemma with 5 voters on 3 propositions"

Research Agent → searchPapers 'discursive dilemma' → Analysis Agent → runPythonAnalysis (NumPy voter matrix, majority aggregation, consistency check) → outputs paradox visualization and failure rates.

"Draft LaTeX review of judgment aggregation impossibilities"

Research Agent → citationGraph Sen (1999) → Synthesis → gap detection → Writing Agent → latexEditText (structure theorems) → latexSyncCitations (50 papers) → latexCompile → outputs camera-ready PDF with proofs.

"Find code for judgment aggregation algorithms"

Research Agent → exaSearch 'judgment aggregation code' → Code Discovery → paperExtractUrls → paperFindGithubRepo → githubRepoInspect → outputs verified GitHub repos with strategy-proof simulators.

Automated Workflows

Deep Research workflow conducts systematic review: searchPapers (250+ hits) → citationGraph clustering → DeepScan 7-step analysis with CoVe checkpoints verifies Sen-style impossibilities → structured report with GRADE scores. Theorizer generates new aggregation axioms from Grofman et al. (1983) theorems via literature synthesis. DeepScan flags strategy inconsistencies in Feddersen (2004) voter models.

Try Doxa for Judgment Aggregation Procedures Research

Frequently Asked Questions

What is judgment aggregation?

Aggregation of individual binary judgments on propositions into collective outputs preserving rationality. Differs from preference aggregation by handling logical constraints.

What are main methods?

Premise-based (aggregate atoms, derive conclusions), conclusion-based (direct majority on conclusions), and hybrid rules. Strategy-proof variants use random dictatorships.

What are key papers?

Sen (1999) on social choice possibilities (752 citations), Young (1988) on Condorcet voting (755 citations), Grofman et al. (1983) thirteen theorems (470 citations).