Chapter 14: Fair Division

Slides:



Advertisements
Similar presentations
Sharing Real Estate Investment Profit
Advertisements

Techniques for Solving Logic Puzzles. Logic Puzzles Logic puzzles operate using deductive logic. Logic puzzles operate using deductive logic. A well-designed.
AUTHORITY. Authority As we travelled around the state talking to PMs and management, we heard over and over again that PMs need more authority or that.
Chapter 13: Fair Division Lesson Plan
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
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.
Price Elasticity What is it all about ?. Situation 1 You have $15 to spend You must spend all your money In my “Econ goodies” shop the prices for my goods.
3. Basic Topics in Game Theory. Strategic Behavior in Business and Econ Outline 3.1 What is a Game ? The elements of a Game The Rules of the.
Chapter 13: Fair Division Lesson Plan
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.
Copyright © Cengage Learning. All rights reserved.
Game Theory Game theory is an attempt to model the way decisions are made in competitive situations. It has obvious applications in economics. But it.
Chapter 14 Methods of Fair Division. Chapter 14: Methods of Fair Division Part 1 The Adjusted Winner Procedure.
4 Why Should we Believe Politicians? Lupia and McCubbins – The Democratic Dilemma GV917.
Excursions in Modern Mathematics Sixth Edition
SCIT1003 Chapter 2: Sequential games - perfect information extensive form Prof. Tsang.
Social Choice Topics to be covered:
Selfridge-Conway Fair Division Procedure An Envy-Free Cake Division Procedure.
1 Unless otherwise noted, the content of this course material is licensed under a Creative Commons Attribution – Non-Commercial 3.0 License.
Chapter 13: Fair Division Lesson Plan
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.
Chapter 7 Networks and Scheduling Project Management for Business, Engineering, and Technology.
Chapter 12 Choices Involving Strategy McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All Rights Reserved.
Arrow's Impossibility Theorem Kevin Feasel December 10, 2006
1 Many people debate basic questions of chance in games such as lotteries. The Monty Hall problem is a fun brain teaser that Marilyn vos Savant addressed.
1 Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
This Week’s Topics  Review Class Concepts -Sequential Games -Simultaneous Games -Bertrand Trap -Auctions  Review Homework  Practice Problems.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Chapter 1 Introduction to Chemistry 1.4 Problem Solving in Chemistry
Developing Higher Level Thinking and Mathematical Reasoning.
The Marriage Problem Finding an Optimal Stopping Procedure.
Retirement Planning. Retirement Planning is no passing phase…  You could spend 2/3 of your life planning for retirement.  Retirement planning begins.
Copyright © Cengage Learning. All rights reserved.
Basic Principles: Ethics and Business
Rounding Off Whole Numbers © Math As A Second Language All Rights Reserved next #5 Taking the Fear out of Math.
Game Theory, Strategic Decision Making, and Behavioral Economics 11 Game Theory, Strategic Decision Making, and Behavioral Economics All men can see the.
Chapter 15: Apportionment
Matrices Addition and Subtraction Competency Goal and Objective Competency Goal 1: The learner will use matrices and graphs to model relationships and.
Section 3.1: Proof Strategy Now that we have a fair amount of experience with proofs, we will start to prove more difficult theorems. Our experience so.
Extending the Definition of Exponents © Math As A Second Language All Rights Reserved next #10 Taking the Fear out of Math 2 -8.
Chapter 14: Fair Division Part 4 – Divide and Choose for more than two players.
Maths on the move Cookie Count Room 13 – Year 2 Class 2007.
Chapter 14: Fair Division Part 5 – Defining Fairness.
Common Fractions © Math As A Second Language All Rights Reserved next #6 Taking the Fear out of Math Dividing 1 3 ÷ 1 3.
Transitioning to the Common Core State Standards – Mathematics Pam Hutchison
1 Chapter Two: Sampling Methods §know the reasons of sampling §use the table of random numbers §perform Simple Random, Systematic, Stratified, Cluster,
Negotiation 101 Fairness and the importance of looking ahead.
Chapter 14 – Fair Division Part 2: The Knaster Inheritance Procedure.
Fair Division Ch. 13 Finite Math. Fair division There are about 1.2 million divorces every year in the U.S. alone. International disputes redefine borders.
Chapter 3 Fair Division.
Equivalent Fractions © Math As A Second Language All Rights Reserved next #6 Taking the Fear out of Math
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 3 The Mathematics of Sharing 3.1Fair-Division Games 3.2Two Players:
Hypothesis Testing Introduction to Statistics Chapter 8 Feb 24-26, 2009 Classes #12-13.
Engineering Systems Analysis for Design Massachusetts Institute of Technology Richard de Neufville © Decision Analysis Basics Slide 1 of 21 Calculations.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 3 The Mathematics of Sharing 3.1Fair-Division Games 3.2Two Players:
Introduction to Counting. Why a lesson on counting? I’ve been doing that since I was a young child!
Fair Division Algorithms
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
More on Logic Today we look at the for loop and then put all of this together to look at some more complex forms of logic that a program will need The.
Fraction Review Fraction Review. LCM/LCD The LCD or LCM is the smallest multiple that two numbers have in common. For example: If you were comparing the.
Consumers, Producers, and the Efficiency of markets
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.
Chapter 1 Introduction to Chemistry 1.4 Problem Solving in Chemistry
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.
Choices Involving Strategy
3 The Mathematics of Sharing
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.
Section 14.1 Voting Methods.
Excursions in Modern Mathematics Sixth Edition
Presentation transcript:

