1 / 29

Fair Shares

Fair Shares. Cake Cutting. Cake Cutting. Solution: One cuts, the other chooses . What is the goal?. Proportional Share Both players think they get at least half the cake Envy Free Both players like their slice at least as much as the other slice. Three Players (A, B, C).

karif
Télécharger la présentation

Fair Shares

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Fair Shares

  2. Cake Cutting Cake Cutting

  3. Solution: One cuts, the other chooses

  4. What is the goal? Proportional Share Both players think they get at least half the cake Envy Free Both players like their slice at least as much as the other slice

  5. Three Players (A, B, C) Proportional Share Every players think they get at least one third of the cake Envy Free Each players like their slice at least as much as any other slice

  6. Three Players (A, B, C) A cuts into 3 (presumably) equal pieces Now what?

  7. If preferred pieces: Then assign: B/C B B C C A What if:

  8. Record first and second preferences for B and C: B B, C C, B C, B C

  9. B,A B B, C B, C C, B C, B C, B C, B A, A C,A C A fills in the gaps:

  10. A fills in the gaps: B B,A B, C C C, B C, B A, A A C,A Split each piece using “one cuts other chooses”: A B C B B C C A

  11. Envy Free Solution A cuts: B: top two equal? Then: C chooses first, B chooses second, A gets last piece. C B A

  12. Envy Free Solution A cuts: B: top two not equal. Then: 1. B trims largest piece to make its top two equal. 2. Set trim, T aside. 3. C chooses favorite piece. 4. B chooses, but must take trimmed piece if available. 5. A gets last piece. 6. Partition T. A C B T

  13. Envy Free Solution A cuts: B: top two not equal. 6. Partition T: Let D be person getting trimmed piece (one of B or C). Let E be other of B and C. a. E divides T into 3 (presumably equal) parts. b. D chooses favorite part of T. c. A chooses remaining favorite part. d. E gets third part. A E D T

  14. Cake Cutting Cake Cutting

  15. Stable Matching • Match medical residents to hospitals • Match men to women • Match students to schools

  16. Unstable Pair a C The match of a to C and b to D is unstable if both b and C prefer each other to their current partners b D Definition: a stable match has no unstable pairs.

  17. Algorithm to find a stable match Preference order A: acba: BAC B: acb b: CBA C: cab c: ABC Capital letters (women) repeatedly propose to next best man (small letters) as needed a: b: c: a:A B b: c: C a:B b: c: C A a: B C b: c: A a: B b: C c: A

  18. Why Stable? a C Unstable instance: Little letters (men) only improve their match over time. Capital letters (women) switch to a lower rank man only when rejected by higher ranked men. Thus b prefers C to D only if he never rejected C. But then C never approached b and so must prefer a. Therefore not unstable. b D a:A B b: c: C a:B b: c: C A a: B C b: c: A a: B b: C c: A

  19. Does it run forever? No! Once a little letter (man) has a suitor, he will always have a suitor. A woman leaves a man only if he has another suitor. If she reaches her bottom ranked man, it follows that all other men have suitors; hence there is no competition on the last man. i.e. every woman gets matched. a:A B b: c: C a:B b: c: C A a: B C b: c: A a: B b: C c: A

  20. How many rounds can the algorithm take?

  21. Quality of Matches Preference order A: cbaa: ACB B: acb b: BAC C: bac c: CBA Match algorithm result: a: B b: C c: A Algorithm result with reversed roles: A: a B: b C: c Best result for women Best result for men (capital letters)

  22. Fair Division of Property among Two People

  23. What is fair? • Divide evenly what is desired by both A’s wants: No Yes YesYes B’s wants: Yes No Yes Yes

  24. What is fair? A: 0 60 40 0 • Give equal value A: 60 40 0 0 B: 40 20 20 20 Sort by: A value / B value: B: 20 20 20 40

  25. What is fair? • Give equal value A: 0 60 40 0 A: 6040 0 0 Sort by: A value / B value: 1/3 B: 40 20 20 20 B: 20 2020 40 2/3

  26. Cheating is Possible True values: 1/3 A: 2121 19 39 A: 6040 0 0 2/3 A misleads: B: 20 2020 40 B: 20 2020 40

  27. Can be too clever True values: A: 4121 19 19 A: 6040 0 0 A not so wise: 1/3 B: 40 2020 20 B: 20 2020 40 2/3

  28. “Market” Solution Give each player 100 units of money Find prices so that each player gets the same value per unit money for the items she receives A: 6040 0 0 B: 20 2020 40 Prices: 60 40 100/3 200/3

  29. Comparison of Results A: 6040 0 0 Values with misleading B: 20 2020 40 Using values Using prices Rules matter!

More Related