E-Commerce Decision Model Based on Auto-Learning

E-Commerce Decision Model Based on Auto-Learning

Xin Tian (Yancheng Institute of Technology, Beijing, China), Yubei Huang (Yancheng Institute of Technology, Beijing, China), Lu Cai (Yancheng Institute of Technology, Beijing, China) and Hai Fang (Yancheng Institute of Technology, Beijing, China)
Copyright: © 2017 |Pages: 15
DOI: 10.4018/JECO.2017100105
OnDemand PDF Download:
No Current Special Offers


The proposed model utilizes the information implied in the history of E-commerce negotiation to automatically mark the data to form the training samples, and apply the clues binary decision tree to automatically learn the samples to obtain the estimate of the opponent difference function. Then, an incremental decision-making problem is constituted through the combination of its own and the opponent's difference functions; and the dispersion algorithm is adopted to solve the optimization problem. The experimental results show that, the model still demonstrates relatively high efficiency and effectiveness under the condition of information confidentiality and no priori knowledge.
Article Preview


With the rapid development of multi-agent technology, the application of agent technology in the field of e-commerce has become more and more extensive. Agent can help human users deal with complicated business activities more efficiently. In the e-commerce activities, auto-learning is the most core part, therefore, it has become the key content of e-commerce based on Agent. The research of auto-learning mainly includes three aspects (Hsu et al., 2015): 1) Agreement of Negotiation (Du et al., 2007): The rule set that the participants of the negotiation must comply with in the interaction. 2) Content of Negotiation (Tremel et al., 2016): The composition of the issues required for negotiation and the value region of all the issues under negotiation, etc. 3) Negotiation strategy (Fatima et al., 2007, Mok et al., 2005, Rahwan et al., 2007): Under the specific agreement of negotiation, how the negotiation agent selects the action of negotiation to be executed according to the current status information. This paper mainly focuses on the research of the strategy of negotiation under the bilateral multi-issue agreement (Águila et al., 2015, Gerding et al., 2006).

The study of negotiation strategy has made a lot of valuable research results. Especially in recent years, the auto-learning method has been introduced into the decision model, which has become a new research hotspot in this field. Bayesian learning (Morente-Molinera et al., 2015) may be the most widely applied learning method in the negotiation decision models. In this method, the Agent first needs to establish an opponent's preference or set of hypotheses, and set the initial probability of these assumptions; in the process of the negotiation, according to the opponent's negotiation, using Bayesian rules Update the probability of these assumptions; and finally make use of the probability distribution of these assumptions to make the negotiation decision. The evolutionary computing method encodes the strategy into genes (Gerding et al., 2006), which are constantly evolved by mutation, crossover and selection, etc., in order to arrive at an optimal strategy. The Kernel Density Estimation (referred to as KDE for short) method (Coehoorn et al., 2004) first estimates the weight of each item in the opponent's negotiation, and then calculates the counter negotiation which is most similar to the opponent's suggestion according to the similarity function and the weight of the opponent's item. The domestic research on the negotiation strategy also made a lot of achievements. For example, in literature (Stern et al., 2015), the problem of selection of sales agent is transformed into K-armed bandit problem, and the measurement model of trust and reputation is put forward. Combined with the K-arm gambling machine problem solving technique, with the application of the learning mechanism, several improved algorithms for determining the distribution of reward are proposed; based on the simulation process, the improved algorithm, trust and reputation are organically combined to select the sales agent. In literature (Gao et al., 2006), a multi-issue negotiation model (MN) is proposed, and on this basis an accelerating chaotic evolutionary algorithm (ACEA) is put forward. ACEA algorithm introduces the chaos mechanism into evolutionary computing, and adopts the compression technique to accelerate the algorithm.

Complete Article List

Search this Journal:
Volume 20: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 19: 4 Issues (2021)
Volume 18: 4 Issues (2020)
Volume 17: 4 Issues (2019)
Volume 16: 4 Issues (2018)
Volume 15: 4 Issues (2017)
Volume 14: 4 Issues (2016)
Volume 13: 4 Issues (2015)
Volume 12: 4 Issues (2014)
Volume 11: 4 Issues (2013)
Volume 10: 4 Issues (2012)
Volume 9: 4 Issues (2011)
Volume 8: 4 Issues (2010)
Volume 7: 4 Issues (2009)
Volume 6: 4 Issues (2008)
Volume 5: 4 Issues (2007)
Volume 4: 4 Issues (2006)
Volume 3: 4 Issues (2005)
Volume 2: 4 Issues (2004)
Volume 1: 4 Issues (2003)
View Complete Journal Contents Listing