Chapter 14: Fair Division Part 3 – Taking Turns and Divide and Choose

Taking Turns We only consider division by using the taking turns method when the division is made among two parties. Somehow an initial decision must be made as to which party will go first. Each party takes turns selecting the available items, until all items are distributed. Some questions related to this procedure are the following: How do we decide who chooses first? Choosing first can be a significant advantage. Could we adjust the procedure to compensate the party that chooses second? Based on knowledge of the other player’s preferences are there any strategies a player could follow that would be in their best interest.

Some questions related to this procedure are the following: Taking Turns Some questions related to this procedure are the following: How do we decide who chooses first? Flip a coin ? Bid ? Choosing first can be a significant advantage. Could we adjust the procedure to compensate the party that chooses second? Many possibilities – answer could depend on the situation. Based on knowledge of the other player’s preferences are there any strategies a player could follow that would be in their best interest. If a player knew the other’s preferences, it may be to their advantage to choose strategically. One strategy is the “bottom-up strategy”. This strategy might involve some risk.

Taking Turns – Strategy Suppose two players will divide a list of items (goods or issues) using the taking turns method. Suppose neither player knows the preferences of the other before the procedure begins. For example, suppose Bob and Carol will divide the following items: A house, pension, investments and vehicles. Suppose their preferences are as follows: Not knowing the preferences of the other, the only reasonable strategy for each player is to choose their most preferred item from those remaining. Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles

Taking Turns – Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles Suppose each player does not know the preferences of the other. Therefore, at each turn, each player will choose their most preferred item from those that remain. In this case, if Bob went first, the result would be as follows: Bob: Pension Carol: House Bob: Investments Carol: Vehicles Bob gets the pension and investments and Carol gets the house and vehicles.

Taking Turns – Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles Now, if Carol went first, and each player followed the same strategy, the result would be as follows: Carol: House Bob: Pension Carol: Investments Bob: Vehicles Carol gets the house and investments and Bob gets the pension and vehicles.

Taking Turns – the Bottom Up Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles Now, we consider a strategy that both players could use if they knew the preferences of the other player. Remember, if Bob went first, without knowing Carol’s preference, the result was: Bob gets pension and investments and Carol gets the house and vehicles. By knowing the other’s preferences, could either player do better than the result above?

Taking Turns – the Bottom Up Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles For example, if Bob knew Carol put the pension as her third choice and she really wasn’t going to pick it right away, he might pick the house first. Then the result could be as follows: Bob: House Carol: Investments Bob: Pension Carol: Vehicles In a sense, Bob played insincerely (because he did not pick according to his real preferences) but by doing this he actually did better according to those preferences: he ended up with his first two choices instead of his first and third as he would have by playing sincerely.

Taking Turns – the Bottom Up Strategy There is a strategy both players could use that would potentially provide a better result for each player in this type of fair division. The strategy is called the “bottom-up strategy”. It was discovered in 1969 by two mathematicians named Kohler and Chandrasekarean. To use the strategy a player must know the other’s preferences. If the players provided each other with their preferences before taking turns diving them up, both could use the strategy simultaneously. The strategy is as follows for each player: Complete a table representing choices at each turn by alternating filling in a player’s last choice with the other’s least preference starting with whichever player chooses last and working backwards to whichever goes first.

