AFTD Auto-Formalizing Theoretical Domains

two_thirds_convex_max_noncore_fraction

def

For each n, two_thirds_convex_max_noncore_fraction n is the supremum over all 2/3-convex cooperative games v on Fin n with v(∅) = 0 of the fraction of player orderings whose marginal worth vector lies outside the core.

Statement

noncomputable def two_thirds_convex_max_noncore_fraction (n : ℕ) : ℝ
Defined in
OP-1671
Verified
14 Nov 2026
Axioms
none listed
Built on 2
  • is_two_thirds_convexA cooperative game v : Finset α → ℝ is 2/3-convex if for every three distinct coalitions S₁, S₂, S₃, at least two of the three pairs…
  • noncore_ordering_fractionFor a cooperative game v : Finset α → ℝ on a finite type α with decidable equality, noncore_ordering_fraction v is the fraction of player…

Read back from the Lean

two_thirds_convex_max_noncore_fraction n defines the supremum (in ℝ) of the fraction of player orderings whose marginal vector fails to be in the core of v, taken over all cooperative games v : Finset (Fin n) → ℝ that are normalized (v ∅ = 0) and "2/3-convex" (for every three pairwise distinct coalitions, at least two pairs satisfy the supermodularity inequality).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The supremum over all 2/3-convex TU games on Fin n vanishing at ∅ of the fraction of orderings outside the core. -/
noncomputable def two_thirds_convex_max_noncore_fraction (n : ℕ) : ℝ := sSup { noncore_ordering_fraction v | (v : Finset (Fin n) → ℝ) (_ : v ∅ = 0) (_ : is_two_thirds_convex v) }
See it in the graphDiscuss this resultChallenge it