Theorem 2, p. 87 — with semigroup survivals, G(u) of (2) is componentwise concave in each uᵢ and submodular in u
ProvedSubstOverbooking.Structure.theorem2_concave_submodularConsider the overbooking model with reservation classes, revenues and refunds , reservations on hand , net benefits and capacities for the real inventory classes . Suppose that for every class the survivals have the semigroup property, with finite means, on a parameter set (containing , closed under addition and nonnegative differences), and that are independent. Let be the expected net revenue (2). Then:
- componentwise concavity (6): for every , every class and all ,
- submodularity: for all ,
Componentwise concavity yields critical booking levels for each class, and submodularity says these levels are nonincreasing in the bookings accepted for other classes.
Formalization Note. Concavity is stated in the increment form (6), which is what the paper proves and which makes sense on a discrete (binomial survivals) as well as on (Poisson survivals). Submodularity is lattice submodularity on via the platform SupermodularOn of . The paper proves the case and states the extension is straightforward; the statement is for general . The parameter set is required to be closed under nonnegative differences as well as sums, so that for levels in the increment is again a level and the semigroup property applies to it; the two cases of the paper, and , have this property.
import Mathlib import Definitions.Def_SubstOverbooking_Structure_Setting import Definitions.Def_Supermodularity_Monotonicity_SupermodularOn
namespace SubstOverbooking.Structure
theorem theorem2_concave_submodular {n m : ℕ} (r q x : Fin n → ℝ) (hqr : ∀ i, q i ≤ r i)
(a : Fin n → Fin (m + 1) → ℝ) (c : Fin (m + 1) → ℝ) (hc : ∀ j, j ≠ 0 → 0 ≤ c j)
(P : Set ℝ) (hP : IsParamSet P) (L : Fin n → ℝ → PMF ℕ)
(hL : ∀ i, IsSemigroupFamily P (L i)) :
(∀ u : Fin n → ℝ, (∀ k, u k ∈ P) → ∀ i : Fin n, ∀ ε ∈ P, ∀ α ∈ P,
G r q x a c L (Function.update u i (u i + ε + α)) - G r q x a c L (Function.update u i (u i + α))
≤ G r q x a c L (Function.update u i (u i + ε)) - G r q x a c L u) ∧
Supermodularity.Monotonicity.SupermodularOn (fun u => - G r q x a c L u)
{u : Fin n → ℝ | ∀ k, u k ∈ P} := by sorry
end SubstOverbooking.Structure
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.