▁ 1 1 ▁cut s . ▁For ▁five ▁partners , ▁a ▁procedure ▁by ▁Sab eri ▁and ▁Wang ▁makes ▁an ▁env y - free ▁division ▁with ▁a ▁bounded ▁number ▁of ▁cut s . ▁Both ▁these ▁procedures ▁ ▁use ▁Austin ' s ▁procedure ▁for ▁two ▁partners ▁and ▁general ▁fra ctions ▁as ▁an ▁initial ▁step . ▁Hence , ▁these ▁procedures ▁should ▁be ▁considered ▁infinite ▁- ▁they ▁cannot ▁be ▁completed ▁using ▁a ▁finite ▁number ▁of ▁steps . ▁ ▁For ▁four ▁or ▁more ▁partners , ▁there ▁are ▁three ▁algorithms ▁which ▁are ▁finite ▁but ▁un bounded ▁- ▁there ▁is ▁no ▁fixed ▁bound ▁on ▁the ▁number ▁of ▁cut s ▁required . ▁There ▁are ▁three ▁such ▁algorithms : ▁▁ ▁The ▁Br ams – T aylor ▁protocol , ▁first ▁published ▁in ▁a ▁ 1 9 9 5 ▁paper ▁and ▁later ▁in ▁a ▁ 1 9 9 6 ▁book . ▁ ▁The ▁Robert son – Web b ▁protocol , ▁first ▁published ▁in ▁a ▁ 1 9 9 7 ▁paper ▁and ▁later ▁in ▁a ▁ 1 9 9 8 ▁book . ▁ ▁The ▁P ikh ur ko ▁protocol , ▁published ▁in ▁ 2 0 0 0 . ▁Although ▁the ▁protocol s ▁are ▁different , ▁the ▁main ▁idea ▁behind ▁them ▁is ▁similar : ▁Div ide ▁the ▁c ake ▁to ▁a ▁finite ▁but ▁un bounded ▁number ▁of ▁" cr umb s ", ▁each ▁of ▁which ▁is ▁so ▁small ▁that ▁its ▁value ▁for ▁all ▁partners ▁is ▁neg lig ible . ▁Then ▁combine ▁the ▁cr umb s ▁in ▁a ▁s oph istic ated ▁way ▁to ▁get ▁the ▁desired