The (Balance) equations have a unique nonnegative solution
ProvedMarkovChainChoice.SingleResource.balance_unique_nonnegchoice-modelslinear-algebramarkov-chainsp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a Markov chain choice model with , and for all , and let be any offer set. Then the (Balance) equations
have exactly one solution , and this solution is nonnegative. In particular the pair used throughout the paper is well defined, and , .
This is what makes the purchase probabilities meaningful objects in the assortment problem and the dynamic program.
Formalization Note is the pair (purchase M S, visitNot M S) chosen by Classical.epsilon; the theorem states that it solves (Balance), that both vectors are nonnegative, and that every solution of (Balance) equals it.
Preamble
import Mathlib import Definitions.Def_MarkovChainChoice_Shared_Balance open MarkovChainChoice.Shared
Formal statement
namespace MarkovChainChoice.SingleResource
theorem balance_unique_nonneg {n : ℕ} (M : Model n) (S : Finset (Fin n)) :
IsBalance M S (purchase M S) (visitNot M S) ∧
(∀ j, 0 ≤ purchase M S j) ∧ (∀ j, 0 ≤ visitNot M S j) ∧
∀ P R : Fin n → ℝ, IsBalance M S P R → P = purchase M S ∧ R = visitNot M S := by sorry
end MarkovChainChoice.SingleResource
Source
Feldman, Topaloglu, Revenue Management Under the Markov Chain Choice Model, Oper. Res. 65(5), 2017, p. 1325, Section 2, last sentence of the left column continuing into the right column
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.