WASTE MAKES HASTE: Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann BOUNDED-TIME PROTOCOLS FOR ENVY-FREE CAKE CUTTING WITH FREE DISPOSAL.

Slides:

Advertisements

Similar presentations

The Prince This project is worth TWO Exam grades and is due the first class day after Christmas break. Choose ONE from EACH Section Section One: Written.

Advertisements

Claudia Lindner and Jörg Rothe Heinrich-Heine-Universität Düsseldorf Modelling Interaction, Dialog, Social Choice, and Vagueness Amsterdam, March 2010.

Announcement Paper presentation schedule online Second stage open

How to Make the Right Decisions without Knowing People's Preferences: An Introduction to Mechanism Design E. Maskin Harvard University International Conference.

Ariel D. Procaccia (Microsoft)  A cake must be divided between several children  The cake is heterogeneous  Each child has different value for same.

Homework p. 103 (2, 4, 8, 10, 11, 16, 20) 2. a) $ a) $ a) s2, s3 ($7 is fair) b) $4.80 b) $4.50 b) s1, s2 ($6 is fair) c) $6.40 c) $5.40.

Cakes, Pies, and Fair Division Walter Stromquist Swarthmore College Rutgers Experimental Mathematics Seminar October 4, 2007.

Chapter 13: Fair Division Lesson Plan

Better Ways to Cut a Cake Steven Brams – NYU Mike Jones – Montclair State University Christian Klamler – Graz University Paris, October 2006.

CUTTING A BIRTHDAY CAKE Yonatan Aumann, Bar Ilan University.

Fair Division & Apportionment

Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy Rensselaer Polytechnic Institute.

Online Cake Cutting Toby Walsh NICTA and UNSW Sydney, Australia.

Cake Cutting is and is not a Piece of Cake Jeff Edmonds, York University Kirk Pruhs, University of Pittsburgh Jaisingh Solanki, York University.

Cutting a Pie is Not a Piece of Cake Walter Stromquist Swarthmore College Third World Congress of the Game Theory Society Evanston,

Not Everyone Likes Mushrooms: Fair Division and Degrees of Guaranteed Envy-Freeness* Second GASICS Meeting Computational Foundations of Social Choice Aachen,

Selfridge-Conway Fair Division Procedure An Envy-Free Cake Division Procedure.

Dividing a Cake Fairly among n players Thomas Yeo

Chapter 13: Fair Division Lesson Plan

Lau Ting Sum Samson Suen Wai.  Discuss what fairness is  Describe some methods for fair division: 1. Divide-and-choose 2. Last Diminisher 3. Selfridge-Conway.

NOT JUST A CHILD’S PLAY CAKE CUTTING. How does one fairly divide goods among several people?

TRUTH, JUSTICE, AND CAKE CUTTING Yiling Chen, John K. Lai, David C. Parkes, Ariel D. Procaccia (Harvard SEAS) 1.

Chapter 3: The Mathematics of Sharing

TRUTH, JUSTICE, AND CAKE CUTTING Ariel Procaccia (Harvard SEAS) 1.

1 On Approximately Fair Allocations of Indivisible Goods Elchanan Mossel Amin Saberi Richard Lipton Vangelis Markakis Georgia Tech AUEB U. C. Berkeley.

1 Fair Allocations of Indivisible Goods Part I: Minimizing Envy Elchanan Mossel Amin Saberi Richard Lipton Vangelis Markakis Georgia Tech CWI U. C. Berkeley.

TAYLOR NESS SECOND GRADE MRS. STILES LOGANVILLE-SPRINGFIELD ELEMENTARY

Number Sequences Lecture 7: Sep 29 ? overhang. This Lecture We will study some simple number sequences and their properties. The topics include: Representation.

Chapter 14: Fair Division Part 4 – Divide and Choose for more than two players.

Mechanism design for computationally limited agents (previous slide deck discussed the case where valuation determination was complex) Tuomas Sandholm.

Chapter 14: Fair Division Part 5 – Defining Fairness.

Hit PAGE DOWN to go faster or to move to the next slide. Use PAGE DOWN or PAGE UP to move forwards or backwards in the presentation. Hit PAGE DOWN to continue.

I choose these topic because…… I want to learn more about Decorating Cakes! What’s the easy way to Decorate a Cake ? What are the techniques and the.

Fair Division Ch. 13 Finite Math. Fair division There are about 1.2 million divorces every year in the U.S. alone. International disputes redefine borders.

Assignment Question 1. Two networks decide schedules of TV shows to different time slots, respectively. Each TV show has a distinct rating. A network wins.

Fair Division Lone Divider Method.

Game Engineering Robert Aumann Center for the Study of Rationality The Hebrew University of Jerusalem.

Cake Cutting is and is not a Piece of Cake Jeff Edmonds, York University Kirk Pruhs, University of Pittsburgh.

