Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision | ||
| future_fabulators:formalised_decision_making [2013-10-17 19:42] – timbo | future_fabulators:formalised_decision_making [2013-10-17 19:43] – timbo | ||
|---|---|---|---|
| Line 49: | Line 49: | ||
| So a possible selection technique is to take a set of factors S so that the number of factors __not__ in the downset of S is as small as possible. | So a possible selection technique is to take a set of factors S so that the number of factors __not__ in the downset of S is as small as possible. | ||
| - | =Some calculations= | + | ==Some calculations== |
| In Scenario planning, we want to select 2 (or perhaps 3) factors that are highest in our ordering of importance and uncertainty. So we have two orders, giving a product partial order, from which we want to select 2 factors. A mathematical question arises: how often will we have the situation that this is (not) possible? | In Scenario planning, we want to select 2 (or perhaps 3) factors that are highest in our ordering of importance and uncertainty. So we have two orders, giving a product partial order, from which we want to select 2 factors. A mathematical question arises: how often will we have the situation that this is (not) possible? | ||
| Line 62: | Line 62: | ||
| To Do: work out the corect formula for counting 3-selections. These would be xxxnyyyYzzzZ where Y is the largest factor not in xxxn and Z is the largest factor not in xxxnyyyY. My current conjecture is: | To Do: work out the corect formula for counting 3-selections. These would be xxxnyyyYzzzZ where Y is the largest factor not in xxxn and Z is the largest factor not in xxxnyyyY. My current conjecture is: | ||
| - | (n-1)! sum(i=1, | + | (n-1)! sum(i=1, |
| but this needs some work to check it. | but this needs some work to check it. | ||
maja