Optimizing Voting Order on Sequential Juries: A Median Voter Theorem and Beyond --- A Supplement
Author
Bo Chen
Title
Optimizing Voting Order on Sequential Juries: A Median Voter Theorem and Beyond --- A Supplement
Description
This notebook provides all the algebraic calculations and proofs Mathematica has helped with for the research paper titled "Optimizing Voting Order on Sequential Juries: A Median Voter Theorem and Beyond" authored by Steve Alpern and Bo Chen, which is to appear in the journal "Social Choice and Welfare".
Category
Academic Articles & Supplements
Keywords
voting, Condorcet, verdict reliability
URL
http://www.notebookarchive.org/2021-10-2bfb5et/
DOI
https://notebookarchive.org/2021-10-2bfb5et
Date Added
2021-10-05
Date Last Modified
2021-10-05
File Size
170.64 kilobytes
Supplements
Rights
Redistribution rights reserved
Download
Open in Wolfram Cloud
This notebook provides all the algebraic calculations and proofs Mathematica has helped with for the research paper by Steve Alpern and Bo Chen titled “Optimizing voting order on sequential juries: a median voter theorem and beyond” Social Choice and Welfare (2021) , available at https://doi.org/10.1007/s00355-021-01370-7.
Optimizing Voting Order on Sequential Juries: A Median Voter Theorem and Beyond—A Supplement
Optimizing Voting Order on Sequential Juries: A Median Voter Theorem and Beyond—A Supplement
Bo Chen
1. Definitions of voting functions
1. Definitions of voting functions
1.1. Definition of distribution functions and one-step threshold
1.1. Definition of distribution functions and one-step threshold
1.2. Thresholds and reliability of honest majority verdict
1.2. Thresholds and reliability of honest majority verdict
1.3. Threshold and reliability of unanimous verdict
1.3. Threshold and reliability of unanimous verdict
1.4. Reliability function of sequential strategic voting
1.4. Reliability function of sequential strategic voting
1.5. Reliability function of simultaneous honest voting
1.5. Reliability function of simultaneous honest voting
2. Other algebraic calculations
2. Other algebraic calculations
2.1. Order of the first two voters
2.1. Order of the first two voters
2.2. Order of the two end-voters
2.2. Order of the two end-voters
2.3. Sequential versus simultaneous majority voting
2.3. Sequential versus simultaneous majority voting
2.4. Reliability versus heterogeneity and homogeneity
2.4. Reliability versus heterogeneity and homogeneity
2.5. Strategic optimality versus heterogeneity and homogeneity
2.5. Strategic optimality versus heterogeneity and homogeneity
3. Algebraic proofs
3. Algebraic proofs
3.1: Q(θ;c,b)-Q(θ;b,c)>=0 s.t. 0<=b<c<=1.
3.1: (θ;c,b)-(θ;b,c)>=0 s.t. .
Q
Q
0<=b<c<=1
3.2: f1(a,b,c)>0 s.t. 0<=a,b,c<=1 and ρ(b,a)<c<=ρ(a,b) and b/2<a<b.
3.2: (a,b,c)>0 s.t. and and .
f
1
0<=a,b,c<=1
ρ(b,a)<c<=ρ(a,b)
b/2<a<b
3.3: f3(a,b,c)>0 s.t. 0<=a,b,c<=1 and c>ρ(a,b) and b/2<a<b.
3.3: (a,b,c)>0 s.t. and and .
f
3
0<=a,b,c<=1
c>ρ(a,b)
b/2<a<b
3.4: Δ2(a,b,c)>0 s.t. 0<=a,b<=1 and a/2<c<=b/2.
3.4: (a,b,c)>0 s.t. and .
Δ
2
0<=a,b<=1
a/2<c<=b/2
3.5: f4(a,b,c)>0 s.t. 0<=a<b<=1 and a<=ρ(b,c) and b>ρ(a,c) and b/2<c<=1.
3.5: (a,b,c)>0 s.t. and and and .
f
4
0<=a<b<=1
a<=ρ(b,c)
b>ρ(a,c)
b/2<c<=1
3.6: f5(a,b,c)>0 s.t. 0<=a<b<=1 and a>ρ(b,c) and b>ρ(a,c) and b/2<c<=1.
3.6: (a,b,c)>0 s.t. and and and .
f
5
0<=a<b<=1
a>ρ(b,c)
b>ρ(a,c)
b/2<c<=1
3.7: Monotonicity of Q(a,b,c)
3.7: Monotonicity of
Q(a,b,c)
3.8: h1(a,b,c)>0 s.t. λ(a,b,c)>=6/7.
3.8: (a,b,c)>0 s.t. .
h
1
λ(a,b,c)>=6/7
3.9: -h1(a,b,c)>0 and h2(a,b,c)>0 s.t. μ(a,b,c)>=4/3.
3.9: and (a,b,c)>0 s.t. .
-(a,b,c)>0
h
1
h
2
μ(a,b,c)>=4/3
3.10: Function w(m,μ) is strictly increasing over {μ>=1:w(m,μ)>=0}; so are functions Q1(m,μ) and Q2(m,μ) over {μ:μ>=1}.
3.10: Function is strictly increasing over so are functions (m,μ) and (m,μ) over .
w(m,μ)
{μ>=1:w(m,μ)>=0};
Q
1
Q
2
{μ:μ>=1}
3.11: Ω(b,c,0,y1,y2,z1,z2)>=0 s.t. μ>=7/4 and -1<=y1,y2,z1,z2<=1.
3.11: s.t. and .
Ω(b,c,0,,,,)>=0
y
1
y
2
z
1
z
2
μ>=7/4
-1<=,,,<=1
y
1
y
2
z
1
z
2
3.12: Qsim(1/2,a,a,a)>=Qstr(1/2,a,a,a,0,y1,y2,z1,z2)>=0 s.t. -1<=y1,y2,z1,z2<=1 and 0<=a<=1.
3.12: (1/2,a,a,a)>=(1/2,a,a,a,0,,,,)>=0 s.t. and .
Q
sim
Q
str
y
1
y
2
z
1
z
2
-1<=,,,<=1
y
1
y
2
z
1
z
2
0<=a<=1
Cite this as: Bo Chen, "Optimizing Voting Order on Sequential Juries: A Median Voter Theorem and Beyond --- A Supplement" from the Notebook Archive (2021), https://notebookarchive.org/2021-10-2bfb5et
Download