Optimizing voting order on sequential juries: a median voter theorem and beyond

Author:

Alpern Steve,Chen BoORCID

Abstract

AbstractWe consider an odd-sized “jury”, which votes sequentially between two equiprobable states of Nature (say A and B, or Innocent and Guilty), with the majority opinion determining the verdict. Jurors have private information in the form of a signal in $$[-1,+1]$$ [ - 1 , + 1 ] , with higher signals indicating A more likely. Each juror has an ability in [0, 1], which is proportional to the probability of A given a positive signal, an analog of Condorcet’s p for binary signals. We assume that jurors vote honestly for the alternative they view more likely, given their signal and prior voting, because they are experts who want to enhance their reputation (after their vote and actual state of Nature is revealed). For a fixed set of jury abilities, the reliability of the verdict depends on the voting order. For a jury of size three, the optimal ordering is always as follows: middle ability first, then highest ability, then lowest. For sufficiently heterogeneous juries, sequential voting is more reliable than simultaneous voting and is in fact optimal (allowing for non-honest voting). When average ability is fixed, verdict reliability is increasing in heterogeneity. For medium-sized juries, we find through simulation that the median ability juror should still vote first and the remaining ones should have increasing and then decreasing abilities.

Publisher

Springer Science and Business Media LLC

Subject

Economics and Econometrics,Social Sciences (miscellaneous)

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. New Perspectives on May’s Theorem and the Median Voter Theorem;Financial Markets, Institutions and Risks;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3