Taking Turns – the Bottom Up Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles For example, given the preferences in the table, assuming he’ll go first, Bob could plan his strategy as follows: (using the bottom up strategy) Bob: ______ ______ Carol: _______ _______ Being first, Bob would have an advantage. He knows that the choices will fill in the blanks above. And he knows Carol would be last. He will leave his last preference for her on her last choice.

Taking Turns – the Bottom Up Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles Bob fills in his lowest preference for Carol’s last choice. Then he fills in his last choice with Carol’s lowest preference. Bob: ______ __pension__ Carol: _______ __vehicles_ Basically, this is because he expects she will not pick that item first, since it is lower on her list of preferences. Bob continues his planning by filling in choices from right to left…

Taking Turns – the Bottom Up Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles Next, Bob will fill in Carol’s next choice (moving to the left) with his next lowest preference. Bob: ______ __pension__ Carol: __investments___ __vehicles_ Finally, Bob fill’s in his next lowest choice with Carol’s next lowest preference, which is the house. At each step, as we move from the right to left filling in the diagram, selecting preferences from the bottom of each list of preferences and moving up. For each player, we select the next available preference from the bottom of the list moving up, but from the other player list.

Taking Turns – the Bottom Up Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles Finally, Bob fills in the next choice (moving backwards – left to right) with the next lowest available item (which is actually the first item) from Carol’s preferences. Bob: __house__ __pension__ Carol: __investments___ __vehicles_ By following this “bottom-up strategy” Bob is able to do better than by simply choosing based on his preferences. Of course, he still had a significant advantage by going first, which has nothing to do with his use of this specific strategy.

Taking Turns – the Bottom Up Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles We can now ask, suppose Carol could choose first, and she planned her choices based on the bottom-up strategy. What would be the result? Carol ________ __________ Bob _________ __________ We start with whoever has the last choice. In this case Bob chooses last since there are 4 items and Carol goes first. Following the bottom-up strategy, Carol will put her last preference as Bob’s last choice.

Taking Turns – the Bottom Up Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles Carol ________ _investments__ Bob _________ __vehicles___ Carol continues by putting Bob’s next to last preference as her last choice. That is, moving from the bottom-up of what is available, Carol chooses for her last choice the lowest available preference of Bob’s. She puts investments as her last choice.

Taking Turns – the Bottom Up Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles Carol: ________ _investments__ Bob: __pension_ __vehicles___ Moving right to left, we fill in Carol’s choice with Bob’s next lowest preference that is still available. That is, Carol will fill in the house for her first choice…

Taking Turns – the Bottom Up Strategy Rank Bob Carol 1st Pension House 2nd Investments 3rd 4th Vehicles Carol _house__ _investments__ Bob __pension_ __vehicles___ Therefore, Carol takes the house and investments, her first two choices, and Bob is left with the pension and vehicles, his first and last choice. Clearly, there is an advantage to using the bottom up strategy but also there is an advantage in being the first to choose.

Divide and Choose is an ancient method of fair-division. The method is simple for two players. There are variations of divide and choose for more than two players (we will study three of these variations later) For two players: One player divides the object (or objects) and the other player chooses his or her share. Strategies: Player 1 must divide the object in a way that he or she thinks both are fair. Player 2 chooses the part containing the most value in his or her estimation.

Divide and Choose Both players use a strategy to insure that they receive a “fair” share. Player 1 divides the object to insure he or she would be satisfied with either piece – that is, would consider either piece to be a fair share. Player 2 chooses a piece that he or she considers a fair share. An interesting example of Divide and Choose is the Convention of the Law of the Sea. The Convention is an international agreement arranged by the United Nations for managing international interests in ocean resources. For example, it protects the mining interests of developing countries. If an industrialized country wants to develop or mine a portion of the seabed, that country must propose a division of that portion into two tracts. After that, an organization within the U.N. known as the International Seabed Authority, which represents the interests of developing countries, chooses one tract to be reserved for later use by developing countries.

Divide and Choose There are some considerations that could arise naturally with divide and choose which go beyond a brief and general analysis. For example, is it better to be the divider or the chooser? The answer may depend on the situation. Depending on the situation, it is conceivable that the divider could make a division which he or she considered fair and yet the chooser felt that neither piece was fair.