电子商务中一对多协商研究
|
摘要
目前电子商务已经走进寻常百姓家中,人们愿意并慢慢习惯去淘宝网(www.taobao.com)等购物网站购买商品。中国互联网数据中心(DCCI)于2008年7月15日公布:2008年上半年中国互联网用户互联网消费规模为2560亿元,同比增长58.2%。目前的购物网站中采用的定价方式有:一口价、拍卖和代理出价。这些都属于半智能化商务活动,一口价方式过于简单,拍卖方式需要实时的人机交互,代理出价相对简单且风险较大。更重要的是这些方式都是单向的,没有把传统商务中的最具智慧的、灵活多变的、双向交互的协商机制引入进来。
分布式人工智能中Agent技术的发展和逐步成熟为电子商务的自动化和智能化提供了技术保障。基于Agent的电子商务极大的提高了电子商务自动化和智能化程度,将进一步推动电子商务的发展。协商作为商务活动中的一至关重要的组成部分,它的结果直接影响商务活动的继续执行。自动协商是基于Agent系统的一种重要交互方式,目前协商问题是多Agent系统研究的热点。根据协商活动中参与者的数量,自动协商分为3类:一对一协商、一对多协商和多对多协商。一对一协商最早被研究、比较简单;一对多协商被处理为多个并发的一对一协商;多对多协商可以由多个一对多协商扩展而来。
本文研究电子商务中一对多协商模式。主要的研究内容和创新工作包括:
①一对多协商模型研究
在现有的一对多协商模型研究基础上,提出一个更加灵活的连续一对多协商模型。该模型支持连续协商,满足开放和动态的协商环境。与一般的一对多协商模型相比,我们主要在三个方面进行了改进:1)支持连续协商,节约协商时间,提高协商效率。协商线程不需要一直等到接收完了所有卖家Agent的提议之后才能够生成反提议,即协商线程之间不需要相互等待。2)满足开放和动态的协商环境要求,适应性更强。在协商过程中,新的卖家可以加入,现有卖家可以撤离。3)使用基于相对效用的协调策略来选择最优的协定,达成协定的效用更高,成本更低。
②让步型协商策略研究
为了进一步提高和优化让步协商策略(基于时间的协商策略、基于对手行为的协商策略等)达成的初步协商解的质量,提出了基于等效置换的协商策略。等效置换充分利用多议题协商效用评估机制中各议题之间的相关性,在保证协商者既得利益的前提下动态改变某些议题的取值,促使协商双方得到更优的协商解,并同时提高联合效用。
③学习型协商策略研究
把机器学习方法引入Agent中,赋予Agent学习能力,使Agent具有更强的智能性。论文分别对贝叶斯学习、增强学习、遗传算法等几种主流的学习机制进行研究。并对基于增强学习的协商策略进行优化,在协商过程中充分利用对手的历史信息,综合增强学习和对手历史学习策略,加快协商解的收敛和提高协商解的质量。
④协调策略研究
一对多协商可以看成是多个并发的一对一协商,这就需要一个协调者使用协调策略来管理这些并发的协商。协调策略确保多个并发的一对一协商能够有效、有序和健壮的进行。在研究了现有协调策略(孤注一掷策略、耐心策略、最优耐心策略、策略操纵策略、固定等待时间策略、固定等待率策略等)基础上,提出了基于相对效用的协商协调策略,该策略能够很好地解决当多个并发协商进程同时获得满足效用评估的提议,特别是存在多个相同最大效用提议时的取舍问题,确保得到效用更高,成本更低的协商解。
⑤最佳卖家撤离管理机制研究
在现有一对多协商模型的基础上分析了在协商过程中当前最佳卖家撤离对系统的影响,包括最终协商解的效用下降、协商时间延长等,提出了三种协调策略:策略1:不管,继续执行(Let it be);策略2:以次最佳卖家的信念继续执行(Second);策略3:重新开始(Restart)。建立具有承诺管理机制的一对多协商模型来制约当前最佳卖家的撤离,改善系统性能,并给系统提供了更加灵活的机制。
论文对一对多协商的几个主要方面进行了全面研究,包括协商模型、协商策略、协调策略和管理机制。既继承了前人的研究结果,又分别进行了扩展和创新,具有前沿性、理论价值和实用意义。
Nowadays, Electronic Commerce has already come into our homely lives. People are willing to go to shopping at some shopping websites, such as taobao (www.taobao.com), and slowly form a habit. On July 15, 2008, Data Center of the China Internet (DCCI) published the research data for the first half of 2008, which shows that the Internet consumption of the Chinese Internet users was 256 billion, increased by 58.2% as compared with the same period last year. But the typical pricing methods of these shopping websites are the fixed price, auction and bid by agent, which are all semi-intelligent. Fixed price is too simple; Auction needs real time interaction between men and machine; Bid by agent is relative simple and has a large risk. Furthermore, these methods are all unilateral, while negotiation mechanism is most sapiential, flexible and bilateral.
With the development and increasingly ripeness of Agent technology of Distributed Artificial Intelligence (DAI), it is possible to make Electronic Commerce automatic and intelligent. Electronic Commerce based on agent enhances the automatization and intelligence of business process, which will improve the development of Electronic Commerce. Negotiation is a most important phase of business process, directly affects sequent execution of whole business process. Automated negotiation is a key form of interaction in agent-based systems. Now negotiation is a hot research of Multiple Agent System (MAS). In terms of the number of agents participating in negotiation, agent-based automated negotiation can be divided into three cases: one-to-one negotiation (bilateral negotiation), one-to-many negotiation and many-to-many negotiation. One-to-one negotiation is researched earliest of these three cases; one-to-many negotiation can be seen as multiple concurrent one-to-one (bilateral) negotiations; many-to-many negotiation can be extended from multiple one-to-many negotiation.
This paper researches on one-to-many negotiation in Electronic Commerce. The following are the main research contents and the innovations.
①Research on one-to-many negotiation model
Based on research of the existing general one-to-many negotiation model, a more flexible one-to-many negotiation model is proposed. This model supports continuous, open and dynamic negotiation. Compared with the general model, the advantages of our flexible model are: 1) Our model supports continuous negotiation which can decrease negotiation time, improve negotiation efficiency. Buyer agent should not wait until having received offers from all its trading partners before generating counteroffers, that is, negotiation threads need not wait each other. 2) Our model satisfies the requirement of open and dynamic settings. In the middle of negotiation, new seller agent can join, and the existing seller can leave at any time. 3) Our model uses the coordination strategy based on relative utility to select the best agreement which has the higher utility and lower cost.
②Research on concession negotiation strategies
In order to enhance and optimize the negotiation result reached by concession negotiation strategies (Time-based negotiation strategy, opponent-behavior-based negotiation strategy), equal-utility exchange negotiation strategy is proposed based on the concession negotiation strategies. Equal-utility exchange makes use of the relationship between the agent’s negotiation-related issues of the multi-issues utility evaluation mechanism. In order to get a better negotiation result, values of some issues are adjusted, ensuring the utility of agent not lower. Equal-utility exchange negotiation strategy can enhance joint utility partly and reach a better negotiation result than concession negotiation strategies.
③Research on learning negotiation strategies
Importing machine learning to agent can make agent have the ability of learning, reasoning and intelligence. This paper firstly researches these popular machine learning, such as Bayesian learning, reinforcement learning and genetic algorithm. Then this paper proposes an optimized negotiation strategy based on reinforcement learning. In the middle of negotiation process, it makes the best use of the opponent’s negotiation history, in order to quicken the negotiation result convergence and enhance the negotiation result quality.
④Research on coordination strategies
One-to-many negotiation can be look as multiple, concurrent one-to-one (bilateral) negotiations. This needs a coordinator use coordination strategies to coordinate these multiple, concurrent one-to-one negotiations in one-to-many negotiation. Firstly,this paper researches several existing coordination strategies: Desperate Strategy, Patient Strategy, Optimized Patient Strategy, Strategy Manipulation Strategies, Fixed-Waiting-Time-Based Strategy, and Fixed-Waiting-Ratio-Based Strategy. Then relative utility theory is proposed. Next, coordination strategy based on relative utility is proposed. This coordination strategy can deal well when multiple, concurrent one-to-one negotiations all satisfy utility evaluation, especially having multiple maximum same utility offers at the same time. Coordination strategy insures multiple, concurrent one-to-one negotiations get the best negotiation result which has high utility and low cost.
⑤Research on management mechanism for the best seller withdrawing
Firstly, influence of the current best seller withdrawing is analyzed based on the existing one-to-many negotiation model, including decrease of final utility value and prolonging of average negotiation time; and three coordinating strategies were proposed. Then, one-to-many negotiation model with commitment management which used to restrict the current best seller withdrawing was created. Commitment management could reduce the probability of withdrawing of the current best seller, decrease influence of system performance and provide a more flexible mechanism for one-to-many negotiation model.
This paper thoroughly researches several main aspects of one-to-many negotiation, including negotiation model, negotiation strategy, coordination strategy, and management mechanism. Our researches not only succeed to the research results of predecessor, but also develop the research and get innovations, which are frontier , and of theoretical and practical value.
分布式人工智能中Agent技术的发展和逐步成熟为电子商务的自动化和智能化提供了技术保障。基于Agent的电子商务极大的提高了电子商务自动化和智能化程度,将进一步推动电子商务的发展。协商作为商务活动中的一至关重要的组成部分,它的结果直接影响商务活动的继续执行。自动协商是基于Agent系统的一种重要交互方式,目前协商问题是多Agent系统研究的热点。根据协商活动中参与者的数量,自动协商分为3类:一对一协商、一对多协商和多对多协商。一对一协商最早被研究、比较简单;一对多协商被处理为多个并发的一对一协商;多对多协商可以由多个一对多协商扩展而来。
本文研究电子商务中一对多协商模式。主要的研究内容和创新工作包括:
①一对多协商模型研究
在现有的一对多协商模型研究基础上,提出一个更加灵活的连续一对多协商模型。该模型支持连续协商,满足开放和动态的协商环境。与一般的一对多协商模型相比,我们主要在三个方面进行了改进:1)支持连续协商,节约协商时间,提高协商效率。协商线程不需要一直等到接收完了所有卖家Agent的提议之后才能够生成反提议,即协商线程之间不需要相互等待。2)满足开放和动态的协商环境要求,适应性更强。在协商过程中,新的卖家可以加入,现有卖家可以撤离。3)使用基于相对效用的协调策略来选择最优的协定,达成协定的效用更高,成本更低。
②让步型协商策略研究
为了进一步提高和优化让步协商策略(基于时间的协商策略、基于对手行为的协商策略等)达成的初步协商解的质量,提出了基于等效置换的协商策略。等效置换充分利用多议题协商效用评估机制中各议题之间的相关性,在保证协商者既得利益的前提下动态改变某些议题的取值,促使协商双方得到更优的协商解,并同时提高联合效用。
③学习型协商策略研究
把机器学习方法引入Agent中,赋予Agent学习能力,使Agent具有更强的智能性。论文分别对贝叶斯学习、增强学习、遗传算法等几种主流的学习机制进行研究。并对基于增强学习的协商策略进行优化,在协商过程中充分利用对手的历史信息,综合增强学习和对手历史学习策略,加快协商解的收敛和提高协商解的质量。
④协调策略研究
一对多协商可以看成是多个并发的一对一协商,这就需要一个协调者使用协调策略来管理这些并发的协商。协调策略确保多个并发的一对一协商能够有效、有序和健壮的进行。在研究了现有协调策略(孤注一掷策略、耐心策略、最优耐心策略、策略操纵策略、固定等待时间策略、固定等待率策略等)基础上,提出了基于相对效用的协商协调策略,该策略能够很好地解决当多个并发协商进程同时获得满足效用评估的提议,特别是存在多个相同最大效用提议时的取舍问题,确保得到效用更高,成本更低的协商解。
⑤最佳卖家撤离管理机制研究
在现有一对多协商模型的基础上分析了在协商过程中当前最佳卖家撤离对系统的影响,包括最终协商解的效用下降、协商时间延长等,提出了三种协调策略:策略1:不管,继续执行(Let it be);策略2:以次最佳卖家的信念继续执行(Second);策略3:重新开始(Restart)。建立具有承诺管理机制的一对多协商模型来制约当前最佳卖家的撤离,改善系统性能,并给系统提供了更加灵活的机制。
论文对一对多协商的几个主要方面进行了全面研究,包括协商模型、协商策略、协调策略和管理机制。既继承了前人的研究结果,又分别进行了扩展和创新,具有前沿性、理论价值和实用意义。
Nowadays, Electronic Commerce has already come into our homely lives. People are willing to go to shopping at some shopping websites, such as taobao (www.taobao.com), and slowly form a habit. On July 15, 2008, Data Center of the China Internet (DCCI) published the research data for the first half of 2008, which shows that the Internet consumption of the Chinese Internet users was 256 billion, increased by 58.2% as compared with the same period last year. But the typical pricing methods of these shopping websites are the fixed price, auction and bid by agent, which are all semi-intelligent. Fixed price is too simple; Auction needs real time interaction between men and machine; Bid by agent is relative simple and has a large risk. Furthermore, these methods are all unilateral, while negotiation mechanism is most sapiential, flexible and bilateral.
With the development and increasingly ripeness of Agent technology of Distributed Artificial Intelligence (DAI), it is possible to make Electronic Commerce automatic and intelligent. Electronic Commerce based on agent enhances the automatization and intelligence of business process, which will improve the development of Electronic Commerce. Negotiation is a most important phase of business process, directly affects sequent execution of whole business process. Automated negotiation is a key form of interaction in agent-based systems. Now negotiation is a hot research of Multiple Agent System (MAS). In terms of the number of agents participating in negotiation, agent-based automated negotiation can be divided into three cases: one-to-one negotiation (bilateral negotiation), one-to-many negotiation and many-to-many negotiation. One-to-one negotiation is researched earliest of these three cases; one-to-many negotiation can be seen as multiple concurrent one-to-one (bilateral) negotiations; many-to-many negotiation can be extended from multiple one-to-many negotiation.
This paper researches on one-to-many negotiation in Electronic Commerce. The following are the main research contents and the innovations.
①Research on one-to-many negotiation model
Based on research of the existing general one-to-many negotiation model, a more flexible one-to-many negotiation model is proposed. This model supports continuous, open and dynamic negotiation. Compared with the general model, the advantages of our flexible model are: 1) Our model supports continuous negotiation which can decrease negotiation time, improve negotiation efficiency. Buyer agent should not wait until having received offers from all its trading partners before generating counteroffers, that is, negotiation threads need not wait each other. 2) Our model satisfies the requirement of open and dynamic settings. In the middle of negotiation, new seller agent can join, and the existing seller can leave at any time. 3) Our model uses the coordination strategy based on relative utility to select the best agreement which has the higher utility and lower cost.
②Research on concession negotiation strategies
In order to enhance and optimize the negotiation result reached by concession negotiation strategies (Time-based negotiation strategy, opponent-behavior-based negotiation strategy), equal-utility exchange negotiation strategy is proposed based on the concession negotiation strategies. Equal-utility exchange makes use of the relationship between the agent’s negotiation-related issues of the multi-issues utility evaluation mechanism. In order to get a better negotiation result, values of some issues are adjusted, ensuring the utility of agent not lower. Equal-utility exchange negotiation strategy can enhance joint utility partly and reach a better negotiation result than concession negotiation strategies.
③Research on learning negotiation strategies
Importing machine learning to agent can make agent have the ability of learning, reasoning and intelligence. This paper firstly researches these popular machine learning, such as Bayesian learning, reinforcement learning and genetic algorithm. Then this paper proposes an optimized negotiation strategy based on reinforcement learning. In the middle of negotiation process, it makes the best use of the opponent’s negotiation history, in order to quicken the negotiation result convergence and enhance the negotiation result quality.
④Research on coordination strategies
One-to-many negotiation can be look as multiple, concurrent one-to-one (bilateral) negotiations. This needs a coordinator use coordination strategies to coordinate these multiple, concurrent one-to-one negotiations in one-to-many negotiation. Firstly,this paper researches several existing coordination strategies: Desperate Strategy, Patient Strategy, Optimized Patient Strategy, Strategy Manipulation Strategies, Fixed-Waiting-Time-Based Strategy, and Fixed-Waiting-Ratio-Based Strategy. Then relative utility theory is proposed. Next, coordination strategy based on relative utility is proposed. This coordination strategy can deal well when multiple, concurrent one-to-one negotiations all satisfy utility evaluation, especially having multiple maximum same utility offers at the same time. Coordination strategy insures multiple, concurrent one-to-one negotiations get the best negotiation result which has high utility and low cost.
⑤Research on management mechanism for the best seller withdrawing
Firstly, influence of the current best seller withdrawing is analyzed based on the existing one-to-many negotiation model, including decrease of final utility value and prolonging of average negotiation time; and three coordinating strategies were proposed. Then, one-to-many negotiation model with commitment management which used to restrict the current best seller withdrawing was created. Commitment management could reduce the probability of withdrawing of the current best seller, decrease influence of system performance and provide a more flexible mechanism for one-to-many negotiation model.
This paper thoroughly researches several main aspects of one-to-many negotiation, including negotiation model, negotiation strategy, coordination strategy, and management mechanism. Our researches not only succeed to the research results of predecessor, but also develop the research and get innovations, which are frontier , and of theoretical and practical value.
引文
[1]史忠植.智能Agent及其应用[M].北京:科学出版社, 2000.
[2]李双庆,程代杰. B2B电子商务协作模型研究[J].计算机科学, 2002, 30(4):102-104.
[3] R. H. Guttman, A. G. Moukas, P. Maes. Agent-Mediated Electronic Commerce: A Survey [J]. Knowledge Engineering Review, 1998, 13(2):147-159.
[4] H.Minghua, N. R. Jennings, L. Ho-Fung. On agent-mediated electronic commerce [J]. IEEE Transactions on Knowledge and Data Engineering, 2003, 15(4):985-1003.
[5] Michael Wooldridge著,石纯一等译.多Agent系统引论[M].北京:电子工业出版社, 2003.
[6] R. J. Lewicki, D. M. Saunders, J. W. Minton. Essentials of Negotiation [M]. Boston : Irwin McGraw-Hill, 2 edition, 2000.
[7] N. R, Jennings, P. Faratin. A. R. Lomuscio, S. Parsons, C. Sierra and M.Wooldridge. Automated negotiation: prospects, methods and challenges [J]. International Journal of Group Decision and Negotiation, 2001, 10(2):199-215.
[8]张维迎.博弈论与信息经济学[M].上海:上海人民出版社, 1996.
[9] G. Zlotkin, J. Rosenchein. A domain theory for task oriented negotiation [C]. Proceeding of the American Association of Artificial Intelligence, San Jose, CA, 1992, 148-153.
[10] S. Kraus. Beliefs, time and incomplete information in multiple encounter negotiations among autonomous agents [J]. Annals of Mathematics and Artificial Intelligence, 1997, 20(1-4):111-159.
[11] P. Faratin, C. Sierra, N. Jennings, P. Buckle. Designing Flexible Automated Negotiators: Concessions, Trade-Offs and Issue Changes[R]. Institut d'Investigacio en Intelligencia Artificial Technical Report, RR-99-03.
[12] K. Sycara. Resolving Adversarial Conflicts: An Approach Integrating Case-Based reasoning and Analytical Methods [D]. Atlanta: School of Information and Computer Science, Georgia Institute of Technology, 1987.
[13] D. Zeng, K. Sycara. Bayesian Learning in Negotiation [J]. Int’l J. Human-Computer Studies, 1998, 48:125-141.
[14] S. Sen and G.Weiss. Learning in multiagent systems [A]. G.Weiss, Multi-agent Systems: A Modern Approach To Distributed Artificial Intelligence [M]. Cambridge: The MIT Press, 1999, 259–298.
[15] P. Stone, M. Veloso. Multiagent systems: A survey from a machine learning perspective [J].Autonomous Robots, 2000, 3(8):345–383.
[16] C. Claus, C. Boutilier. The dynamics of reinforcement learning in cooperative multiagent systems [C]. In Proceedings of Fifteenth National Conference on Artificial Intelligence (AAAI-98), Madison, MI, July 26-30 1998, 746–752.
[17] J. Hu, M. P.Wellman. Online learning about other agents in a dynamic multiagent system [C]. In Proceedings of Second International Conference on Autonomous Agents (AGENTS’98), Minneapolis, MN, May 9-13 1998, 239–246.
[18] Y. Nagayuki, S. Ishii, K. Doya. Multiagent reinforcement learning: An approach based on the other agent’s internal model [C]. In Proceedings on the Fourth International Conference on Multi-Agent Systems (ICMAS-00), Boston, MA, July 2000, 215–221.
[19] S. Sen, M. Sekaran, J. Hale. Learning to cooperate without sharing information [C]. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), Amherst, MA, July 1994, 426–431.
[20] M. Tan. Multi-agent reinforcement learning: Independent vs cooperative agents [C]. In Proceedings of the Tenth International Conference on Machine Learning, Amherst, MA, 1993, 330–337.
[21] C. B. Excelente-Toledo, N. R. Jennings. Learning When and How to Coordinate [J]. International Journal of Web Intelligence and Agent Systems, 2003, 1 (3-4): 203-218.
[22] J. R. Oliver. On Artificial Agents for Negotiation in Electronic Commerce [D]. Philadelphia : Wharton School, University of Pennsylvania, 1996.
[23] Dehu Qi, Ron Sun. A Multi-Agent System Integrating Reinforcement Learning, Bidding and Genetic Algorithms [J]. Web Intelligence and Agent System, 2003, 1(3-4): 187-202.
[24] I. Rahwan, R. Kowalczyk, H. H. Pham. Intelligent agents for automated one-to-many e-commerce negotiation [C]. Twenty-Fifth Australian Computer Science Conference, Melbourne, Victoria, Australia, 2002, 4:197–204.
[25] T. D. Nguyen, N. R. Jennings. Concurrent bi-lateral negotiation in agent systems [C]. Proceedings of the 4th DEXAWorkshop on e-Negotiations, Prague, Czech Republic, 2003.
[26] T. D. Nguyen, N. R. Jennings. A heuristic model for concurrent bilateral negotiations in incomplete information settings [C]. In Proceedings of the 18th International Joint Conference on AI, Acapulco, Mexico, 2003, 1467–1469.
[27] T. D. Nguyen, N. R. Jennings. Coordinating multiple concurrent negotiations [C]. Proc. 3rd Int. Conf. on Autonomous Agents and Multi-Agent Systems, New York, USA, 2004, 1064-1071.
[28] T. D. Nguyen, N. R. Jennings. Reasoning about commitments in multiple concurrent negotiations [C]. In Proceedings of the 6th International Conference on E-Commerce, Delft,The Netherlands, 2004, 77-84.
[29] T. D. Nguyen, N. R. Jennings. Managing commitments in multiple concurrent negotiations [J]. International Journal of Electronic Commerce Research and Applications 2005, 4(4): 362-376.
[30]张谦,邱玉辉.一种基于相似度方法的并发协商策略[J].计算机科学, 2005. 32(12):206-209.
[31]张谦,邱玉辉.一种具有自主学习能力的并发协商模型[J].计算机应用, 2006. 26(3):663-665.
[32] Bo An, Kwang Mong Sim, Liang Gui Tang, et al. Continuous-time negotiation mechanism for software agents [J]. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 2006, 36(6):1261-1272.
[33]孙宁.多智能体系统协商机制的研究与应用[D].北京:北京理工大学, 2002.
[34]郭庆.多Agent系统协商中若干关键技术的研究[D].杭州:浙江大学, 2003.
[35]陈旭.电子商务交易中基于Agent的协商机制及策略研究[D].合肥:合肥工业大学, 2004.
[36]张虹.双边多议题自动协商研究[D].重庆:西南大学, 2005.
[37]韩伟.电子市场环境下的多智能体学习与协商[D].上海:华东师范大学, 2006.
[38]陈璐.零售电子市场中并发双边自动协商模型研究[D].重庆:西南大学, 2006.
[39]姜丽.多Agent协商研究[D].长春:吉林大学, 2007.
[40]肖颖.电子商务环境下基于Web Services的多代理自动协商系统的模型和若干关键技术研究[D].杭州:浙江大学, 2006.
[41]姚永雷. Web服务自动协商机制研究[D].北京:北京邮电大学, 2007.
[42] S. Paurobally, V. Tamma, M. Wooldridge. A framework for Web service negotiation [J]. ACM Transactions on Autonomous and Adaptive Systems, 2007, 2(4):14:1-23.
[43] A. R. Lomuscio, M. Wooldridge, N. R. Jennings. A classification scheme for negotiation in electronic commerce [J]. International Journal of Group Decision and Negotiation, 2003, 12(1):31-56.
[44] L. F. Cranor, P. Resinck. Protocols for automated negotiations with buyer anonymity and seller reputations [J]. Netnomics, 2000, 2(1):1-23.
[45] Raiffa J. The Art and Science of Negotiation [M], Cambridge: Harvard Univ. Press, 1982
[46] Haake, Claus-Jochen, M. G. Raith, F. E. Su. Bidding for Envy-Freeness: A Procedural Approach to n-Player Fair-Division Problems [J]. Social Choice and Welfare ,2002,19(4): 723-749.
[47] T. Sandholm, V. Lesser. Coalitions among computationally bounded agents [J]. Artificial Intelligence, 1997, 94(1):99-137.
[48] S. J. Grossman, M. Perry. Sequential bargaining under asymmetric information [J]. The Journalof Economics, 1986, 39(1):120-154.
[49] N. Vulkan, N. R. Jennings. Efficient Mechanisms for the Supply of Services in Multi-Agent Environments [J]. Int. Journal of Decision Support Systems, 2000, 28(1-2):5-19.
[50]孙天昊,朱庆生,李双庆.一对多协商协调策略[J].计算机工程与应用, 2007, 43(3):230-233.
[51]孙天昊,朱庆生,李双庆.一对多协商模型研究[J].电子与信息学报(已录用).
[52] C. Sierra, P. Faratin, N. R. Jennings. A Service-Oriented Negotiation Model between Autonomous Agents [C]. Proc. 8th European Workshop on Modeling Autonomous Agents in a Multi-Agent World, Ronneby, Sweden, 1997, 17-35.
[53] P. Faratin, C. Sierra, N. R. Jennings. Negotiation Decision Functions for Autonomous Agents [J]. Int. Journal of Robotics and Autonomous Systems, 1998, 24 (3-4): 159-182.
[54] P. Faratin. Automated Service Negotiation Between Autonomous Computational Agents [D]. London: University of London, Queen Mary College, Department of Electronic Engineering, 2000.
[55]肖柳青,周石鹏.数理经济学[M].北京:高等教育出版社, 1998.
[56]郭庆,陈纯.基于整合效用的多议题协商优化[J].软件学报, 2004, 15(5):706-711.
[57] Tianhao Sun, Shuangqing Li, Qingsheng Zhu. An Optimized Strategy of Service Negotiation [C]. Second IEEE International Symposium on Service-Oriented System Engineering (SOSE'06), Shanghai, October, 25-27, 2006, 210-214.
[58]孙天昊,朱庆生,李双庆.一种基于等效置换的协商策略[J].重庆大学学报(自然科学版), 2007.06, 30(6):80-82.
[59] G. Debreu. Theory of Value: An Axiomatic Analysis of Economic Equilibrium [M], New York: Wiley. 1959.
[60]安波,唐亮贵,李双庆,程代杰.一个基于Bayesian学习的协商模型[J].计算机科学, 2005, 32(1):147-150,158.
[61]陈亚楠,王黎明.基于贝叶斯的多议题协商优化[J].计算机工程与应用, 2006, 06:69-71.
[62]彭志平,彭宏,郑启伦.一种双边多议题自治协商模型的研究[J].电子与信息学报, 2007, 29(3):733-738.
[63] Z. Ren, C. Anumba. Learning in multi-agent systems: a case study of construction claims negotiation [J]. Advanced Engineering Informatics, 2002, 16:265-275.
[64]杨明,嘉莉,邱玉辉.基于增强学习的多Agent自动协商研究[J].计算机工程与应用, 2004. 33:98-100,117.
[65]张化祥,黄上腾.基于增强学习的代理协商模型[J].计算机工程, 2004, 30(10):137-139.
[66]杜春侠,高云,张文.多智能体系统中具有先验知识的Q学习算法[J].清华大学学报(自然科学版), 2005, 45(7):981-984.
[67]周浦城,洪炳殚,黄庆成.一种新颖的多agent强化学习方法[J].电子学报, 2006, 34(8):130-133.
[68]刘菲,曾广周,宋言伟.多Agent协作的强化学习模型和算法[J].计算机科学, 2006, 33(12):156-158, 186.
[69]张谦.基于电子商务环境的多Agent并发协商策略研究[D].重庆:西南大学, 2006.
[70] L. P. Kaelbing, M. L. Littman, A. W. Moore. Reinforcement learning: A survey [J]. Journal of Artificial Intelligence Research, 1996, 4:237-285.
[71] C. Claus, C. Boutilier, The dynamics of reinforcement learning in cooperative mutliagent systems [C]. Proc. of the 15th National Conference on Artificial Intelligence, USA, Menlo Park: AAAI Press, 1998, 746 -752.
[72] Y. Nagayuki, S. Ishii, K. Doya. Multi-agent reinforcement learning: An approach based on the other agent's internal model [C]. Proc. of IEEE ICMAS, USA, Boston: IEEE Computer Society, 2000. 215-221.
[73] R. I. Brafman, M. Tennenholtz, Learning to coordinate efficiently: A model-based approach [J]. Journal of Artificial Intelligence Research, 2003, 18:517-529.
[74] A. Garland, R. Alterman. Autonomous agents that learn to better coordinate [J]. Autonomous Agents and Multi-Agent Systems, 2004, 8 (3):267-301.
[75] M. Kaya, R. Alhajj. Modular fuzzy-reinforcement learning approach with internal model capabilities for multiagent systems [J]. IEEE Trans SMC-B, 2004, 34(2):1210 -1223.
[76] G. Chen, Zh.Yang, Coordinating multiple agents via reinforcement learning [J]. Autonomous Agents and Multi-Agent Systems, 2005, 10(3):273-328.
[77] C. J. C. H. Watkins, P. Dayan. Technical note: Q-learning [J]. Machine learning, 1992, 8(3-4):279 -292.
[78]孙天昊,朱庆生,李双庆,周明强.一种优化的基于增强学习的协商策略[J].计算机工程与应用. 2008.10. 40(33):24-25.
[79]张少魁,王黎明.协商Agent的历史学习算法研究[J].计算机工程与应用, 2005, 12:44-46.
[80]陈振洲,郑金华,蔡自兴.用遗传算法解决智能体协商问题[J].计算机工程与应用, 2001, 37(15):113-114,145.
[81]杨子晨,孟波,熊德林,肖延松.基于多目标遗传算法求解多边谈判问题的Pareto解[J].计算机工程与应用, 2002, 1:39-41.
[82]翁鸣,梁俊斌,苏德富.基于遗传算法的多边多议题自动协商模型[J].计算机工程, 2005, 31(16):154-156,193.
[83]崔逊学,林闯.一种基于偏好的多目标调和遗传算法[J].软件学报, 2005, 16(5):761-770.
[84]胡文斌.产品协同设计系统中交互式双边协商问题研究[J].计算机集成制造系统, 2006, 12(2):210-214.
[85]傅魁,聂规划,高新亚.基于混合遗传算法的电子市场双边协商求解[J].武汉理工大学学报, 2007, 29(3):138-141.
[86]王贵和,姜兴宇,范利敏,王宛山.基于GA和Agent组合自动谈判方案的研究[J].东北大学学报(自然科学版), 2007, 28(11):1636-1639.
[87] J. R. Oliver. On Artificial Agents for Negotiation in Electronic Commerce [C]. Proceedings of the 29th Annual Hawaii International Conference on System Sciences, 1996, 337-346.
[88] J. R. Oliver. A machine-learning approach to automated negotiation and prospects for electronic commerce [J]. Journal of Management Information Systems, 1997, 13(3):83-112.
[89] M. T. Tu, E. Wolff, W. Lamersdorf. Genetic algorithms for automated negotiations: a FSM-based application approach [C]. Proceedings of 11th International Conference on Database and Expert Systems, 2000.
[90] P. M. Samuel, J. N. Liu. A genetic agent based negotiation system [J]. Computer Networks, 2001, 37 (2):195 - 204.
[91] P. M. Reed, B. S. Minsker. Discovery & Negotiation using Multiobjective Genetic Algorithms: A Case Study in Groundwater Monitoring Design [C]. Proceedings of Hydroinformatics, Cardiff, UK, 2002.
[92] E. Gerding, D. van Bragt. Multi-issue negotiation processes by evolutionary simulation, validation and social extensions [J]. Computational Economics, 2003, 22(1): 39~63.
[93] Luo Xudong, N. R. Jennings, N. Shadbolt, et al. A fuzzy constraint based model for bilateral multi-issue negotiations in semi-competitive environments [J]. Artificial Intelligence Journal, 2003, 148 (1/2) :53 - 102.
[94]陈璐,邱玉辉,张谦.一种基于模糊约束的多并发双边自动协商模型[J].计算机应用,2007, 27(12):2906-2909.
[95]卢刚,倪宁,郭庆.基于神经网络的协商学习机制[J].计算机工程与应用,2005,13:51-53.
[96]卢武昌,胡山立.基于神经网络的Agent电子商务协商模型[J].计算机应用,2005,25(7):1638-1640.
[97] Zeng Zi-Ming, Meng Bo, Zeng Yuan-Yuan. An adaptive learning method in automated negotiation based on artificial neural network [C]. In Proceedings of the Fourth International Conference on Machine Learning and Cybernetics (ICMLC), Guangzhou, China, August 2005, 383-387.
[98]彭志平,李绍平.一种基于神经模糊系统的协商策略[J].系统仿真学报,2008, 20(3):623-626.
[99] J. von Neumann, O. Morgenstern. Theory of games and economic behavior [M], Princeton:Princeton University Press, 1944.
[100] D. von Winterfeld, W. dwards. Decision Analysis and Behavioral Research [M]. Cambridge, England: Cambridge University Press, 1986.
[101] Yew-Kwang Ng, Jianguo Wang. Pursuit of Relative Utility in General Competitive Equilibrium [C], Australasian Econometrics Society Annual Meeting, Sydney University, NSW, Australia, 1993, 61(6):1471-1476.
[102] D. R. Radev, D. Tam. Summarization evaluation using relative utility [C]. Proceedings of the Twelfth ACM International Conference on Information and Knowledge Management, New Orleans, LA, United States, 2003, 508-511
[103] Zhang Junyi, Timmermans Harry, Borgers Aloys, Wang Donggen. Modeling traveler choice behavior using the concepts of relative utility and relative interest [J]. Transportation Research Part B: Methodological, 2004, 38(3):215-234.
[104]李家炜.效用与个人选择的研究[J/OL].中国科技论文在线,http://www.paper.edu.cn, 2004.11.
[105] T. W. Sandholm, V. R. Lesser. Leveled commitment contracts and strategic breach [J]. Games and Economic Behavior, 2001, 35:212-270.
[106] C. Castelfranchi. Commitments: From individual intentions to groups and organizations [C]. In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS), San Francisco, California, June 1995, 41-48.
[107]张伟,石纯一. Agent的组织承诺和小组承诺[J].软件学报, 2003, 14(03):0473-0478.
[2]李双庆,程代杰. B2B电子商务协作模型研究[J].计算机科学, 2002, 30(4):102-104.
[3] R. H. Guttman, A. G. Moukas, P. Maes. Agent-Mediated Electronic Commerce: A Survey [J]. Knowledge Engineering Review, 1998, 13(2):147-159.
[4] H.Minghua, N. R. Jennings, L. Ho-Fung. On agent-mediated electronic commerce [J]. IEEE Transactions on Knowledge and Data Engineering, 2003, 15(4):985-1003.
[5] Michael Wooldridge著,石纯一等译.多Agent系统引论[M].北京:电子工业出版社, 2003.
[6] R. J. Lewicki, D. M. Saunders, J. W. Minton. Essentials of Negotiation [M]. Boston : Irwin McGraw-Hill, 2 edition, 2000.
[7] N. R, Jennings, P. Faratin. A. R. Lomuscio, S. Parsons, C. Sierra and M.Wooldridge. Automated negotiation: prospects, methods and challenges [J]. International Journal of Group Decision and Negotiation, 2001, 10(2):199-215.
[8]张维迎.博弈论与信息经济学[M].上海:上海人民出版社, 1996.
[9] G. Zlotkin, J. Rosenchein. A domain theory for task oriented negotiation [C]. Proceeding of the American Association of Artificial Intelligence, San Jose, CA, 1992, 148-153.
[10] S. Kraus. Beliefs, time and incomplete information in multiple encounter negotiations among autonomous agents [J]. Annals of Mathematics and Artificial Intelligence, 1997, 20(1-4):111-159.
[11] P. Faratin, C. Sierra, N. Jennings, P. Buckle. Designing Flexible Automated Negotiators: Concessions, Trade-Offs and Issue Changes[R]. Institut d'Investigacio en Intelligencia Artificial Technical Report, RR-99-03.
[12] K. Sycara. Resolving Adversarial Conflicts: An Approach Integrating Case-Based reasoning and Analytical Methods [D]. Atlanta: School of Information and Computer Science, Georgia Institute of Technology, 1987.
[13] D. Zeng, K. Sycara. Bayesian Learning in Negotiation [J]. Int’l J. Human-Computer Studies, 1998, 48:125-141.
[14] S. Sen and G.Weiss. Learning in multiagent systems [A]. G.Weiss, Multi-agent Systems: A Modern Approach To Distributed Artificial Intelligence [M]. Cambridge: The MIT Press, 1999, 259–298.
[15] P. Stone, M. Veloso. Multiagent systems: A survey from a machine learning perspective [J].Autonomous Robots, 2000, 3(8):345–383.
[16] C. Claus, C. Boutilier. The dynamics of reinforcement learning in cooperative multiagent systems [C]. In Proceedings of Fifteenth National Conference on Artificial Intelligence (AAAI-98), Madison, MI, July 26-30 1998, 746–752.
[17] J. Hu, M. P.Wellman. Online learning about other agents in a dynamic multiagent system [C]. In Proceedings of Second International Conference on Autonomous Agents (AGENTS’98), Minneapolis, MN, May 9-13 1998, 239–246.
[18] Y. Nagayuki, S. Ishii, K. Doya. Multiagent reinforcement learning: An approach based on the other agent’s internal model [C]. In Proceedings on the Fourth International Conference on Multi-Agent Systems (ICMAS-00), Boston, MA, July 2000, 215–221.
[19] S. Sen, M. Sekaran, J. Hale. Learning to cooperate without sharing information [C]. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), Amherst, MA, July 1994, 426–431.
[20] M. Tan. Multi-agent reinforcement learning: Independent vs cooperative agents [C]. In Proceedings of the Tenth International Conference on Machine Learning, Amherst, MA, 1993, 330–337.
[21] C. B. Excelente-Toledo, N. R. Jennings. Learning When and How to Coordinate [J]. International Journal of Web Intelligence and Agent Systems, 2003, 1 (3-4): 203-218.
[22] J. R. Oliver. On Artificial Agents for Negotiation in Electronic Commerce [D]. Philadelphia : Wharton School, University of Pennsylvania, 1996.
[23] Dehu Qi, Ron Sun. A Multi-Agent System Integrating Reinforcement Learning, Bidding and Genetic Algorithms [J]. Web Intelligence and Agent System, 2003, 1(3-4): 187-202.
[24] I. Rahwan, R. Kowalczyk, H. H. Pham. Intelligent agents for automated one-to-many e-commerce negotiation [C]. Twenty-Fifth Australian Computer Science Conference, Melbourne, Victoria, Australia, 2002, 4:197–204.
[25] T. D. Nguyen, N. R. Jennings. Concurrent bi-lateral negotiation in agent systems [C]. Proceedings of the 4th DEXAWorkshop on e-Negotiations, Prague, Czech Republic, 2003.
[26] T. D. Nguyen, N. R. Jennings. A heuristic model for concurrent bilateral negotiations in incomplete information settings [C]. In Proceedings of the 18th International Joint Conference on AI, Acapulco, Mexico, 2003, 1467–1469.
[27] T. D. Nguyen, N. R. Jennings. Coordinating multiple concurrent negotiations [C]. Proc. 3rd Int. Conf. on Autonomous Agents and Multi-Agent Systems, New York, USA, 2004, 1064-1071.
[28] T. D. Nguyen, N. R. Jennings. Reasoning about commitments in multiple concurrent negotiations [C]. In Proceedings of the 6th International Conference on E-Commerce, Delft,The Netherlands, 2004, 77-84.
[29] T. D. Nguyen, N. R. Jennings. Managing commitments in multiple concurrent negotiations [J]. International Journal of Electronic Commerce Research and Applications 2005, 4(4): 362-376.
[30]张谦,邱玉辉.一种基于相似度方法的并发协商策略[J].计算机科学, 2005. 32(12):206-209.
[31]张谦,邱玉辉.一种具有自主学习能力的并发协商模型[J].计算机应用, 2006. 26(3):663-665.
[32] Bo An, Kwang Mong Sim, Liang Gui Tang, et al. Continuous-time negotiation mechanism for software agents [J]. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 2006, 36(6):1261-1272.
[33]孙宁.多智能体系统协商机制的研究与应用[D].北京:北京理工大学, 2002.
[34]郭庆.多Agent系统协商中若干关键技术的研究[D].杭州:浙江大学, 2003.
[35]陈旭.电子商务交易中基于Agent的协商机制及策略研究[D].合肥:合肥工业大学, 2004.
[36]张虹.双边多议题自动协商研究[D].重庆:西南大学, 2005.
[37]韩伟.电子市场环境下的多智能体学习与协商[D].上海:华东师范大学, 2006.
[38]陈璐.零售电子市场中并发双边自动协商模型研究[D].重庆:西南大学, 2006.
[39]姜丽.多Agent协商研究[D].长春:吉林大学, 2007.
[40]肖颖.电子商务环境下基于Web Services的多代理自动协商系统的模型和若干关键技术研究[D].杭州:浙江大学, 2006.
[41]姚永雷. Web服务自动协商机制研究[D].北京:北京邮电大学, 2007.
[42] S. Paurobally, V. Tamma, M. Wooldridge. A framework for Web service negotiation [J]. ACM Transactions on Autonomous and Adaptive Systems, 2007, 2(4):14:1-23.
[43] A. R. Lomuscio, M. Wooldridge, N. R. Jennings. A classification scheme for negotiation in electronic commerce [J]. International Journal of Group Decision and Negotiation, 2003, 12(1):31-56.
[44] L. F. Cranor, P. Resinck. Protocols for automated negotiations with buyer anonymity and seller reputations [J]. Netnomics, 2000, 2(1):1-23.
[45] Raiffa J. The Art and Science of Negotiation [M], Cambridge: Harvard Univ. Press, 1982
[46] Haake, Claus-Jochen, M. G. Raith, F. E. Su. Bidding for Envy-Freeness: A Procedural Approach to n-Player Fair-Division Problems [J]. Social Choice and Welfare ,2002,19(4): 723-749.
[47] T. Sandholm, V. Lesser. Coalitions among computationally bounded agents [J]. Artificial Intelligence, 1997, 94(1):99-137.
[48] S. J. Grossman, M. Perry. Sequential bargaining under asymmetric information [J]. The Journalof Economics, 1986, 39(1):120-154.
[49] N. Vulkan, N. R. Jennings. Efficient Mechanisms for the Supply of Services in Multi-Agent Environments [J]. Int. Journal of Decision Support Systems, 2000, 28(1-2):5-19.
[50]孙天昊,朱庆生,李双庆.一对多协商协调策略[J].计算机工程与应用, 2007, 43(3):230-233.
[51]孙天昊,朱庆生,李双庆.一对多协商模型研究[J].电子与信息学报(已录用).
[52] C. Sierra, P. Faratin, N. R. Jennings. A Service-Oriented Negotiation Model between Autonomous Agents [C]. Proc. 8th European Workshop on Modeling Autonomous Agents in a Multi-Agent World, Ronneby, Sweden, 1997, 17-35.
[53] P. Faratin, C. Sierra, N. R. Jennings. Negotiation Decision Functions for Autonomous Agents [J]. Int. Journal of Robotics and Autonomous Systems, 1998, 24 (3-4): 159-182.
[54] P. Faratin. Automated Service Negotiation Between Autonomous Computational Agents [D]. London: University of London, Queen Mary College, Department of Electronic Engineering, 2000.
[55]肖柳青,周石鹏.数理经济学[M].北京:高等教育出版社, 1998.
[56]郭庆,陈纯.基于整合效用的多议题协商优化[J].软件学报, 2004, 15(5):706-711.
[57] Tianhao Sun, Shuangqing Li, Qingsheng Zhu. An Optimized Strategy of Service Negotiation [C]. Second IEEE International Symposium on Service-Oriented System Engineering (SOSE'06), Shanghai, October, 25-27, 2006, 210-214.
[58]孙天昊,朱庆生,李双庆.一种基于等效置换的协商策略[J].重庆大学学报(自然科学版), 2007.06, 30(6):80-82.
[59] G. Debreu. Theory of Value: An Axiomatic Analysis of Economic Equilibrium [M], New York: Wiley. 1959.
[60]安波,唐亮贵,李双庆,程代杰.一个基于Bayesian学习的协商模型[J].计算机科学, 2005, 32(1):147-150,158.
[61]陈亚楠,王黎明.基于贝叶斯的多议题协商优化[J].计算机工程与应用, 2006, 06:69-71.
[62]彭志平,彭宏,郑启伦.一种双边多议题自治协商模型的研究[J].电子与信息学报, 2007, 29(3):733-738.
[63] Z. Ren, C. Anumba. Learning in multi-agent systems: a case study of construction claims negotiation [J]. Advanced Engineering Informatics, 2002, 16:265-275.
[64]杨明,嘉莉,邱玉辉.基于增强学习的多Agent自动协商研究[J].计算机工程与应用, 2004. 33:98-100,117.
[65]张化祥,黄上腾.基于增强学习的代理协商模型[J].计算机工程, 2004, 30(10):137-139.
[66]杜春侠,高云,张文.多智能体系统中具有先验知识的Q学习算法[J].清华大学学报(自然科学版), 2005, 45(7):981-984.
[67]周浦城,洪炳殚,黄庆成.一种新颖的多agent强化学习方法[J].电子学报, 2006, 34(8):130-133.
[68]刘菲,曾广周,宋言伟.多Agent协作的强化学习模型和算法[J].计算机科学, 2006, 33(12):156-158, 186.
[69]张谦.基于电子商务环境的多Agent并发协商策略研究[D].重庆:西南大学, 2006.
[70] L. P. Kaelbing, M. L. Littman, A. W. Moore. Reinforcement learning: A survey [J]. Journal of Artificial Intelligence Research, 1996, 4:237-285.
[71] C. Claus, C. Boutilier, The dynamics of reinforcement learning in cooperative mutliagent systems [C]. Proc. of the 15th National Conference on Artificial Intelligence, USA, Menlo Park: AAAI Press, 1998, 746 -752.
[72] Y. Nagayuki, S. Ishii, K. Doya. Multi-agent reinforcement learning: An approach based on the other agent's internal model [C]. Proc. of IEEE ICMAS, USA, Boston: IEEE Computer Society, 2000. 215-221.
[73] R. I. Brafman, M. Tennenholtz, Learning to coordinate efficiently: A model-based approach [J]. Journal of Artificial Intelligence Research, 2003, 18:517-529.
[74] A. Garland, R. Alterman. Autonomous agents that learn to better coordinate [J]. Autonomous Agents and Multi-Agent Systems, 2004, 8 (3):267-301.
[75] M. Kaya, R. Alhajj. Modular fuzzy-reinforcement learning approach with internal model capabilities for multiagent systems [J]. IEEE Trans SMC-B, 2004, 34(2):1210 -1223.
[76] G. Chen, Zh.Yang, Coordinating multiple agents via reinforcement learning [J]. Autonomous Agents and Multi-Agent Systems, 2005, 10(3):273-328.
[77] C. J. C. H. Watkins, P. Dayan. Technical note: Q-learning [J]. Machine learning, 1992, 8(3-4):279 -292.
[78]孙天昊,朱庆生,李双庆,周明强.一种优化的基于增强学习的协商策略[J].计算机工程与应用. 2008.10. 40(33):24-25.
[79]张少魁,王黎明.协商Agent的历史学习算法研究[J].计算机工程与应用, 2005, 12:44-46.
[80]陈振洲,郑金华,蔡自兴.用遗传算法解决智能体协商问题[J].计算机工程与应用, 2001, 37(15):113-114,145.
[81]杨子晨,孟波,熊德林,肖延松.基于多目标遗传算法求解多边谈判问题的Pareto解[J].计算机工程与应用, 2002, 1:39-41.
[82]翁鸣,梁俊斌,苏德富.基于遗传算法的多边多议题自动协商模型[J].计算机工程, 2005, 31(16):154-156,193.
[83]崔逊学,林闯.一种基于偏好的多目标调和遗传算法[J].软件学报, 2005, 16(5):761-770.
[84]胡文斌.产品协同设计系统中交互式双边协商问题研究[J].计算机集成制造系统, 2006, 12(2):210-214.
[85]傅魁,聂规划,高新亚.基于混合遗传算法的电子市场双边协商求解[J].武汉理工大学学报, 2007, 29(3):138-141.
[86]王贵和,姜兴宇,范利敏,王宛山.基于GA和Agent组合自动谈判方案的研究[J].东北大学学报(自然科学版), 2007, 28(11):1636-1639.
[87] J. R. Oliver. On Artificial Agents for Negotiation in Electronic Commerce [C]. Proceedings of the 29th Annual Hawaii International Conference on System Sciences, 1996, 337-346.
[88] J. R. Oliver. A machine-learning approach to automated negotiation and prospects for electronic commerce [J]. Journal of Management Information Systems, 1997, 13(3):83-112.
[89] M. T. Tu, E. Wolff, W. Lamersdorf. Genetic algorithms for automated negotiations: a FSM-based application approach [C]. Proceedings of 11th International Conference on Database and Expert Systems, 2000.
[90] P. M. Samuel, J. N. Liu. A genetic agent based negotiation system [J]. Computer Networks, 2001, 37 (2):195 - 204.
[91] P. M. Reed, B. S. Minsker. Discovery & Negotiation using Multiobjective Genetic Algorithms: A Case Study in Groundwater Monitoring Design [C]. Proceedings of Hydroinformatics, Cardiff, UK, 2002.
[92] E. Gerding, D. van Bragt. Multi-issue negotiation processes by evolutionary simulation, validation and social extensions [J]. Computational Economics, 2003, 22(1): 39~63.
[93] Luo Xudong, N. R. Jennings, N. Shadbolt, et al. A fuzzy constraint based model for bilateral multi-issue negotiations in semi-competitive environments [J]. Artificial Intelligence Journal, 2003, 148 (1/2) :53 - 102.
[94]陈璐,邱玉辉,张谦.一种基于模糊约束的多并发双边自动协商模型[J].计算机应用,2007, 27(12):2906-2909.
[95]卢刚,倪宁,郭庆.基于神经网络的协商学习机制[J].计算机工程与应用,2005,13:51-53.
[96]卢武昌,胡山立.基于神经网络的Agent电子商务协商模型[J].计算机应用,2005,25(7):1638-1640.
[97] Zeng Zi-Ming, Meng Bo, Zeng Yuan-Yuan. An adaptive learning method in automated negotiation based on artificial neural network [C]. In Proceedings of the Fourth International Conference on Machine Learning and Cybernetics (ICMLC), Guangzhou, China, August 2005, 383-387.
[98]彭志平,李绍平.一种基于神经模糊系统的协商策略[J].系统仿真学报,2008, 20(3):623-626.
[99] J. von Neumann, O. Morgenstern. Theory of games and economic behavior [M], Princeton:Princeton University Press, 1944.
[100] D. von Winterfeld, W. dwards. Decision Analysis and Behavioral Research [M]. Cambridge, England: Cambridge University Press, 1986.
[101] Yew-Kwang Ng, Jianguo Wang. Pursuit of Relative Utility in General Competitive Equilibrium [C], Australasian Econometrics Society Annual Meeting, Sydney University, NSW, Australia, 1993, 61(6):1471-1476.
[102] D. R. Radev, D. Tam. Summarization evaluation using relative utility [C]. Proceedings of the Twelfth ACM International Conference on Information and Knowledge Management, New Orleans, LA, United States, 2003, 508-511
[103] Zhang Junyi, Timmermans Harry, Borgers Aloys, Wang Donggen. Modeling traveler choice behavior using the concepts of relative utility and relative interest [J]. Transportation Research Part B: Methodological, 2004, 38(3):215-234.
[104]李家炜.效用与个人选择的研究[J/OL].中国科技论文在线,http://www.paper.edu.cn, 2004.11.
[105] T. W. Sandholm, V. R. Lesser. Leveled commitment contracts and strategic breach [J]. Games and Economic Behavior, 2001, 35:212-270.
[106] C. Castelfranchi. Commitments: From individual intentions to groups and organizations [C]. In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS), San Francisco, California, June 1995, 41-48.
[107]张伟,石纯一. Agent的组织承诺和小组承诺[J].软件学报, 2003, 14(03):0473-0478.