Publication | Closed Access
Consequences of the Condorcet Jury Theorem for Beneficial Information Aggregation by Rational Agents
239
Citations
24
References
1998
Year
Rational AgentsEngineeringComputational Social ChoiceGame TheoryLawCommon Interest GamesCollective ChoiceAlgorithmic Mechanism DesignCondorcet Jury TheoremDecision TheoryMechanism DesignVoting RuleProbability TheoryComputer ScienceMulti-agent Mechanism DesignGamesPreference AggregationBeneficial Information AggregationAutomated ReasoningNash EquilibriaBusinessIncorrect DecisionPolitical ScienceAlgorithmic Game Theory
“Naïve” Condorcet Jury Theorems automatically have “sophisticated” versions as corollaries. A Condorcet Jury Theorem is a result, pertaining to an election in which the agents have common preferences but diverse information, asserting that the outcome is better, on average, than the one that would be chosen by any particular individual. Sometimes there is the additional assertion that, as the population grows, the probability of an incorrect decision goes to zero. As a consequence of simple properties of common interest games, whenever “sincere” voting leads to the conclusions of the theorem, there are Nash equilibria with these properties. In symmetric environments the equilibria may be taken to be symmetric.
| Year | Citations | |
|---|---|---|
Page 1
Page 1