DECISION-TREE ODDS FUNDAMENTALS
The conditional structure behind tree odds
- Mutually exclusive branches
- Each case must enter either A or B, not both, so their initial probabilities sum to one.
- Conditional success
- P(S|A) describes success among A cases and cannot be applied directly to the B population.
- Path probability
- A terminal path probability is the product of sequential conditional probabilities along that path.
- Law of total probability
- When branches partition the population, total success is the sum of branch-weighted conditional success probabilities.
- Odds and probability
- Odds for success are p/(1-p); they are not the same numerical scale as p percent and become unbounded as p approaches one.
MODEL AND FORMULA
Why complete-path multiplication must precede addition
TECHNICAL LANGUAGE
Decision-tree odds terminology
- Chance node
- A point where mutually exclusive outcomes occur with assigned probabilities rather than a controllable choice.
- Conditional probability
- The probability of an outcome given that a specified earlier branch occurred.
- Terminal leaf
- A complete path ending in a defined outcome such as success or failure.
- Path contribution
- The terminal path probability's contribution to an aggregated event probability.
- Odds for
- The ratio of event probability to non-event probability.
- Odds against
- The reciprocal ratio: non-event probability divided by event probability.
EVIDENCE AND DATA LINEAGE
Preserve branch assignment and conditional-outcome lineage
Retain the rule that assigns cases to A or B, raw branch counts, branch-specific successes and failures, outcome window, censoring treatment, missing follow-up, and any modeled rather than observed inputs. Confirm that every eligible case appears once and that branch selection is not reconstructed using information available only after the outcome.
FREQUENTLY ASKED QUESTIONS
Questions about branch-weighted success odds
Why not average the two success rates?
An unweighted average assumes equal branch shares. Total success must weight each conditional rate by the probability of reaching that branch.
Do the payoff fields affect the odds?
No. They preserve a common four-leaf scenario for other tree analyses. This page classifies success by leaf and calculates odds from path probabilities only.
Can branch A probability be 0% or 100%?
The base model permits an endpoint branch mix. The unused branch then contributes zero path probability, but its conditional input no longer affects the total.
What happens at 100% total success?
Failure probability becomes zero and odds for success are mathematically infinite. Report the probability and the finite evidence behind it rather than presenting an arbitrary large odds value.
Can I interpret higher A success as proof that routing cases to A causes success?
No. Observational branch differences may be caused by selection, eligibility, severity, or timing. Causal claims require an appropriate design beyond this probability reconciliation.
When should I use a larger tree?
Use an expanded model when branches are not exhaustive, downstream states matter, repeated decisions occur, or consequences depend on more than the four represented leaves.
IMPORTANT NOTE
Odds summarize the declared tree; they do not validate it
This page performs exact conditional-probability arithmetic for the entered two-branch structure. It does not establish causal effects, estimate parameter uncertainty, or replace decision governance, validation data, or a more complete event tree when material pathways are omitted.