Magic beans math problem (stock portforlio)

No no Think more criminally.
Find the Keebler Elf Who drops the beans into the bag ,,
Offer him 2.5% oF the sprout/ bud in exchange for filling both up with ten magical beans..
45% increase in productivity..
Now all the other elf's will get jealous and next go around they will all undercut each other.. win win
This isn't cheating .. I'm extracting the elf's from slavery.
 
Quote from ken__0:

No no Think more criminally.
Find the Keebler Elf Who drops the beans into the bag ,,
Offer him 2.5% oF the sprout/ bud in exchange for filling both up with ten magical beans..
45% increase in productivity..
Now all the other elf's will get jealous and next go around they will all undercut each other.. win win
This isn't cheating .. I'm extracting the elf's from slavery.

you are mobster, arent you ......:eek:
 
Quote from intradaybill:

Consider one bag:

Pick 10: 3 magic beans
Pick 9: 2 or 3 beans
Pick 8: 1, 2 or 3 beans
Pick 7: 0,1,2, or 3 beans
Pick 6: 0,1,2, or 3 beans
Pick 5: 0,1,2, or 3 beans
Pick 4: 0,1,2 or 3 beans
Pick 3:0,1,2, or 3 beans
Pick 2: 0,1,2 beans
Pick 1:0,1 beans
Pick 0: 0 beans

The expectation is maximum for the following combinations:

7 and 3
6 and 4
5 and 5


in this case the expectation is:

0,1,2,3,4,5,6

These are the combinations that can offer you the maximum 6 magic beans at the risk of getting 0 beans.

If you want to play safe, you pick 10 from one bag but you have only 3 beans.

So this is an incomplete problem. You have to specify the risk aversion profile.

If risk aversion is not to have less than 2 magic beans then you have the following combinations:

10,0
9,1

If 1 is minimum then:

10,0
9,1
8,2


So the answer should depend on the constraint of minimum number of magic beans.

This is a boundary value constraint problem. Otherwise, it is incomplete.

+
 
Back
Top