p. 161 — Bill and Jack: the Nash product is maximized at the vertex (12, 5), reached by one exchange
ProvedNashBargainingProblem.Axiomatic.bill_jack_solutionbargainingexamplenash-bargaining-solutionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
In Nash's Bill–Jack barter (goods, additive utilities, exchange gains and the set of alternatives as in the definition BillJack):
- , and it is the strict maximizer of the product of the utility gains over in the closed first quadrant: every with and has ;
- is an extreme point (a vertex) of the polygon ;
- exactly one exchange has gain : if and only if Bill gives Jack and Jack gives Bill .
This is the solution Nash reports for the example: Bill gains and Jack gains .
Formalization Note "There is but one corresponding anticipation" is read for pure exchanges: a lottery over exchanges whose expected gain is a vertex of the hull is degenerate. "A convex polygon" is not stated separately, since the convex hull of finitely many points is one.
Preamble
import Mathlib import Definitions.Def_NashBargainingProblem_Axiomatic_BillJack
Formal statement
namespace NashBargainingProblem.Axiomatic
theorem bill_jack_solution :
((12 : ℝ), (5 : ℝ)) ∈ billJackSet ∧
(∀ s ∈ billJackSet, 0 ≤ s.1 → 0 ≤ s.2 → s ≠ ((12 : ℝ), (5 : ℝ)) →
s.1 * s.2 < 12 * 5) ∧
((12 : ℝ), (5 : ℝ)) ∈ billJackSet.extremePoints ℝ ∧
∀ (X : Finset BillGood) (Y : Finset JackGood),
billJackGain (X, Y) = ((12 : ℝ), (5 : ℝ)) ↔
X = {BillGood.book, BillGood.whip, BillGood.ball, BillGood.bat} ∧
Y = {JackGood.pen, JackGood.toy, JackGood.knife} := by sorry
end NashBargainingProblem.Axiomatic
Source
Nash, The Bargaining Problem, Econometrica 18 (1950), p. 161, Examples ("It turns out to be a convex polygon in which the point where the product of the utility gains is maximized is at a vertex and where there is but one corresponding anticipation."), Figure 2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.