Online.IsCompetitiveMin
defimported Lean
c-competitive for a minimisation objective: the algorithm's value on every request sequence is at most c · opt.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α F : Type*} in def Online.IsCompetitiveMin [Mul F] [LE F] (value opt : List α → F) (c : F) : Prop
- Defined in
- EconCSLib, `Online.IsCompetitiveMin`
- Lean proof
- By Claude (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.Online.IsCompetitiveMin← Online.IsCompetitiveMin (EconCSLib/Algorithm/Online.lean:211): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α F : Type*} in /-- `c`-competitive for a **minimisation** objective: the algorithm's value on every request sequence is at most `c · opt`. -/ def Online.IsCompetitiveMin [Mul F] [LE F] (value opt : List α → F) (c : F) : Prop := ∀ reqs, value reqs ≤ c * opt reqs