AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
none listed
Built on 2
Used by 6

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
See it in the graphDiscuss this resultChallenge it