• DocumentCode
    240386
  • Title

    Four persons envy-free division: A case study

  • Author

    Rahman, Farin ; Mostafa, Mahjabeen ; Hafizur Rahman, M.M.

  • Author_Institution
    Dept. of CSE, Khulna Univ. of Eng. & Technol., Khulna, Bangladesh
  • fYear
    2014
  • fDate
    17-18 Nov. 2014
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    In this paper we present an algorithm for 4 person envy free division. The theme of this division is that each and every person will not envious to other i.e. no one will receive larger piece. They will be satisfied with their own portion and will think that he or she received the largest piece. Here we present two possible procedures and we used as minimal cuts as possible.
  • Keywords
    game theory; cake-cutting algorithms; four persons envy-free division; minimal cuts; Abstracts; Computer science; Concrete; Educational institutions; Electronic mail; Observers; Shape; Cake-Cutting Algorithm; Envy-Free Division; Fair Division;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information and Communication Technology for The Muslim World (ICT4M), 2014 The 5th International Conference on
  • Conference_Location
    Kuching
  • Type

    conf

  • DOI
    10.1109/ICT4M.2014.7020609
  • Filename
    7020609
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=240386