/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Problem 22 Three partners are dividing a pl... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

Three partners are dividing a plot of land among themselves using the lone- divider method. After the divider \(D\) divides the land into three shares \(s_{1}, s_{2},\) and \(s_{3},\) the choosers \(C_{1}\) and \(C_{2}\) submit their bids for these shares. (a) Suppose that the choosers' bid lists are \(C_{1}:\left\\{s_{2}\right\\}\); \(C_{2}:\left\\{s_{1}, s_{3}\right\\} .\) Describe \(t w o\) different fair divisions of the land. (b) Suppose that the choosers' bid lists are \(C_{1}:\left\\{s_{1}, s_{3}\right\\}\). \(C_{2}:\left\\{s_{1}, s_{3}\right\\} .\) Describe three different fair divisions of the land.

Short Answer

Expert verified
For part (a), fair divisions can be \(D:s_{1}, C_{1}:s_{2}, C_{2}:s_{3}\) or \(D:s_{2}, C_{1}:s_{1}, C_{2}:s_{3}\). For part (b), fair divisions can be \(D:s_{2}, C_{1}:s_{1}, C_{2}:s_{3}\), \(D:s_{1}, C_{1}:s_{3}, C_{2}:s_{2}\) or \(D:s_{1}, C_{1}:s_{2}, C_{2}:s_{3}\).

Step by step solution

01

(Part a): First Fair Division

Looking at the bid lists, one fair division could be: \(D\) gets \(s_{1}\) because no one bid for it, \(C_{1}\) gets \(s_{2}\) because only \(C_{1}\) bid for it, \(C_{2}\) gets \(s_{3}\) because only \(C_{2}\) bid for it.
02

(Part a): Second Fair Division

Another potential fair division could be: \(D\) gets \(s_{2}\) because no one bid for it, \(C_{1}\) gets \(s_{1}\) because only \(C_{1}\) bid for it, \(C_{2}\) gets \(s_{3}\) because only \(C_{2}\) bid for it.
03

(Part b): First Fair Division

For part b), the chooser's bid lists are the same. One potential fair division could be: \(D\) gets \(s_{2}\) because no one bid for it, \(C_{1}\) gets \(s_{1}\) because both \(C_{1}\) and \(C_{2}\) bid for it, but can't both get it, \(C_{2}\) gets \(s_{3}\) because both \(C_{1}\) and \(C_{2}\) bid for it, but can't both get it.
04

(Part b): Second Fair Division

Another potential fair division could be: \(D\) gets \(s_{1}\) because \(C_{1}\) and \(C_{2}\) both bid for it, but can't both get it, \(C_{1}\) gets \(s_{3}\) because \(C_{1}\) and \(C_{2}\) both bid for it but can't both get it, \(C_{2}\) gets \(s_{2}\) because no one bid for it.
05

(Part b): Third Fair Division

A third potential fair division could be: \(D\) gets \(s_{1}\) because \(C_{1}\) and \(C_{2}\) both bid for it but can't both get it, \(C_{1}\) gets \(s_{2}\) because no one bid for it, \(C_{2}\) gets \(s_{3}\) because \(C_{1}\) and \(C_{2}\) both bid for it but can't both get it.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

Key Concepts

These are the key concepts you need to understand to accurately answer the question.

Fair Division
The concept of fair division is a fundamental principle in mathematics, particularly in the context of dividing assets or resources among multiple parties. It ensures that each party receives their fair share, based on predefined rules or bids. In the lone-divider method, one person, the divider, is responsible for splitting the resource into parts that they perceive as equal. The challenge is finding a division that satisfies all parties involved.

In the exercise given, the fair division is achieved by considering the bids from the choosers. If a piece is only bid upon by one chooser, it can typically be allocated directly to them. If a piece is unbid or several pieces draw equal interest, the divider's role becomes critical in ensuring fairness.

The idea is that every party thinks the division is fair based on their valuations and bids. This ensures equitable satisfaction without conflict, a crucial aspect of reasoned negotiations.
Bid Lists
Bid lists are an essential component of the lone-divider method. They indicate the preferences or priorities of each chooser for the divided shares. In explaining this, imagine there are three pieces of land, and each chooser submits a bid list indicating which pieces they'd be pleased with. This is a method where communication is key to ensuring everyone knows what the potential divisions are, and it's how fairness is gauged.

In practice, once the bids are collected, the division can proceed such that each chooser receives a share they have bid on. If possible, the bids help in ensuring that allocations are consistent with each chooser's preferences.
  • For example, if a chooser has bid on only one piece, allocating that piece to them can simplify decisions for the others.
  • If multiple pieces are bid on by a chooser, it raises the question of priority, which can be resolved by looking at which pieces others bid on.
These prioritizations aid in making impartial decisions based on structured reasoning, ultimately supporting a fair division outcome.
Mathematical Reasoning
Mathematical reasoning underpins the execution of fair division and bid-based allocation processes. It involves logical thinking and problem solving to achieve an equitable resolution for all parties. In the lone-divider method, each step requires sound reasoning to ensure fairness and satisfaction.

