不完全信息下具有非线性效用函数的多可分资源的Agent协商

Xiangrong Tong, Wei Zhang
{"title":"不完全信息下具有非线性效用函数的多可分资源的Agent协商","authors":"Xiangrong Tong, Wei Zhang","doi":"10.1109/ICSAI.2012.6223085","DOIUrl":null,"url":null,"abstract":"Agent negotiation over multiple divisible resources under incomplete information is a challenging task. Previous researches are mostly based on linear utility functions. However, lots of various instances show that the relationship between utilities and resources is usually saturated nonlinear, just as indicated by Wooldridge. To this end, we expand linear utility functions to nonlinear cases according to the law of diminishing marginal utility. Furthermore, we propose a negotiation model over multiple divisible resources with two phases. In the first phase, we take resources as indivisible units to reach a preliminary agreement which is the base of phase two at the same time. Sequentially, we divide resources using a greedy algorithm in the second phase to realize Pareto optimal results. The computational complexity of the proposed algorithm is proved to be polynomial order. Experimental results show that the optimal efficiency of the algorithm is distinctly higher than previous work.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Agent negotiation over multiple divisible resources with nonlinear utility functions under incomplete information\",\"authors\":\"Xiangrong Tong, Wei Zhang\",\"doi\":\"10.1109/ICSAI.2012.6223085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Agent negotiation over multiple divisible resources under incomplete information is a challenging task. Previous researches are mostly based on linear utility functions. However, lots of various instances show that the relationship between utilities and resources is usually saturated nonlinear, just as indicated by Wooldridge. To this end, we expand linear utility functions to nonlinear cases according to the law of diminishing marginal utility. Furthermore, we propose a negotiation model over multiple divisible resources with two phases. In the first phase, we take resources as indivisible units to reach a preliminary agreement which is the base of phase two at the same time. Sequentially, we divide resources using a greedy algorithm in the second phase to realize Pareto optimal results. The computational complexity of the proposed algorithm is proved to be polynomial order. Experimental results show that the optimal efficiency of the algorithm is distinctly higher than previous work.\",\"PeriodicalId\":164945,\"journal\":{\"name\":\"2012 International Conference on Systems and Informatics (ICSAI2012)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Systems and Informatics (ICSAI2012)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSAI.2012.6223085\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Systems and Informatics (ICSAI2012)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAI.2012.6223085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

不完全信息下多个可分割资源的Agent协商是一个具有挑战性的任务。以往的研究大多基于线性效用函数。然而,大量的各种实例表明,正如Wooldridge所指出的那样,效用与资源之间的关系通常是饱和非线性的。为此,根据边际效用递减规律,将线性效用函数扩展到非线性情形。在此基础上,提出了一个分两个阶段的多可分割资源协商模型。在第一阶段,我们将资源作为不可分割的单位,达成初步协议,这是同时进行第二阶段的基础。其次,在第二阶段采用贪心算法进行资源划分,实现Pareto最优结果。证明了该算法的计算复杂度为多项式阶。实验结果表明,该算法的最优效率明显高于以往的工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Agent negotiation over multiple divisible resources with nonlinear utility functions under incomplete information
Agent negotiation over multiple divisible resources under incomplete information is a challenging task. Previous researches are mostly based on linear utility functions. However, lots of various instances show that the relationship between utilities and resources is usually saturated nonlinear, just as indicated by Wooldridge. To this end, we expand linear utility functions to nonlinear cases according to the law of diminishing marginal utility. Furthermore, we propose a negotiation model over multiple divisible resources with two phases. In the first phase, we take resources as indivisible units to reach a preliminary agreement which is the base of phase two at the same time. Sequentially, we divide resources using a greedy algorithm in the second phase to realize Pareto optimal results. The computational complexity of the proposed algorithm is proved to be polynomial order. Experimental results show that the optimal efficiency of the algorithm is distinctly higher than previous work.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
About feedback vaccination rules for a true-mass action-type SEIR epidemic model Enhanced accuracy of position based on Multi-mode location system Formal verification of signature monitoring mechanisms using model checking How to cope with the evolution of classic software during the test generation based on CPN Soil moisture quantitative study of the Nanhui tidal flat in the Yangtze River Estuary by using ENVISAT ASAR data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1