CSC304 Lecture 18 Fair Division 1: Cake-Cutting [Image and - - PowerPoint PPT Presentation

CSC304 Lecture 18

Fair Division 1: Cake-Cutting

[Image and Illustration (you’ll see!) Credits: Ariel Procaccia]

CSC304 - Nisarg Shah 1

Cake-Cutting

CSC304 - Nisarg Shah 2

• A heterogeneous, divisible good

➢ Heterogeneous: it may be valued

differently by different individuals

➢ Divisible: we can share/divide

it between individuals

• Represented as [0,1]

➢ Almost without loss of generality

• Set of players 𝑂 = {1, … , 𝑜}
• Piece of cake 𝑌 ⊆ [0,1]

➢ A finite union of disjoint intervals

Agent Valuations

CSC304 - Nisarg Shah 3

• Each player 𝑗 has a valuation 𝑊

𝑗 that

is very much like a probability distribution over [0,1]

• Additive: For 𝑌 ∩ 𝑍 = ∅,

𝑊

𝑗 𝑌 + 𝑊 𝑗 𝑍 = 𝑊 𝑗 𝑌 ∪ 𝑍

• Normalized: 𝑊

𝑗

0,1 = 1

• Divisible: ∀𝜇 ∈ [0,1] and 𝑌,

∃𝑍 ⊆ 𝑌 s.t. 𝑊

𝑗 𝑍 = 𝜇𝑊 𝑗(𝑌)

𝛽 𝜇𝛽 𝛽 β β

𝛽 + 𝛾

Fairness Goals

CSC304 - Nisarg Shah 4

• An allocation is a disjoint partition 𝐵 = (𝐵1, … , 𝐵𝑜)
• f the cake
• We desire the following fairness properties from
• ur allocation 𝐵:
• Proportionality (Prop):

∀𝑗 ∈ 𝑂: 𝑊

𝑗 𝐵𝑗 ≥ 1

𝑜

• Envy-Freeness (EF):

∀𝑗, 𝑘 ∈ 𝑂: 𝑊

𝑗 𝐵𝑗 ≥ 𝑊 𝑗(𝐵𝑘)

Fairness Goals

CSC304 - Nisarg Shah 5

• Prop: ∀𝑗 ∈ 𝑂: 𝑊

𝑗 𝐵𝑗 ≥

Τ 1 𝑜

• EF: ∀𝑗, 𝑘 ∈ 𝑂: 𝑊

𝑗 𝐵𝑗 ≥ 𝑊 𝑗 𝐵𝑘

• Question: What is the relation between

proportionality and EF?

1.

Prop ⇒ EF

2.

EF ⇒ Prop

3.

Equivalent

4.

Incomparable

CUT-AND-CHOOSE

CSC304 - Nisarg Shah 6

• Algorithm for 𝑜 = 2 players
• Player 1 divides the cake into two pieces 𝑌, 𝑍 s.t.

𝑊

1 𝑌 = 𝑊 1 𝑍 =

Τ 1 2

• Player 2 chooses the piece she prefers.
• This is EF and therefore proportional.

➢ Why?

Input Model

CSC304 - Nisarg Shah 7

• How do we measure the “time complexity” of a

cake-cutting algorithm for 𝑜 players?

• Typically, time complexity is a function of the

length of input encoded as binary.

• Our input consists of functions 𝑊

𝑗, which requires

infinite bits to encode.

• We want running time just as a function of 𝑜.

Robertson-Webb Model

CSC304 - Nisarg Shah 8

• We restrict access to valuations 𝑊

𝑗’s through two

types of queries:

➢ Eval𝑗(𝑦, 𝑧) returns 𝑊

𝑗

𝑦, 𝑧

➢ Cut𝑗(𝑦, 𝛽) returns 𝑧 such that 𝑊

𝑗

𝑦, 𝑧 = 𝛽

𝑦 𝑧

𝛽

eval output cut output

Robertson-Webb Model

CSC304 - Nisarg Shah 9

• Two types of queries:

➢ Eval𝑗 𝑦, 𝑧 = 𝑊

𝑗

𝑦, 𝑧

➢ Cut𝑗 𝑦, 𝛽 = 𝑧 s.t. 𝑊

𝑗

𝑦, 𝑧 = 𝛽

• Question: How many queries are needed to find an

EF allocation when 𝑜 = 2?

• Answer: 2

➢ Why?

DUBINS-SPANIER

CSC304 - Nisarg Shah 10

• Protocol for finding a proportional allocation for 𝑜

players

• Referee starts at 0, and continuously moves knife

to the right.

• Repeat: when piece to the left of knife is worth 1

/𝑜 to a player, the player shouts “stop”, gets the piece, and exits.

• The last player gets the remaining piece.

DUBINS-SPANIER

11

1/3 1/3 ≥ 1/3

CSC304 - Nisarg Shah

DUBINS-SPANIER

CSC304 - Nisarg Shah 12

• Moving knife is not really needed.
• At each stage, we can ask each remaining player a

cut query to mark his 1/𝑜 point in the remaining cake.

• Move the knife to the leftmost mark.

DUBINS-SPANIER

CSC304 - Nisarg Shah 13

DUBINS-SPANIER

CSC304 - Nisarg Shah 14

Τ 1 3

DUBINS-SPANIER

CSC304 - Nisarg Shah 15

Τ 1 3 Τ 1 3

DUBINS-SPANIER

CSC304 - Nisarg Shah 16

Τ 1 3 Τ 1 3 ≥ Τ 1 3

DUBINS-SPANIER

CSC304 - Nisarg Shah 17

• Question: What is the complexity of the Dubins-

Spanier protocol in the Robertson-Webb model?

1.

Θ 𝑜

2.

Θ 𝑜 log 𝑜

3.

Θ 𝑜2

4.

Θ 𝑜2 log 𝑜

EVEN-PAZ

CSC304 - Nisarg Shah 18

• Input: Interval [𝑦, 𝑧], number of players 𝑜

➢ Assume 𝑜 = 2𝑙 for some 𝑙

• If 𝑜 = 1, give [𝑦, 𝑧] to the single player.
• Otherwise, let each player 𝑗 mark 𝑨𝑗 s.t.

𝑊

𝑗

𝑦, 𝑨𝑗 = 1 2 𝑊

𝑗

𝑦, 𝑧

• Let 𝑨∗ be the 𝑜/2 mark from the left.
• Recurse on [𝑦, 𝑨∗] with the left 𝑜/2 players, and on

[𝑨∗, 𝑧] with the right 𝑜/2 players.

EVEN-PAZ

CSC304 - Nisarg Shah 19

EVEN-PAZ

CSC304 - Nisarg Shah 20

• Theorem: EVEN-PAZ returns a Prop allocation.
• Proof:

➢ Inductive proof. We want to prove that if player 𝑗 is

allocated piece 𝐵𝑗 when [𝑦, 𝑧] is divided between 𝑜 players, 𝑊

𝑗 𝐵𝑗 ≥

Τ 1 𝑜 𝑊

𝑗

𝑦, 𝑧

• Then Prop follows because initially 𝑊

𝑗

𝑦, 𝑧 = 𝑊

𝑗

0,1 = 1

➢ Base case: 𝑜 = 1 is trivial. ➢ Suppose it holds for 𝑜 = 2𝑙−1. We prove for 𝑜 = 2𝑙. ➢ Take the 2𝑙−1 left players.

• Every left player 𝑗 has 𝑊

𝑗

𝑦, 𝑨∗ ≥ Τ 1 2 𝑊

𝑗

𝑦, 𝑧

• If it gets 𝐵𝑗, by induction, 𝑊

𝑗 𝐵𝑗 ≥ 1 2𝑙−1 𝑊 𝑗

𝑦, 𝑨∗ ≥

1 2𝑙 𝑊 𝑗

𝑦, 𝑧

EVEN-PAZ

CSC304 - Nisarg Shah 21

Complexity of Proportionality

CSC304 - Nisarg Shah 22

• Theorem [Edmonds and Pruhs, 2006]: Any

proportional protocol needs Ω(𝑜 log 𝑜) operations in the Robertson-Webb model.

• Thus, the EVEN-PAZ protocol is (asymptotically)

provably optimal!

Envy-Freeness?

CSC304 - Nisarg Shah 23

• “I suppose you are also going to give such cute

algorithms for finding envy-free allocations?”

• Bad luck. For 𝑜-player EF cake-cutting:

➢ [Brams and Taylor, 1995] give an unbounded EF protocol. ➢ [Procaccia 2009] shows Ω 𝑜2 lower bound for EF. ➢ Last year, the long-standing major open question of

“bounded EF protocol” was resolved!

➢ [Aziz and Mackenzie, 2016]: 𝑃(𝑜𝑜𝑜𝑜𝑜𝑜

) protocol!

• Yes, it’s not a typo. Go figure!

Next Lecture

CSC304 - Nisarg Shah 24

• Strategyproofness
• Pareto optimality
• Restricted case of multiple homogeneous goods
• Generalization to the case of indivisible goods