四人无嫉妒分工:个案研究

The 5th International Conference on Information and Communication Technology for The Muslim World (ICT4M) Pub Date : 2014-11-01 DOI:10.1109/ICT4M.2014.7020609

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

{"title":"四人无嫉妒分工:个案研究","authors":"Farin Rahman, Mahjabeen Mostafa, M. M. Hafizur Rahman","doi":"10.1109/ICT4M.2014.7020609","DOIUrl":null,"url":null,"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.","PeriodicalId":327033,"journal":{"name":"The 5th International Conference on Information and Communication Technology for The Muslim World (ICT4M)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Four persons envy-free division: A case study\",\"authors\":\"Farin Rahman, Mahjabeen Mostafa, M. M. Hafizur Rahman\",\"doi\":\"10.1109/ICT4M.2014.7020609\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":327033,\"journal\":{\"name\":\"The 5th International Conference on Information and Communication Technology for The Muslim World (ICT4M)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 5th International Conference on Information and Communication Technology for The Muslim World (ICT4M)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICT4M.2014.7020609\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 5th International Conference on Information and Communication Technology for The Muslim World (ICT4M)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT4M.2014.7020609","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文给出了一种4人无嫉妒除法算法。这种划分的主题是每个人都不会嫉妒别人，即没有人会得到更大的份额。他们会对自己的那份感到满意，并认为他或她得到了最大的那份。在这里，我们提出了两种可能的手术方法，我们使用了尽可能小的切口。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Four persons envy-free division: A case study

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

The 5th International Conference on Information and Communication Technology for The Muslim World (ICT4M)

自引率

0.00%

发文量