FAIR DIVISION

ALGORITHMS
Presented by Group
InfinityxBeyond
Our
Team
Priyanshi Garg
Diya Agrawal
Sarthak Ghosh
Project overview
.This project covers:-
Overview of fair division algorithms
Assumptions
Dubins Spanier Moving Knife Protocol
Lone Chooser Protocol
Lone Divider Protocol
Conclusion
What is
Fair
Division
Algorithm?
 1) Fair division algorithms are a set of mathematical and
computational techniques used to divide a set of resources or
goods among a group of participants in a way that is considered
fair or equitable.

2) These algorithms are often used in various real-world scenarios

3) However, we need to make certain assumptions as it is not

1) Normalization
2) Fair and rational play by all players
3) No prior information to any player about the valuation of others
4) Property of positivity and additivity
 Dubins spanier moving
knife protocol
It is a fair division protocol designed for
allocation of continuous resources , such as
cake/ land among multiple individuals in order
to ensure fairness .
The first n-1 portions are all assigned in same
way and the last remaining player receives all the
remaining cake.
 process
Step 1 Step 2
The knife cuts the cake at the current position and the
ld ab ov e th e ca ke an d is moved
A kn ife is he player who stops will obtain the piece currently to the
lly an d co nt in uo us ly fr om th e le ft to right
gradua left of the knife
.
until any of the players calls “STOP” .The player who has received the cake will drop out
n th e pl ay er co ns id er s th e pi ec e of cake
This is whe of the process
n.
to the left of the knife to be worth 1/

Step 3
The remaining players will continue to partake
until everyone receives a piece of cake.
The last player does not need to call stop since he
will be getting anything leftover by default.
 Conclusion
Dubin spanier protocol is :-
PROPORTIONAL- Each person makes a cut that maximizes their own
value at each step and receives a share of cake i.e. atleast valueable to
them as their proportional entitlement based on their prefrences.

NOT ENVY FREE - As players make cuts to maximize their own utility
at each step, it is possible to envy someone else’s allocation.
 The Lone Chooser
Protocol
It is a fair division protocol in which, at every
rounds, all but one player cuts the cake.
The non-cutting player then chooses wisely from
all the pieces available, thus called the “lone-
chooser”.
This protocol requires the number of players to
increase with every round and it assigns all
portions in the very last round.
 process
Round 1 Round 2
P1 divides his piece of cake into 3 pieces, such that
Let there be a cake X=1, which would be shared by n he values each piece 1/6.
players P1,P2,p3.....Pn. P1 and P2 start the game. P2 divides each piece of his cake into three pieces,
P1 cuts the cake in such a way such that he values such that he values each piece >=1/6.
both pieces as 1/2. P3 chooses most valuable piece from P1 and P2.
P2 then chooses a piece from the two which he
values >=1/2.

Round n-1
Thus for each i , 1<=i<=n-1, Pi so far has a share Ti
such that Vi(Ti)>=1/(n-1) and cuts Ti into n pieces such
that for each piece, his valuation for that piece is
1/((n)*(n-1)). Thus player Pn chooses one piece which is
most valuable to them from each n-1 players.
 Conclusion
Lone chooser protocol is :-
A protocol in which a player’s portion does not need to be contiguous but might be a
collection of noncontiguous pieces.

PROPORTIONAL- Each person makes a cut that maximizes their own value at each
step and receives a share of cake i.e. atleast valueable to them as their proportional
entitlement based on their prefrences.

NOT ENVY FREE - Lone Chooser Protocol is such a protocol where does not
guarantee for any of the players that they will not envy any of the n − 1 other players.
Rather the 1st player has slight disadvantage.
 Project Conclusion
By discussing these protocols we conclude the following :-

There is no finite envy-free cake-cutting protocol for n ≥ 3 players that

Both the protocols are not pareto optimal as no player is harmed at the
benifit of another.
Thank You
Any
Questions