N represents the number of players (at least 3).

Similar documents
The Last Diminisher Method Game Steps

Chapter 4. Section 4.1: Divide and Choose Methods. Next: reading homework

3 The Mathematics of Sharing

There are several schemes that we will analyze, namely: The Knaster Inheritance Procedure. Cake-Division Procedure: Proportionality

Answer: Jeff Fran Rudy House $ $ $ Car $ $ $ Boat $ $ $

Chapter 13: Fair Division

Discrete Math Review Chapter 3. Multiple Choice Choose the one alternative that best completes the statement or answers the question.

Fair Division Worksheet Day 3. Warm-up 1. To cut a string into 2 pieces, how many times must it be cut?

Unit 6 Notes Day 6 FAIR DIVISION ALGORITHMS CONTINUOUS CASE SECTION 2.5

Game A. Auction Block

One method of dividing something among three or more people is the Lone Divider Method. The method for N parties proceeds as follows:

Chapter 2. Weighted Voting Systems. Sections 2 and 3. The Banzhaf Power Index

The Math of Rational Choice - Math 100 Spring 2015 Part 2. Fair Division

A fair division procedure is equitable if each player believes he or she received the same fractional part of the total value.

A fair division procedure is equitable if each player believes he or she received the same fractional part of the total value.

Fair Division. Fair Division 31

RMT 2015 Power Round Solutions February 14, 2015

Note that there are questions printed on both sides of each page!

Chapter 13: Fair Division

Chapter 13. Fair Division. Chapter Outline. Chapter Summary

. MA111: Contemporary mathematics. Jack Schmidt. November 9, 2012

Basic Elements. The value systems that give each player the ability to quantify the value of the goods.

Probability: Part 1 1/28/16

Lecture 10: Auction Mechanisms

An extended description of the project:

Tikal 2 4 players aged 10 and up Authors: M. Kiesling / W. Kramer

Ex 1: A coin is flipped. Heads, you win $1. Tails, you lose $1. What is the expected value of this game?

Bargaining Games. An Application of Sequential Move Games

Cutting a Pie Is Not a Piece of Cake

Math 130 Sample Exam 4

Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness

COMPSCI 223: Computational Microeconomics - Practice Final

2 An n-person MK Proportional Protocol

Pascal to Fermat. August 24, 1654

Student Name. Student ID

Circuit Analysis and Ohm s Law

13.4 Taking Turns. The answer to question 1) could be "toss a coin" or bid for the right to go first, as in an auction.

THE STORY GAME PLAY OVERVIEW

Name: Exam Score: /100. EXAM 3 Version A. Multiple Choice. (26 questions at 4 points each) Circle the letter of the best answer.

Algorithmic Game Theory and Applications. Kousha Etessami

Elite Real Estate Flipping Advice: 7 Tips to Finding the Best Contractors for Rehabs

MATH4994 Capstone Projects in Mathematics and Economics

ECO 463. SimultaneousGames

MATH4999 Capstone Projects in Mathematics and Economics. 1.1 Criteria for fair divisions Proportionality, envy-freeness, equitability and efficiency

13.4 Taking Turns. The answer to question 1) could be "toss a coin" or bid for the right to go first, as in an auction.

BANKER S RESPONSIBILITIES. Distribute money at the beginning of the game. Dispense salaries and houses.

or More Events Activities D2.1 Open and Shut Case D2.2 Fruit Machines D2.3 Birthdays Notes for Solutions (1 page)

A MOVING-KNIFE SOLUTION TO THE FOUR-PERSON ENVY-FREE CAKE-DIVISION PROBLEM

Maharaja Rules Summary

Arpita Biswas. Speaker. PhD Student (Google Fellow) Game Theory Lab, Dept. of CSA, Indian Institute of Science, Bangalore

MGF 1107 FINAL EXAM REVIEW CHAPTER 9

Incentives and Game Theory

LESSON 2. Objectives. General Concepts. General Introduction. Group Activities. Sample Deals

Introduction. Goal. Contents Steve Finn. 30mn

Bidding for Envy-freeness:

The Objective Valuation of Non-Traded IP. Jonathan D. Putnam

MATH4994 Capstone Projects in Mathematics and Economics. 1.1 Criteria for fair divisions Proportionality, envy-freeness, equitability and efficiency

Divide-and-conquer: A proportional, minimal-envy cake-cutting algorithm

A note on k-price auctions with complete information when mixed strategies are allowed

COMPONENTS: No token counts are meant to be limited. If you run out, find more.

HENRY FRANCIS (EDITOR-IN-CHIEF), THE OFFICIAL ENCYCLOPEDIA OF BRIDGE

STATE LOTTERIES ACT 1966 LOTTERIES (SET FOR LIFE) RULES

to j to i to i to k to k to j

How to Make Money Selling On Amazon & Ebay! By Leon Tran

NEFERTITI. The Port of Memphis in cardboard 2 Royal Seal tokens

LESSON 4. Second-Hand Play. General Concepts. General Introduction. Group Activities. Sample Deals

Experimental Instructions

Cake Cutting. Suresh Venkatasubramanian. November 20, 2013

Finance Solutions to Problem Set #8: Introduction to Game Theory

U strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium.

Class # 6 and 7 Values and Valuation. A break down of value 1/28/2016. Principle Methods for Nonmarket Valuation

Suppose Y is a random variable with probability distribution function f(y). The mathematical expectation, or expected value, E(Y) is defined as:

Section 1.6 Dividing Whole Numbers

Technology Department Surplus Equipment RFP: Projectors February 2019

Team Round University of South Carolina Math Contest, 2018

