Section 6, p. 1503 — in the example the maximal total product is 11½, attained exactly at j ← {1}, k ← {2, 3} and j ← {1, 2}, k ← {3}
ProvedKelsoCrawford.NoCore.example_efficient_assignmentscorecounterexamplematchingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
In the market of the example of Section 6, every assignment of the three workers to the firms has total product at most :
and equality holds if and only if either is assigned to firm and to firm , or is assigned to firm and to firm .
Together with the efficiency of core allocations, this reduces the search for a core allocation of the example to these two assignments.
Formalization Note Workers are 0, 1, 2 and firms are 0, 1; an assignment is any function from workers to firms (every worker is employed).
Preamble
import Mathlib import Definitions.Def_KelsoCrawford_NoCore_Model import Definitions.Def_KelsoCrawford_NoCore_Notions import Definitions.Def_KelsoCrawford_NoCore_Example
Formal statement
namespace KelsoCrawford.NoCore
theorem example_efficient_assignments :
(∀ g : Fin 3 → Fin 2, noCoreMarket.totalProduct g ≤ 23 / 2) ∧
(∀ g : Fin 3 → Fin 2, noCoreMarket.totalProduct g = 23 / 2 ↔
(assignedTo g 0 = {0} ∧ assignedTo g 1 = {1, 2}) ∨
(assignedTo g 0 = {0, 1} ∧ assignedTo g 1 = {2})) := by sorry
end KelsoCrawford.NoCore
Source
Kelso and Crawford, Job matching, coalition formation, and gross substitutes, Econometrica 50 (1982), p. 1503, Section 6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.