Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal Decision Mechanisms for Committees: Acquitting the Guilty (2407.07293v1)

Published 10 Jul 2024 in econ.TH

Abstract: A group of privately informed agents chooses between two alternatives. How should the decision rule be designed if agents are known to be biased in favor of one of the options? We address this question by considering the Condorcet Jury Setting as a mechanism design problem. Applications include the optimal decision mechanisms for boards of directors, political committees, and trial juries. While we allow for any kind of mechanism, the optimal mechanism is a voting mechanism. In the terminology of the trial jury example: When jurors (agents) are more eager to convict than the lawmaker (principal), then the defendant should be convicted if and only if neither too many nor too few jurors vote to convict. This kind of mechanism accords with a judicial procedure from ancient Jewish law.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com