Modified Knaster s Sealed Bids Approaches for Fantasy Sports Drafts

1. What percentage of the hundredths grids below are shaded in?

487opoly Rules Fall 2017

STATE LOTTERIES ACT 1966 LOTTERIES (MONDAY AND WEDNESDAY X LOTTO) RULES

1. Introduction What is MoneyBall? The online gambling market The MoneyBall solution Technology and anonymity...

Mike Ferry North America s Leading Real Estate Coaching and Training Company TRIGGER CARDS

Sec 5.1 The Basics of Counting

pixeos Project V b

No lawyer? You can defend yourself in General Sessions Court. If you are sued

Session 5 Variation About the Mean

Connection and costs distribution problems

Mathematics Behind Game Shows The Best Way to Play

Math 111 Compensation Lectures Spring 2014

CS269I: Incentives in Computer Science Lecture #20: Fair Division

how TO PLAY blackjack

which all children and young people have the skills, knowledge and confidence to manage their money well, now and in the future.

Microeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016

DIY Info. Your rights... how does the Consumer Guarantees Act affect you?

Elizabeth Clark Mrs. Prescott Warren

Poker Rules Friday Night Poker Club

1. Five cards are drawn from a standard deck of 52 cards, without replacement. What is the probability that (a) all of the cards are spades?

EXPIRED SCRIPT OVER THE PHONE

LET S PLAY PONTOON. Pontoon also offers many unique payouts as well as a Super Bonus of up to $5000 on certain hands.

5th Grade. Divisibility Rules. Slide 1 / 239 Slide 2 / 239. Slide 3 / 239. Slide 4 / 239. Slide 6 / 239. Slide 5 / 239. Division. Division Unit Topics

Pevans Board games reviews and articles by Paul Evans Coal, Iron and Railroads

Transcription:

Section 5. The last-diminisher method. N represents the number of players (at least 3). First order the players: P1, P2, P3 etc. Basic principle: the first player in each round marks a piece and claims it. The part claimed is called C and the remainder is called R. The next player can pass; if he doesn t pass, he must diminish the size of C and claim this smaller piece for himself. This continues with each successive player. When a player is claiming a piece, he doesn t know if he will get that piece, or a later player will, so he must claim a piece which is a fair share for him (but no larger actually the last player in the round can claim a larger than fair share, since no one after him can take it away). Round 1. Player P1 marks a piece worth 1/N of the whole (in P1 s valuation of worth). P1 is the claimant of that piece. If that piece is worth less than or equal to 1/N of the whole to P2, then P2 passes; if it is worth more than 1/N of the whole to P2, then P2 makes the piece smaller, so it is worth 1/N of the whole (in P2 s valuation), and P2 becomes the claimant of the new smaller piece. The rest of the players do the same, either passing or claiming a part of the piece which is worth 1/N of the whole to them. The last player to claim the piece gets it, and is finished. 1

Here is an example from the textbook: N=5 2

3

Round 2. Now there are N-1 players dividing up the remainder of the cake. They do the same procedure as in round 1, except they pass if the piece is worth no more than 1/(N-1) of the whole for this round. In the books example, N-1=4. 4

Round 3 of books example: N-2=3 players left: Since one player drops out after each round, after N-2 rounds there are only 2 players left. 5

Round N-1. There are only two players left. They split the remainder of the original property between themselves by the divider-chooser method (as discussed in section 2). 6

Another example. Four players divide a cake by the last diminisher method. The players in order are P1, P2, P2 and P4. How many rounds are there? Answer: 3, one fewer than the number of players. Suppose P2 and P3 are the only diminishers in round 1 and there are no diminishers in round 2. Which player gets her fair share at the end of round 1? Answer: P3 is the last diminisher, hence the last claimant, hence gets the piece she claimed. Which player gets her fair share at the end of round 2? Answer: P1 is the last diminisher, hence the last claimant, hence gets the piece she claimed. Which player is the first to cut the cake at the beginning of round 3? Answer: P1 already got her piece, so is finished. P2 is the next player, so cuts the cake first in this round. Then what happens? Answer: P4 claims one of the two pieces that P2 cut the cake into. P2 takes the piece left over. 7

Section 6. The method of sealed bids. This is a method for dividing goods which can t be subdivided into arbitrarily small pieces; things like houses, cars, paintings, etc. Example. Three players (A, B and C) which to divide up three items. Step 1 (The bids). Each player makes a sealed bid stating the monetary value of each item to him or her. The bids are opened, revealing: A B C Item 1 $36 $45 $39 Item 2 $15 $18 $9 Item 3 $21 $18 $24 Step 2 (The allocations). Each item goes to the highest bidder. So B gets items 1 and 2, C gets item 3, and A gets nothing. 8

Step 3 (The payments). Calculate what each player considers the totality of the items to be worth, and divide by 3 to get that players fair share of the total. A B C Item 1 $36 $45 $39 Item 2 $15 $18 $9 Item 3 $21 $18 $24 Total $72 $81 $72 Fair share $24 $27 $24 Player B received items 1 and 2, which B values at $45+$18=$63, but B s fair share is only $27, so B has to pay $63-$27=$36 to the Estate. Player C received item 3 worth $24 (to C), which is exactly C s fair share, so C is done. Player A received no items, so the Estate gives A $24, so that A also receives his fair share. All three players have received, either in items or in money, what they judge to be their fair share. Step 4 (Dividing the surplus). The estate received $36 from B and paid $24 to A, so has a surplus of $12. This is split in three equal portions $4 each, and one portion given to each player. So each player receives more than what that player considered a fair share. 9