Island Division: Lone-divider Method G G G G G G G G S S G S S S S S S S S S S ABC Gold123 Silver212 Total Fair division

Instructor: Shengyu Zhang 1. Resource allocation General goals:  Maximize social welfare.  Fairness.  Stability. 2.

Gift giving Take out a piece of paper Think about this past Christmas – Estimate the dollar cost of all of the gifts you received – Estimate the dollar.

By: Kuga-Fountain,L. September  September I started off working on the basics like how to use the tools.  I also worked on technique and detail because.

E. LYON 2014 Process Drawing in a Day Using Charcoal/Chalk.

A pie that can’t be cut fairly Walter Stromquist Swarthmore College Fair Division Seminar Dagstuhl, Deutschland June 26, 2007.

SLAB CLAY TECHNIQUE. Overview of steps Day 1: Intro, planning (brainstorm and thumbnail sketch), adapt (if necessary) and cut out templates.

Mathematical Foundations of AI

Fair Division Fair Division Problem: A problem that involves the dividing up of an object or set of objects among several individuals (players) so that.

____________________

Fair-and-Square: Fair Division of Land

Puzzle 1 “You cut, I choose”.

Fair Division Lone Divider Method.

Envy-Free Cake-Cutting in Bounded Time

Mathematical Foundations of AI

Fair division Lirong Xia Oct 7, 2013.

Second Grade Mrs. Stiles Loganville-Springfield Elementary

Intro to the Fair Allocation

LOGO Fair Division MATHEMATICS IN DAILY LIFE Hua Yinglei Hu Zhihao

Warm Up Journal: How would you explain to someone how to properly make a cake or a pie? /4/16.

Envy-Free Cake-Cutting in Two Dimensions

Resource-Monotonicity & Population-Monotonicity In Cake-Cutting

FAIR division (Txt: 3.1 & SOL: DM.7)

Fair Division: the Continuous Case

Island Division: Lone-divider Method

creating your outline (due on the 5th of December, 2016)

Island Division: Lone-divider Method

MUDA: A Truthful Multi-Unit Double-Auction Mechanism

7. Edmonds-Karp Algorithm

Fair Division Fair Division Problem: A problem that involves the dividing up of an object or set of objects among several individuals (players) so that.

Divider-Chooser Method

Presentation transcript:

WASTE MAKES HASTE: Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann BOUNDED-TIME PROTOCOLS FOR ENVY-FREE CAKE CUTTING WITH FREE DISPOSAL

n agents with different tastes “I want lots of flowers” “I love white decorations” “No writing on my piece at all!”

Fairness Proportional Each agent gets a piece worth to it at least 1/ n Envy Free: No agent prefers a piece allotted to someone else

2 agents: Cut and Choose  Alice cuts to equal pieces  Bob chooses better piece BobAlice Proportional Envy free

n agents: General Case ProportionalEnvy-Free 2 agents 2 queries 3+ agents Θ(n log n) Queries (Even&Paz, 1984; Edmonds, 2006; Woeginger, 2007)

ProportionalEnvy-Free 2 agents 2 queries 3+ agents Θ(n log n) Queries (Even&Paz, 1984; Edmonds, 2006; Woeginger, 2007) n agents: General Case Θ(infinity) Queries ! (Su, 1999; Stromquist, 2008)

Previous Work Disconnected pieces:  General valuations: Unbounded time (Brams and Taylor 1995, Robertson and Webb 1997)  Piecewise-constant: O(poly(input)) time (Kurokawa Lai and Procaccia 2013) Connected pieces:  ε -approximate envy-free: Θ(1/ε n ) (Su 1999; Deng and Saberi 2012)

This work

n=3 agents. Value ≥ 1/4  Alice cuts 3 equal pieces.  Bob trims best to equalize to 2 nd -best.  Carl then Bob then Alice choose pieces. Bob Alice Carl Based on Selfridge-Conway 1960.

n agents: General Case  Alice cuts 2 n-2 +1 equal pieces.  Bob trims to make 2 n-3 +1 equal pieces. Using a linear-time algorithm by Reitzig and Wild, ...  Carl trims to make 2 equal best pieces.  Agents choose in inverse order. Value ≥ 1/2 n -1

Envy-Free and Proportional With Waste: Envy-Free Proportional. Can we find in bounded time a division:  Envy-Free  Proportional (Value ≥ 1/ n):  Connected pieces? For n=3: Yes! Details in paper. ? For n ≥ 4: Open question.

Acknowledgements  Financial supporters: BIU Doctoral Fellowships of Excellence Program, ISF grant 1083/13, ISF grant1241/12 and BSF grant  Insightful discussions: Raphael Reitzig, Sebastian Wild, Abhishek Bansai, Pal Gronas Drange, Shaull Almagor, Luke Mathieson, David Richerby, Rick Decker, Instructed A, Frank W, Babou, Tom van der Zanden and the stackexchange.com community. Collaborations are welcome!