Fair Division Lone Divider Method.

Slides:



Advertisements
Similar presentations
3.1 Fair Division: To divide S into shares (one for each player) in such a way that each player gets a fair share. Fair Division: To divide S into shares.
Advertisements

The Last Diminisher Method
Homework p. 103 (2, 4, 8, 10, 11, 16, 20) 2. a) $ a) $ a) s2, s3 ($7 is fair) b) $4.80 b) $4.50 b) s1, s2 ($6 is fair) c) $6.40 c) $5.40.
Fair division. Fair division is the concept of dividing something among 2 or more people in such a way that each person finds his/her share to be fair.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. Tommy, Tammy, and Amy are to share a pizza. One half of the pizza.
Two players: The Divider-Chooser Method
Prime Number – a number that has only two factors, itself and 1.
Excursions in Modern Mathematics Sixth Edition
Social Choice Topics to be covered:
Selfridge-Conway Fair Division Procedure An Envy-Free Cake Division Procedure.
§ 3.1 Fair-Division.
Lau Ting Sum Samson Suen Wai.  Discuss what fairness is  Describe some methods for fair division: 1. Divide-and-choose 2. Last Diminisher 3. Selfridge-Conway.
5 Minute Warm-Up Directions: Simplify each problem. Write the
Multiplication of Fractions
WARM UP 8/28 Change these mixed numbers to improper fractions.
Green Meadow Elementary
Chapter 14: Fair Division Part 4 – Divide and Choose for more than two players.
Chapter 14: Fair Division Part 5 – Defining Fairness.
Chapter 3 Fair Division.
Fair Division Lone Divider Method.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 3 The Mathematics of Sharing 3.1Fair-Division Games 3.2Two Players:
§ 3.4 The Lone-Chooser Method
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 3 The Mathematics of Sharing 3.1Fair-Division Games 3.2Two Players:
Probability of Compound Events Standards: MM1D2a. Find the probabilities of mutually exclusive events. b. Find the probabilities of dependent events. c.
Instructor: Shengyu Zhang 1. Resource allocation General goals:  Maximize social welfare.  Fairness.  Stability. 2.
Fair Division Algorithms
Copyright © 2015, 2011, 2008 Pearson Education, Inc. Chapter 7, Unit B, Slide 1 Probability: Living With The Odds 7.
MIXED NUMBERS AND IMPROPER FRACTIONS. NS 2.1 Solve problems involving addition, subtraction, multiplication, and division of positive fractions and explain.
Fair-Division Vocab Fair-division problems: fairly dividing something between 2 or more people.Fair-division problems: fairly dividing something between.
Probability & Statistics Circle Graphs (Pie Charts)
Fair Division Fair Division Problem: A problem that involves the dividing up of an object or set of objects among several individuals (players) so that.
Ionic Poker.
Plurality and Borda Count Method
INTRODUCTION TO FRACTIONS
Traveling Salesman Problems
Divider – chooser method
How can we tell which portions are the same amount?
Displaying Categorical Data
Learn to find the theoretical probability of an event.
Fair Division The Value of a Slice.
Place Value.
Warm Up – 2/20 - Thursday How much more does Angela like strawberry than vanilla? B) Give a percentage that describes how much Angela values the Vanilla.
Fair Division Introduction.
Patterns X = 205 2,050 X 1 0 = Complete the number sentences using the above strategy. 14 X 10 = 42 X 100 = 504 X 100.
Intro to the Fair Allocation
Simplifying ratios no units
Dividing Quesadillas “Dividing More than One Whole into Parts”
= 6.976−2.05= 4.7(9.5)= 6.5÷3.2= = Bell Work Cronnelly.
FAIR division (Txt: 3.1 & SOL: DM.7)
Island Division: Lone-divider Method
Warm Up – 2/24 - Monday Five players are dividing a cake using the lone- Divider Method.
3 The Mathematics of Sharing
OPERATIONS with FRACTIONS
Plurality with Elimination
Explanatory / Response Variables
Review Questions 3rd NF.1.
Bell Work into a decimal & a percent. 5) 8 9 (1 2 3 ) =
Warm Up – 3/3 - Monday Describe in your own words the steps to each of the following fair division processes and when to use each process. Divider-Chooser.
Island Division: Lone-divider Method
Euler Paths and Euler Circuits
2-D Representations of Solids
Chapter 2 Introduction Fair Division.
Fair Division Fair Division Problem: A problem that involves the dividing up of an object or set of objects among several individuals (players) so that.
3 The Mathematics of Sharing
Divider-Chooser Method
Excursions in Modern Mathematics Sixth Edition
Voting Fairness.
Fractions Review.
Shift the 3 two digits to the left.
Presentation transcript:

