§ 3.4 The Lone-Chooser Method.pptVIP

* § 3.4 The Lone-Chooser Method The Lone-Chooser Method(for three players) Preliminaries: One of the players is designated as the chooser, C. The other two players will be dividers D1 and D2. These assignments will be made randomly. The Lone-Chooser Method(for three players) Step 1. D1 and D2 divide S between themselves into two fair shares using the the divider-chooser method. We will call s1 D1‘s piece and s2 D2‘s piece. The Lone-Chooser Method(for three players) Step 1. D1 and D2 divide S between themselves into two fair shares using the the divider-chooser method. We will call D1‘s piece s1 and D2‘s piece s2. Step 2. Each divider divides his/her share into three subshares. The subshares of s1 are s1a , s1b and s1c ; the subshares of s2 are s2a , s2b and s2c. The Lone-Chooser Method(for three players) Step 3. C now chooses one of D1‘s subshares and one of D2‘s subshares. Example: Homer, Lenny and Carl have gotten together to buy a special-edition $6 Lard-Lad donut. Half of the donut has sprinkles and the other half is jelly-filled. Suppose that Homer and Lenny are the dividers and Carl is the divider. S J S J S J $4.50 $1.50 $1.00 $5.00 $2.00 $4.00 Draw a possible first division by Homer other than a straight vertical cut through the center and indicate which piece Lenny would choose. Based on the first division draw a possible second division that Homer might make. Based on the first division, draw a possible second division that Lenny might make. Based on the second divisions describe a possible final fair division of the donut. Find the dollar value of each share in the eyes of the player receiving it. The Lone-Chooser Method(for N players) Step 1. D1, D2, D3, . . . , DN-1 divide S fairly among themselves. Step 2. Each divider subdivides his/her share into N subshares. Step 3. C chooses one subshare from each divider. Every player ends up with N - 1 subshares. § 3.5 The Last-Diminisher Method The Last-Diminisher Metho