Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake...
Transcript of Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake...
![Page 1: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/1.jpg)
Cake Cutting is Not a Piece of
Cake
Malik Magdon-Ismail
Costas Busch
M. S. Krishnamoorthy
Rensselaer Polytechnic Institute
![Page 2: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/2.jpg)
users wish to share a cake
Fair portion : th of cake
N
N
1
![Page 3: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/3.jpg)
The problem is interesting when
people have different preferences
Meg Prefers
Yellow Fish
Tom Prefers
Cat Fish
Example:
![Page 4: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/4.jpg)
Meg Prefers
Yellow Fish
Tom Prefers
Cat Fish
CUTMeg’s Piece Tom’s Piece
Happy Happy
![Page 5: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/5.jpg)
Meg Prefers
Yellow Fish
Tom Prefers
Cat Fish
CUTTom’s Piece Meg’s Piece
Unhappy Unhappy
![Page 6: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/6.jpg)
The cake represents some resource:
• Property which will be shared or divided
•The Bandwidth of a communication line
•Time sharing of a multiprocessor
![Page 7: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/7.jpg)
Fair Cake-Cutting Algorithms:
•Specify how each user cuts the cake
•Each user gets what she considers
to be th of the cakeN/1
•The algorithm doesn’t need to know
the user’s preferences
![Page 8: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/8.jpg)
For users it is known how to divide
the cake fairly with cuts
N
)log( NNO
It is not known if we can do better
than cuts)log( NNO
Steinhaus 1948: “The problem of fair division”
![Page 9: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/9.jpg)
We show that cuts are required
for the following classes of algorithms:
)log( NN
•Phased Algorithms
•Labeled Algorithms
(many algorithms)
(all known algorithms)
Our contribution:
![Page 10: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/10.jpg)
We show that cuts are required
for special cases of envy-free algorithms:
)( 2N
Each user feels she gets more
than the other users
Our contribution:
![Page 11: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/11.jpg)
Cake Cutting Algorithms
Lower Bound for Phased Algorithms
Lower Bound for Labeled Algorithms
Lower Bound for Envy-Free Algorithms
Conclusions
Talk Outline
![Page 12: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/12.jpg)
Cake
knife
![Page 13: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/13.jpg)
Cake
knife cut
![Page 14: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/14.jpg)
Utility Function for user iu
1
1
x
)(xf
Cake
0
![Page 15: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/15.jpg)
1
1
1x
)( 1xf
Cake
0
Value of piece: )( 1xf
![Page 16: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/16.jpg)
Cake
1
1
0 1x 2x
)( 1xf
)( 2xf
Value of piece: )()( 12 xfxf
![Page 17: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/17.jpg)
Cake
10 x
)(xf
Utility Density Function for user iu
![Page 18: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/18.jpg)
“I cut you choose”
Step 1: User 1 cuts at 2/1
Step 2: User 2 chooses a piece
![Page 19: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/19.jpg)
“I cut you choose”
Step 1: User 1 cuts at 2/1
)(1 xf
![Page 20: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/20.jpg)
“I cut you choose”
)(2 xf
Step 2: User 2 chooses a piece
User 2
![Page 21: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/21.jpg)
“I cut you choose”
User 2User 1
Both users get at least of the cake 2/1
Both are happy
![Page 22: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/22.jpg)
Algorithm A
N users
Phase 1: Each user cuts atN
1
![Page 23: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/23.jpg)
Algorithm A
N users
Phase 1: Each user cuts atN
1
![Page 24: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/24.jpg)
Algorithm A
N users
Phase 1: Give the leftmost piece to the
respective user
iu
![Page 25: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/25.jpg)
Algorithm A
1N users
Phase 2: Each user cuts at1
1
N
iu
![Page 26: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/26.jpg)
Algorithm A
1N users
Phase 2: Each user cuts at1
1
N
iu
![Page 27: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/27.jpg)
Algorithm A
1N users
Phase 2:
iu
Give the leftmost piece to the
respective user
ju
![Page 28: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/28.jpg)
Algorithm A
2N users
Phase 3: Each user cuts at2
1
N
iu ju
And so on…
![Page 29: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/29.jpg)
Algorithm A
Total number of phases:
iu ju ku
1N
Total number of cuts:
)(1)2()1( 2NONNN
![Page 30: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/30.jpg)
Algorithm B
N users
Phase 1: Each user cuts at2
1
![Page 31: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/31.jpg)
Algorithm B
N users
Phase 1: Each user cuts at2
1
![Page 32: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/32.jpg)
Algorithm B
users
Phase 1: Find middle cut
2
Nusers
2
N
![Page 33: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/33.jpg)
Algorithm B
2
Nusers
Phase 2: Each user cuts at2
1
![Page 34: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/34.jpg)
Algorithm B
2
Nusers
Phase 2: Each user cuts at2
1
![Page 35: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/35.jpg)
Algorithm B
4
N
Phase 2: Find middle cut
4
Nusers
![Page 36: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/36.jpg)
Algorithm B
4
Nusers
Phase 3: Each user cuts at2
1
And so on…
![Page 37: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/37.jpg)
Algorithm B
Phase log N:
iu
1 user
The user is assigned the piece
![Page 38: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/38.jpg)
Algorithm B
Total number of phases:
iu ju ku
Nlog
Total number of cuts:
)log(
log
NNONNNN
N
![Page 39: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/39.jpg)
Cake Cutting Algorithms
Lower Bound for Phased Algorithms
Lower Bound for Labeled Algorithms
Lower Bound for Envy-Free Algorithms
Conclusions
Talk Outline
![Page 40: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/40.jpg)
Phased algorithm: consists of a
sequence of phases
At each phase:
Each user cuts a piece which is
defined in previous phases
A user may be assigned
a piece in any phase
![Page 41: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/41.jpg)
Observation: Algorithms and are
phased
A B
![Page 42: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/42.jpg)
We show: )log( NN cuts are required
to assign positive valued pieces
![Page 43: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/43.jpg)
Phase 1: Each user cuts according
to some ratio
iu
irju
jrku
kr
1 1 1 1
lu
lr
![Page 44: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/44.jpg)
iu
irju
jrku
kr
There exist utility functions
such that the cuts overlap
lu
lr
1
![Page 45: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/45.jpg)
Phase 2: Each user cuts according
to some ratio
iu
'irju
'jrku
'kr
2 2 2 2
lu
'lr
1
![Page 46: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/46.jpg)
iu ju ku
There exist utility functions
such that the cuts in each piece overlap
lu
12 2
'ir 'jr 'kr 'lr
![Page 47: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/47.jpg)
12 2
Phase 3:
3 3 3 3
number of pieces
at most are doubled
And so on…
![Page 48: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/48.jpg)
Phase k: Number of pieces at most k2
![Page 49: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/49.jpg)
For users:N
we need at least piecesN
we need at least phasesNlog
![Page 50: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/50.jpg)
Phase Users
1 N
Pieces Cuts
2 N
2 2N 4 2N
(min) (max) (min)
3 4N 8 4N
1log N 0 N2 0
…… …… …… ……
Total Cuts: )log( NN
![Page 51: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/51.jpg)
Cake Cutting Algorithms
Lower Bound for Phased Algorithms
Lower Bound for Labeled Algorithms
Lower Bound for Envy-Free Algorithms
Conclusions
Talk Outline
![Page 52: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/52.jpg)
1c2c 3c 4c
111001101000Labels:
each piece has a labelLabeled algorithms:
![Page 53: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/53.jpg)
1c2c 3c 4c
111001101000Labels:
1c
2c
3c
4c
0 1
0 1 0 1
0 100
010 011
10 11
Labeling Tree:
![Page 54: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/54.jpg)
{}
{}
![Page 55: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/55.jpg)
1c
1c0 1
0 1
0 1
![Page 56: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/56.jpg)
1c
1c0 1
00
1
00 101
2c0 1
01
2c
![Page 57: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/57.jpg)
1c
1c0 1
00
1
00 1
2c0 1
2c
011010
3c
0 1
010 011
3c
![Page 58: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/58.jpg)
1c2c 3c 4c
111001101000
1c
2c
0 1
0 1 0 1
0 100
010 011
10 11
4c
3c
![Page 59: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/59.jpg)
111001101000
Sorting Labels
Users receive pieces in arbitrary order:
1p 2p 3p 4p 5p
1p2p3p 4p5p
We would like to sort the pieces:
1p 2p 3p 4p 5p
![Page 60: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/60.jpg)
111001101000
Sorting Labels
1p 2p 3p 4p 5p
Labels will help to sort the pieces
1p2p3p 4p5p
![Page 61: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/61.jpg)
110100011010000
Sorting Labels
1p 2p 3p 4p 5p
1p2p3p 4p5p
Normalize the labels
![Page 62: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/62.jpg)
110100011010000
Sorting Labels
1p 2p 3p 4p 5p
0 1 2 3 4 5 6 7
1p2p3p 4p5p
cuts#2
![Page 63: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/63.jpg)
110100011010000
Sorting Labels
1p 2p 3p 4p 5p
0 1 2 3 4 5 6 7
1p2p
3p
4p5p
011
![Page 64: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/64.jpg)
110100011010000
Sorting Labels
1p 2p 3p 4p 5p
0 1 2 3 4 5 6 7
1p
2p 3p
4p5p
011010
![Page 65: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/65.jpg)
110100011010000
Sorting Labels
1p 2p 3p 4p 5p
0 1 2 3 4 5 6 7
1p
2p 3p
4p
5p
011010 110
![Page 66: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/66.jpg)
110100011010000
Sorting Labels
1p 2p 3p 4p 5p
0 1 2 3 4 5 6 7
1p 2p 3p
4p
5p
011010 110000
![Page 67: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/67.jpg)
110100011010000
Sorting Labels
1p 2p 3p 4p 5p
0 1 2 3 4 5 6 7
1p 2p 3p 4p5p
011010 110000 100
Labels and pieces are ordered!
![Page 68: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/68.jpg)
110100011010000
Sorting Labels
1p 2p 3p 4p 5p
0 1 2 3 4 5 6 7
1p 2p 3p 4p5p
011010 110000 100
Time needed: )(#cutsO
![Page 69: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/69.jpg)
linearly-labeled &
comparison-bounded algorithms:
)(#cutsORequire comparisons
(including handling and sorting labels)
![Page 70: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/70.jpg)
Conjecture: All known algorithms are
linearly-labeled
& comparison-bounded
Observation: Algorithms and are
linearly-labeled &
comparison-bounded
A B
![Page 71: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/71.jpg)
We will show that cuts
are needed for
linearly-labeled & comparison-bounded
algorithms
)log( NN
![Page 72: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/72.jpg)
N distinct positive integers: Nxxx ,,, 21
ijk xxx Sorted order:
Reduction of Sorting to Cake Cutting
Input:
Output:
Using a cake-cutting algorithm
![Page 73: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/73.jpg)
1f 2f Nf
N distinct positive integers: Nxxx ,,, 21
utility functions:
users: 1u 2u Nu
N
N
![Page 74: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/74.jpg)
10
if
ixN
1
iu
Cake
),1min()( zNzf ixi
![Page 75: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/75.jpg)
10
iuif
ju
kuijk xxx
ixN
1jx
N
1
kxN
1
jf
jf
Cake
![Page 76: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/76.jpg)
10
ik xx
iu
ku
Cake
![Page 77: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/77.jpg)
Cake
10
iu
iu
N
1
ku cannot be satisfied!ku
ik xx
![Page 78: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/78.jpg)
10
iu
ku can be satisfied!
iuku
ku
ik xx
ipkp
ik pp
![Page 79: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/79.jpg)
Cake
iujuku
kp jp ip
Rightmost positive valued pieces
ijk xxx
ijk ppp
Piece:
![Page 80: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/80.jpg)
iujuku
kp
ijk xxx
Labels: kl jl il
ijk lll Sorted labels:
Sorted pieces:
Sorted integers:
ijk ppp
jp ip
![Page 81: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/81.jpg)
Fair cake-cutting
Sorting
![Page 82: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/82.jpg)
Sorting integers: )log( NN comparisons
Cake Cutting: )log( NN comparisons
![Page 83: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/83.jpg)
Linearly-labeled &
comparison-bounded algorithms:
)(#cutsORequire comparisons
)log( NN comparisons
)log( NN cuts
require
![Page 84: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/84.jpg)
Cake Cutting Algorithms
Lower Bound for Phased Algorithms
Lower Bound for Labeled Algorithms
Lower Bound for Envy-Free Algorithms
Conclusions
Talk Outline
![Page 85: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/85.jpg)
Envy-free: Each user feels she gets at least
as much as the other users
Variations of Fair Cake-Division
Strong Envy-free:
Each user feels she gets strictly more
Than the other users
![Page 86: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/86.jpg)
Super Envy-free:
A user feels she gets a fair portion,
and every other user gets less than fair
![Page 87: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/87.jpg)
Lower Bounds
Strong Envy-free:
Super Envy-free:
)086.0( 2N cuts
)25.0( 2N cuts
![Page 88: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/88.jpg)
10
iu
if
Strong Envy-Free, Lower Bound
![Page 89: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/89.jpg)
10
ku
kf
Strong Envy-Free, Lower Bound
![Page 90: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/90.jpg)
10
ku
Strong Envy-Free, Lower Bound
iu ju
![Page 91: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/91.jpg)
10
ku
Strong Envy-Free, Lower Bound
iu
ku
ku is upset!
![Page 92: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/92.jpg)
10
ku
Strong Envy-Free, Lower Bound
iu
ku
ku is happy!
![Page 93: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/93.jpg)
Strong Envy-Free, Lower Bound
must get a piece from each
of the other user’s gap
10
kuiu ju
ku
ku
![Page 94: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/94.jpg)
Strong Envy-Free, Lower Bound
A user needs distinct pieces )(N
Total number of cuts: )( 2N
Total number of pieces: )( 2N
![Page 95: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/95.jpg)
Cake Cutting Algorithms
Lower Bound for Phased Algorithms
Lower Bound for Labeled Algorithms
Lower Bound for Envy-Free Algorithms
Conclusions
Talk Outline
![Page 96: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/96.jpg)
We presented new lower bounds
for several classes of
fair cake-cutting algorithms
![Page 97: Cake Cutting is Not a Piece of Cake - bit.csc.lsu.edubusch/slides/2003-STACS-cake.pdf · Cake Cutting is Not a Piece of Cake Malik Magdon-Ismail Costas Busch M. S. Krishnamoorthy](https://reader033.fdocuments.us/reader033/viewer/2022052805/605a20b6424b7b40a7474b75/html5/thumbnails/97.jpg)
Open problems:
•Prove or disprove that every algorithm
is linearly-labeled and comp.-bounded
•An improved lower bound for
envy-free algorithms