SocialChoice.FairDivision.Divisible.cutAndChooseAlloc
defimported Lean
The cut-and-choose allocation at cut point t ∈ [0,1]. The chooser (agent 1) receives the half they value more: - If μ 1 (Iic t) ≥ μ 1 (Ioi t), agent 1 takes [0, t]; agent 0 gets (t, 1]. - Otherwise, agent 1 takes (t, 1]; agent 0 gets [0, t]. The allocation is noncomputable because measures are noncomputable.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in open scoped unitInterval in noncomputable def SocialChoice.FairDivision.Divisible.cutAndChooseAlloc (μ : Fin 2 → Measure I) (t : I) : Allocation (Fin 2) I
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Divisible.cutAndChooseAlloc`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.SocialChoice.FairDivision.Divisible.cutAndChooseAlloc← SocialChoice.FairDivision.Divisible.cutAndChooseAlloc (EconCSLib/SocialChoice/FairDivision/Divisible/CutAndChoose.lean:71): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- SocialChoice.FairDivision.utilitarianWelfare_uniqueFor a unique agent, utilitarian welfare is just that agent's utility.
- SocialChoice.FairDivision.Divisible.AllocationA divisible allocation assigns each agent
i : Na piece (a measurable subset) of the cakeΩ.
- Used by 6
- SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_zeroCutter (agent 0) receives the right piece when the chooser prefers left, and the left piece otherwise.
- SocialChoice.FairDivision.Divisible.cutter_isEnvyFree_of_fairThe cutter (agent 0) does not envy the chooser at a fair cut. If the cut point
tsatisfiesIsFairCutPoint μ t, then agent 0 values… - SocialChoice.FairDivision.Divisible.cutAndChoose_isEnvyFreeBoth agents are envy-free at any fair cut point. This combines
chooser_isEnvyFree(unconditional) andcutter_isEnvyFree_of_fair… - SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_isAllocationFor any cut point
t, the cut-and-choose allocation is a complete measurable partition of[0,1]into two pieces. This holds regardless… - SocialChoice.FairDivision.Divisible.chooser_isEnvyFreeThe chooser (agent 1) never envies the cutter, regardless of the cut point. Since agent 1 selects whichever piece they value more,…
- SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_oneChooser (agent 1) receives the left piece if they prefer it, the right piece otherwise.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in open scoped unitInterval in /-- The cut-and-choose allocation at cut point `t ∈ [0,1]`. The chooser (agent 1) receives the half they value more: - If `μ 1 (Iic t) ≥ μ 1 (Ioi t)`, agent 1 takes `[0, t]`; agent 0 gets `(t, 1]`. - Otherwise, agent 1 takes `(t, 1]`; agent 0 gets `[0, t]`. The allocation is noncomputable because measures are noncomputable. -/ noncomputable def SocialChoice.FairDivision.Divisible.cutAndChooseAlloc (μ : Fin 2 → Measure I) (t : I) : Allocation (Fin 2) I := fun i => if μ 1 (Iic t) ≥ μ 1 (Ioi t) then -- chooser takes left, cutter takes right if i = 0 then Ioi t else Iic t else -- chooser takes right, cutter takes left if i = 0 then Iic t else Ioi t