The Impact of Information Load on Predicting Success in Electronic Negotiations

被引:0
作者
Kaya, Muhammed-Fatih [1 ]
Schoop, Mareike [1 ]
机构
[1] Univ Hohenheim, Inst Informat Syst, Intelligent Informat Syst, Schwerzstr 40, D-70599 Stuttgart, Germany
关键词
Machine learning; Information growth; Negotiation outcome; Classification; Prediction performance; Model selection; DECISION TREE; NAIVE BAYES; RANDOM FORESTS; CLASSIFICATION; MACHINE; SELECTION; OPTIMIZATION; ALGORITHMS; SEQUENCES; DEADLINES;
D O I
10.1007/s10726-025-09920-5
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The exchange of information is an essential means for being able to conduct negotiations and to derive situational decisions. In electronic negotiations, information is transferred in the form of requests, offers, questions and clarifications consisting of communication and decisions. Taken together, such information makes or breaks the negotiation. Whilst information analysis has traditionally been conducted through human coding, machine learning techniques now enable automated analyses. One of the grand challenges of electronic negotiation research is the generation of predictions as to whether ongoing negotiations will success or fail at the end of the negotiation process by considering the previous negotiation course. With this goal in mind, the present research paper investigates the impact of information load on predicting success and failure in electronic negotiations and how predictive machine learning models react to the successive increase of negotiation data. Information in different data combinations is used for the evaluation of various classification techniques to simulate the progress in negotiation processes and to investigate the impact of increasing information load hidden in the utility and communication data. It will be shown that the more information the merrier the result does not always hold. Instead, data-driven ML model recommendations are presented as to when and based on which data density certain models should or should not be used for the prediction of success and failure of electronic negotiations.
引用
收藏
页码:487 / 521
页数:35
相关论文
共 138 条
[31]  
Fawagreh K, 2015, ARXIV
[32]   Random forests: from early developments to recent advancements [J].
Fawagreh, Khaled ;
Gaber, Mohamed Medhat ;
Elyan, Eyad .
SYSTEMS SCIENCE & CONTROL ENGINEERING, 2014, 2 (01) :602-609
[33]  
Feng-Jen Yang, 2018, 2018 5th International Conference on Computational Science and Computational Intelligence (CSCI), P301, DOI 10.1109/CSCI46756.2018.00065
[34]   Predicting sample size required for classification performance [J].
Figueroa, Rosa L. ;
Zeng-Treitler, Qing ;
Kandula, Sasikiran ;
Ngo, Long H. .
BMC MEDICAL INFORMATICS AND DECISION MAKING, 2012, 12
[35]   What Computers Can Tell Us About Emotions - Classification of Affective Communication in Electronic Negotiations by Supervised Machine Learning [J].
Filzmoser, Michael ;
Koeszegi, Sabine T. ;
Pfeffer, Guenther .
GROUP DECISION AND NEGOTIATION: THEORY, EMPIRICAL EVIDENCE, AND APPLICATION, GDN 2016, 2017, 274 :113-123
[36]  
Freund Y., 1996, Proceedings of the Thirteenth International Conference on Machine Learning, P148
[37]   Random Forests for Big Data [J].
Genuer, Robin ;
Poggi, Jean-Michel ;
Tuleau-Malot, Christine ;
Villa-Vialaneix, Nathalie .
BIG DATA RESEARCH, 2017, 9 :28-46
[38]   A Study on Support Vector Machine based Linear and Non-Linear Pattern Classification [J].
Ghosh, Sourish ;
Dasgupta, Anasuya ;
Swetapadma, Aleena .
PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INTELLIGENT SUSTAINABLE SYSTEMS (ICISS 2019), 2019, :24-28
[39]  
Goodfellow I, 2016, ADAPT COMPUT MACH LE, P1
[40]  
Grandini M., 2020, ARXIV