AFTD Auto-Formalizing Theoretical Domains

is_single_high_profile

def

A valuation profile of n agents on m goods is a single-high profile with ratio R if every agent has a single-high valuation with ratio R.

Statement

def is_single_high_profile {n m : ℕ} (R : ℝ) (v : Fin n → Fin m → ℝ) : Prop
Defined in
arXiv:2610.34625, Sec. 4
Verified
02 Nov 2026
Axioms
none listed
Built on 1
  • is_single_high_valuationAn agent's additive valuation vector on m goods is a single-high valuation with ratio R if there exists a good of value R such that all…
Used by 3
  • op819_has_online_single_high_alpha_monoIf a deterministic online algorithm guarantees a beta-EFX allocation for n agents and m goods under single-high valuations with ratio R >=…
  • op819_single_high_efx_one_goodFor any number of agents $n \ge 1$, $m = 1$ good, and parameter $R \ge 0$, there exists a deterministic online algorithm that achieves a…
  • has_online_single_high_alpha_efxThere exists a deterministic online allocation algorithm for n agents and m goods that guarantees an alpha-EFX allocation for every…

Read back from the Lean

For given natural numbers n and m, a real parameter R, and a valuation profile v : Fin n → Fin m → ℝ, is_single_high_profile R v asserts that for every agent i : Fin n, the valuation v i is a single-high valuation with parameter R (i.e., satisfies is_single_high_valuation R (v i)).

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

/-- A valuation profile of n agents on m goods is a single-high profile with ratio R if every agent has a single-high valuation with ratio R. -/
def is_single_high_profile {n m : ℕ} (R : ℝ) (v : Fin n → Fin m → ℝ) : Prop := ∀ i : Fin n, is_single_high_valuation R (v i)
See it in the graphDiscuss this resultChallenge it