Fair Division Lone Divider Method

Lone Divider method T. Serino The Lone Divider Method is a fair division scheme that can be used to divide a bounty between three or more players. As the name implies, there is only one divider in the method and the rest of the players are choosers (we’ll call them chooser 1, chooser2, etc.).

Lone Divider method Steps: T. Serino Steps: 1. Decide which player is the divider. (roll a die, draw   straws, draw cards, buck up...) 2. The Divider cuts the cake into 3 slices (S1, S2, and S3). The cut must be fair to the divider (Each slice must be worth 1/3 of the whole cake). 3. Each of the choosers declares independently (secretly, usually by writing it down on a slip of paper) which slice(s) they each consider to be fair (worth at least 1/3) 4. The cake is distributed. (If the cake cannot be distributed fairly at this point, other divisions may be necessary)

Lone Divider method Remember: T. Serino Remember: As in all fair division schemes, the Lone Divider Method guarantees that each of the n players (in this case n=3) will receive what they consider a fair share. A fair share is worth at least 1/n of the whole cake (in this case, 1/3 of the whole cake).

Lone Divider method Example 1) T. Serino Example 1) At least one of the choosers selects more than one slice to be fair. (possible to distribute the cake fairly without further division) Scenario:  The divider cuts the cake and labels the slices as shown:   Chooser 1 declares: {S1, S3}   Chooser 2 declares: {S3}

Lone Divider method Solution: Chooser 1 declared: {S1, S3} T. Serino Solution:  Chooser 1 declared: {S1, S3}  Chooser 2 declared: {S3} The divider gets S2 (she declared this as a fair slice by making the cut)    Chooser 2 gets S3  Chooser 1 gets S1 Notice, each player received a fair share according to his/her own value system.

Lone Divider method Example 2) T. Serino Example 2) Each chooser selects one slice only,  but they each select a different slice. (possible to distribute the cake fairly  without further division) Scenario:  The divider cuts the cake and labels the slices as shown:   Chooser 1 declares: {S1}   Chooser 2 declares: {S3}

Lone Divider method Solution: Chooser 1 declared: {S1} T. Serino Solution:  Chooser 1 declared: {S1}  Chooser 2 declared: {S3} The divider gets S2 (she declared this as a fair slice by making the cut)    Chooser 2 gets S3  Chooser 1 gets S1 Notice, each player received a fair share according to his/her own value system.

Lone Divider method Example 3) T. Serino Example 3) Each chooser selects one slice only,  and they both select the same slice. (Further division is necessary) Scenario:  The divider cuts the cake and labels the slices as shown:   Chooser 1 declares: {S3}   Chooser 2 declares: {S3}

Lone Divider method Solution: Chooser 1 declared: {S3} T. Serino Solution:  Chooser 1 declared: {S3}  Chooser 2 declared: {S3} The divider gets to choose either S1 or S2. (Each chooser declared S1 and S2 as unfair.) The remaining slices are put back together and the choosers will use divider-chooser method to divide it fairly. 

Lone Divider method *Important notes for understanding. T. Serino *Important notes for understanding. By selecting S3 as the only fair slice, the choosers are implying that both S1 and S2 are each less than 1/3 of the whole cake. If, the slice taken by the divider is worth less than 1/3 of the cake, then the value of the remaining slices is worth more than 2/3 of the cake. Therefore, the choosers will each be guaranteed more than their fair share of the cake.

Lone Divider method Example 3) (continued) One possible scenario: T. Serino Example 3)  (continued) One possible scenario: The Divider selects S1 S2 and S3 are combined. The choosers use divider-chooser method.

Try this. T. Serino 1 If you were the divider in a fair division game with three players, show two different ways that you can make a fair division of the following rectangular cake.

Try this. T. Serino 2 If you were one of the choosers, which slices would you declare as fair in each of the following examples? S1 S1 S2 S2 S3 S3

Try this. T. Serino 3 The divider has cut a cake as shown below. Make a fair division of the cake given each chooser’s declarations. (Decide who gets which piece) S2 Chooser 1: {S1} Chooser 2: {S1, S3} S1 S3

T. Serino Lone Divider method

athematical M D ecision aking