Statistical Distance-Based Acceptance Strategy for Desirable Offers in Bilateral Automated Negotiation

Arash Ebrahimnezad, H. Jazayeriy, Faria Nassiri-Mofakham
{"title":"Statistical Distance-Based Acceptance Strategy for Desirable Offers in Bilateral Automated Negotiation","authors":"Arash Ebrahimnezad, H. Jazayeriy, Faria Nassiri-Mofakham","doi":"10.1109/IKT51791.2020.9345612","DOIUrl":null,"url":null,"abstract":"In any negotiation, one of the most important parts of the negotiator's task is deciding whether or not to accept the opponent's offer. Actually, the most challenging thing is answering this question: which offer and when must be accepted? A wide range of simple to sophisticated acceptance strategies have been proposed: simple acceptance strategies which have the constant threshold value and sophisticated strategies that notice both utility and time in order to determine acceptance thresholds. This study introduces a novel statistical acceptance strategy with considering the similarity between the opponent's offer and our previous offers, which is combined with existing usual acceptance strategies. Experiments show our strategy has advantages against the state-of-the-art acceptance strategies.","PeriodicalId":382725,"journal":{"name":"2020 11th International Conference on Information and Knowledge Technology (IKT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 11th International Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IKT51791.2020.9345612","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In any negotiation, one of the most important parts of the negotiator's task is deciding whether or not to accept the opponent's offer. Actually, the most challenging thing is answering this question: which offer and when must be accepted? A wide range of simple to sophisticated acceptance strategies have been proposed: simple acceptance strategies which have the constant threshold value and sophisticated strategies that notice both utility and time in order to determine acceptance thresholds. This study introduces a novel statistical acceptance strategy with considering the similarity between the opponent's offer and our previous offers, which is combined with existing usual acceptance strategies. Experiments show our strategy has advantages against the state-of-the-art acceptance strategies.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
双边自动谈判中基于统计距离的理想出价承诺策略
在任何谈判中,谈判者任务中最重要的部分之一就是决定是否接受对手的提议。实际上,最具挑战性的事情是回答这个问题:什么时候必须接受哪个offer ?已经提出了一系列从简单到复杂的接受策略:具有恒定阈值的简单接受策略和同时注意效用和时间以确定接受阈值的复杂策略。本研究引入了一种新的统计接受策略,该策略考虑了对手出价与我们先前出价的相似性,并与现有的常规接受策略相结合。实验表明,我们的策略与最先进的接受策略相比具有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A New Sentence Ordering Method using BERT Pretrained Model Classical-Quantum Multiple Access Wiretap Channel with Common Message: One-Shot Rate Region Business Process Improvement Challenges: A Systematic Literature Review The risk prediction of heart disease by using neuro-fuzzy and improved GOA Distributed Learning Automata-Based Algorithm for Finding K-Clique in Complex Social Networks
×
引用
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