Here’s how mathematical reasoning is applied:
  • First, understanding the problem: Identify the shares and the preferences of each involved party.
  • Second, analyzing possible outcomes: Consider all bid possibilities and decide on allocations that respect all bids.
  • Finally, balancing interests: Make adjustments with careful reasoning if there is a conflict, ensuring all shares are as equally satisfying as possible within the constraints of the bids.
This promotes transparency and reduces contention, illustrating the power of mathematical ways of thinking in solving real-world allocation challenges.

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Four players (Abe, Betty, Cory, and Dana) are sharing a cake. Suppose that the cake is divided into four slices \(s_{1}, s_{2}, s_{3},\) and \(s_{4}\) (a) To Abe, \(s_{1}\) is worth \(\$ 3.60, s_{4}\) is worth \(\$ 3.50, s_{2}\) and \(s_{3}\) have equal value, and the entire cake is worth \(\$ 15.00 .\) Determine which of the four slices are fair shares to Abe. (b) To Betty, \(s_{2}\) is worth twice as much as \(s_{1}, s_{3}\) is worth three times as much as \(s_{1}\), and \(s_{4}\) is worth four times as much as \(s_{1}\). Determine which of the four slices are fair shares to Betty. (c) To Cory, \(s_{1}, s_{2}\), and \(s_{4}\) have equal value, and \(s_{3}\) is worth as much as \(s_{1}, s_{2}\), and \(s_{4}\) combined. Determine which of the four slices are fair shares to Cory. (d) To Dana, \(s_{1}\) is worth \(\$ 1.00\) more than \(s_{2}, s_{3}\) is worth \(\$ 1.00\) more than \(s_{1}, s_{4}\) is worth \(\$ 3.00\), and the entire cake is worth \(\$ 18.00\). Determine which of the four slices are fair shares to Dana. (e) Find a fair division of the cake using \(s_{1}, s_{2}, s_{3},\) and \(s_{4}\) as fair shares.

Four partners are dividing a plot of land among themselves using the lone- divider method. After the divider \(D\) divides the land into four shares \(s_{1}, s_{2}, s_{3},\) and \(s_{4},\) the choosers \(C_{1}, C_{2}\) and \(C_{3}\) submit the following bids: \(C_{1}:\left\\{s_{3}, s_{4}\right\\} ; C_{2}:\left\\{s_{4}\right\\}\); \(C_{3}:\left\\{s_{3}\right\\} .\) For each of the following possible divisions, determine if it is a fair division or not. If not, explain why not. (a) \(D\) gets \(s_{1} ; s_{2}, s_{3},\) and \(s_{4}\) are recombined into a single piece that is then divided fairly among \(C_{1}, C_{2},\) and \(C_{3}\) using the lone-divider method for three players. (b) \(D\) gets \(s_{3} ; s_{1}, s_{2},\) and \(s_{4}\) are recombined into a single piece that is then divided fairly among \(C_{1}, C_{2},\) and \(C_{3}\) using the lone-divider method for three players. (c) \(D\) gets \(s_{2} ; s_{1}, s_{3},\) and \(s_{4}\) are recombined into a single piece that is then divided fairly among \(C_{1}, C_{2},\) and \(C_{3}\) using the lone-divider method for three players. (d) \(C_{2}\) gets \(s_{4} ; C_{3}\) gets \(s_{3} ; s_{1}, s_{2}\) are recombined into a single piece that is then divided fairly between \(C_{1}\) and \(D\) using the divider-chooser method.

Four partners are dividing a plot of land among themselves using the lone- divider method. After the divider \(D\) divides the land into four shares \(s_{1}, s_{2}, s_{3},\) and \(s_{4},\) the choosers \(C_{1}, C_{2}\) and \(C_{3}\) submit their bids for these shares. (a) Suppose that the choosers' bid lists are \(C_{1}:\left\\{s_{2}\right\\}\); \(C_{2}:\left\\{s_{1}, s_{3}\right\\} ; C_{3}:\left\\{s_{2}, s_{3}\right\\} .\) Find a fair division of the land. Explain why this is the only possible fair division. (b) Suppose that the choosers' bid lists are \(C_{1}:\left\\{s_{2}\right\\}\); \(C_{2}:\left\\{s_{1}, s_{3}\right\\} ; C_{3}:\left\\{s_{1}, s_{4}\right\\} .\) Describe three different fair divisions of the land. (c) Suppose that the choosers' bid lists are \(C_{1}:\left\\{s_{2}\right\\}\); \(C_{2}:\left\\{s_{1}, s_{2}, s_{3}\right\\} ; C_{3}:\left\\{s_{2}, s_{3}, s_{4}\right\\} .\) Describe three different fair divisions of the land.

Lone-chooser is a fair-division method. Suppose that \(N\) players divide a cake using the lone-chooser method. The chooser is \(C\) and the dividers are \(D_{1}, D_{2}, \ldots, D_{N-1} .\) Explain why, when properly played, the method guarantees to each player a fair share. (You will need one argument for the dividers and a different argument for the chooser.)

Anne, Bette, and Chia jointly own a flower shop. They can't get along anymore and decide to break up the partnership using the method of sealed bids, with the understanding that one of them will get the flower shop and the other two will get cash. Anne bids \(\$ 210,000\), Bette bids \(\$ 240,000\), and Chia bids \(\$ 225,000\). How much money do Anne and Chia each get from Bette for their third share of the flower shop?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.