the whining philosophers problem sperner s lemma
play

THE WHINING PHILOSOPHERS PROBLEM SPERNERS LEMMA Triangle - PowerPoint PPT Presentation

T RUTH J USTICE A LGOS Fair Division IV: Rent Division Teachers: Ariel Procaccia (this time) and Alex Psomas THE WHINING PHILOSOPHERS PROBLEM SPERNERS LEMMA Triangle partitioned into elementary triangles 3 Label vertices by


  1. T RUTH J USTICE A LGOS Fair Division IV: Rent Division Teachers: Ariel Procaccia (this time) and Alex Psomas

  2. THE WHINING PHILOSOPHERS PROBLEM

  3. SPERNER’S LEMMA β€’ Triangle π‘ˆ partitioned into elementary triangles 3 β€’ Label vertices by {1,2,3} 1 2 using Sperner labeling: 1 2 3 β—¦ Main vertices are different 3 3 2 2 β—¦ Label of vertex on an edge 1 1 2 1 2 (𝑗, π‘˜) of π‘ˆ is 𝑗 or π‘˜ 1 2 2 1 1 2 β€’ Lemma: Any Sperner labeling contains at least one fully labeled elementary triangle

  4. PROOF OF LEMMA β€’ Doors are 12 edges β€’ Rooms are elementary 3 1 2 triangles 1 2 3 β€’ #doors on the 3 3 2 2 boundary of π‘ˆ is odd 1 1 2 1 2 1 2 2 1 1 2 β€’ Every room has ≀ 2 doors; one door iff the room is 123

  5. PROOF OF LEMMA β€’ Start at door on boundary and walk through it 3 β€’ Room is fully labeled or it 1 2 has another door... 1 2 3 β€’ No room visited twice 3 3 2 2 1 1 2 1 2 β€’ Eventually walk into fully 1 2 2 1 1 2 labeled room or back to boundary β€’ But #doors on boundary is odd ∎

  6. THE MODEL β€’ Assume there are three players A, B, C β€’ Goal is to assign the rooms and divide the rent in a way that is envy free: each player wants a different room at the given prices β€’ Sum of prices for three rooms is 1 β€’ Theorem [Su 99]: An envy-free solution always exists under some assumptions

  7. PROOF OF THEOREM (0,0,1) 0, 1 2 , 1 2 1 3 , 1 3 , 1 3 (1,0,0) (0,1,0)

  8. PROOF OF THEOREM β€’ β€œTriangulate” and assign β€œownership” of each vertex to each of A, B, and C, in a way that each elementary triangle is an ABC triangle A B C C A B A B C A B C A B C C A B C A B

  9. PROOF OF THEOREM β€’ Ask the owner of each vertex to tell us which room he prefers β€’ This gives a new labeling by 1, 2, 3 β€’ Assume that a person wants a free room if one is offered to him

  10. PROOF OF THEOREM β€’ Choice of rooms on edges is constrained by free room assumption 1 or 2 A B C C A B A B C A B C A B C 1 2 C A B C A B or 3 or 3 3 only

  11. PROOF OF THEOREM β€’ Sperner’s lemma (variant): such a labeling must have a 123 triangle 1 or 2 A B C C A B 2 3 A B C A 1 B C A B C 1 2 C A B C A B or 3 or 3 3 only

  12. PROOF OF THEOREM β€’ Such a triangle is nothing but an approximately EF solution! β€’ By making the triangulation finer, we can approach envy-freeness β€’ Under additional closedness assumption, leads to existence of an EF solution ∎

  13. DISCUSSION β€’ It is possible to derive an algorithm from the proof β€’ Same techniques generalize to more housemates β€’ Same proof (with the original Sperner’s Lemma) shows existence of EF cake division!

  14. QUASI-LINEAR UTILITIES β€’ Suppose each player 𝑗 ∈ 𝑂 has value 𝑀 𝑗𝑠 for room 𝑠 β€’ Οƒ 𝑠 𝑀 𝑗𝑠 = 𝑆 , where 𝑆 is the total rent β€’ The utility of player 𝑗 for getting room 𝑠 at price π‘ž 𝑠 is 𝑀 𝑗𝑠 βˆ’ π‘ž 𝑠 β€’ A solution consists of an assignment 𝜌 and a price vector 𝒒 , where π‘ž 𝑠 is the price of room 𝑠 β€’ Solution (𝜌, 𝒒) is envy free if βˆ€π‘—, π‘˜ ∈ 𝑂, 𝑀 π‘—πœŒ 𝑗 βˆ’ π‘ž 𝜌 𝑗 β‰₯ 𝑀 π‘—πœŒ π‘˜ βˆ’ π‘ž 𝜌 π‘˜ β€’ Theorem [Svensson 1983]: An envy-free solution always exists under quasi-linearity

  15. Room 1 Total rent: $10 Room 2 Room 3

  16. PROPERTIES OF EF SOLUTIONS β€’ Allocation 𝜌 is welfare-maximizing if 𝜌 ∈ argmax 𝜏 ෍ 𝑀 π‘—πœ 𝑗 π‘—βˆˆπ‘‚ β€’ Lemma 1: If (𝜌, 𝒒) is an EF solution, then 𝜌 is a welfare-maximizing assignment β€’ Lemma 2: If (𝜌, 𝒒) is an EF solution and 𝜏 is a welfare-maximizing assignment, then (𝜏, 𝒒) is an EF solution, and for all 𝑗 , 𝑀 π‘—πœŒ 𝑗 βˆ’ π‘ž 𝜌 𝑗 = 𝑀 π‘—πœ 𝑗 βˆ’ π‘ž 𝜏 𝑗

  17. PROOF OF LEMMA 1 β€’ Let (𝜌, 𝒒) be an EF solution, and let 𝜏 be another assignment β€’ Due to EF, for all 𝑗 , 𝑀 π‘—πœŒ 𝑗 βˆ’ π‘ž 𝜌 𝑗 β‰₯ 𝑀 π‘—πœ 𝑗 βˆ’ π‘ž 𝜏 𝑗 β€’ Summing over all 𝑗 , ෍ 𝑀 π‘—πœŒ 𝑗 βˆ’ ෍ π‘ž 𝜌 𝑗 β‰₯ ෍ 𝑀 π‘—πœ 𝑗 βˆ’ ෍ π‘ž 𝜏 𝑗 π‘—βˆˆπ‘‚ π‘—βˆˆπ‘‚ π‘—βˆˆπ‘‚ π‘—βˆˆπ‘‚ β€’ We get the desired inequality because prices sum up to 𝑆 ∎

  18. POLYNOMIAL-TIME ALGORITHM β€’ Consider the algorithm that finds a welfare- maximizing assignment 𝜌 , and then finds prices 𝒒 that satisfy the EF constraint β€’ Theorem [Gal et al. 2017]: The algorithm always returns an EF solution, and can be implemented in polynomial time β€’ Proof: β—¦ We know that an EF solution 𝜏, 𝒒 exists, by Lemma 2 (𝜌, 𝒒) is EF, so we would be able to find prices satisfying the EF constraint β—¦ The first part is max weight matching, the second part is a linear program ∎

  19. Room 1 Total rent: $3 Room 2 Room 3

  20. OPTIMAL EF SOLUTIONS Straw Man Solution Straw Man Solution Maximin Solution Equitable solution Max sum of utilities Max sum of utilities Max min utility Min max difference in utils Subject to envy freeness Subject to envy freeness Subject to envy freeness Subject to envy freeness

  21. OPTIMAL EF SOLUTIONS β€’ Theorem [Gal et al. 2017]: The maximin and equitable solutions can be computed in polynomial time β€’ Theorem [Alkan et al. 1991]: The maximin solution is unique Poll 1 Suppose that the values are ? 1 0 0 0 1/2 1/2 1/3 1/3 1/3 What is the min utility under the maximin solution? β€’ 2/6 = 1/3 β€’ 2/8 = 1/4 β€’ 2/7 β€’ 2/9

  22. OPTIMAL EF SOLUTION β€’ Theorem [Gal et al. 2017]: The maximin solution is equitable, but not vice versa β€’ Rent division instance from Spliddit where the equitable solution is not maximin: 2227 708 0 258 1378 1299 1000 1000 935 β€’ Maximin solution gives room 𝑗 to player 𝑗 , with prices and utilities 1813 1 3 , 600 1 3 , 521 1 3 , 413 2 3 , 777 2 3 , 413 2 3 β€’ The max difference in utilities is 364 β€’ The following prices and utilities have the same max difference, but lower minimum utility: 1570 2 3 , 721 2 3 , 642 2 3 , 656 1 3 , 656 1 3 , 292 1 3

  23. CAVEAT: STRATEGYPROOFNESS β€’ Lemma 1 tells us that any EF solution is welfare maximizing β€’ Therefore, any EF solution is Pareto efficient β€’ But there is no rent division algorithm that is both EF and Pareto efficient [Green and Laffont 1979] β€’ However, strategic behavior is largely a nonissue in practice in the rent division domain

  24. CAVEAT: NEGATIVE RENT β€’ Envy-freeness may require negative rent, as the following example shows: 36 34 30 0 31 36 33 0 34 30 36 0 32 33 35 0 β€’ Whatever player 𝑗 gets room 4 must pay 0, and the prices of the other rooms must be exactly his values to prevent envy β€’ Easy to verify that 𝑗 can’t be any of the players

  25. WHICH MODEL IS BETTER? β€’ Advantages of quasi-linear utilities: β—¦ Preference elicitation is easy: Each player reports a single number in one shot β—¦ Can choose among EF solutions β€’ Disadvantage of quasi-linear utilities: does not correctly model real-world situations β—¦ I want the room but I really can’t spend more than $500 on rent

  26. INTERFACES NY TIMES (rental harmony) Spliddit (quasi-linear utilities) https://www.nytimes.com/interactive/2014/science/rent-division-calculator.html http://www.spliddit.org/apps/rent

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend