{"title":"Optimal Resource Allocation in Network Structures","authors":"V. Burkov, A. Enaleev","doi":"10.1109/MLSD.2018.8551936","DOIUrl":null,"url":null,"abstract":"This article considers the resource allocation problem among several connected agents. An oriented graph without contours represents connections between agents. Any agent can get a resource only if all agents whose outputs connected to this agent’s input get a resource required. We describe two algorithms for this problem solving (exact and heuristic) and represent calculation examples.","PeriodicalId":158352,"journal":{"name":"2018 Eleventh International Conference \"Management of large-scale system development\" (MLSD","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Eleventh International Conference \"Management of large-scale system development\" (MLSD","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MLSD.2018.8551936","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
This article considers the resource allocation problem among several connected agents. An oriented graph without contours represents connections between agents. Any agent can get a resource only if all agents whose outputs connected to this agent’s input get a resource required. We describe two algorithms for this problem solving (exact and heuristic) and represent calculation examples.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
