基于移动Agent的安全电子拍卖系统的构建

随着电子商务技术的日益发展，移动Agent技术可以用来进行市场调查，商品买卖及离线拍卖等。事实证明只有当用移动Agent构建的系统的安全性得到确切的保证后，才能被大众用户所接受。该文提出了一个基于移动Agent的电子拍卖协议，并以此协议构建了一个实际的系统。系统中采用了主从结构，在认证过程中要求Agent向拍卖服务器出示许可证等方法来保证系统的安全性。最后，对协议设计的正确性和效率进行了详尽的分析。     

一种基于移动代理的自主拍卖模型

Agent的自治性和移动性为网络环境下的电子商务活动提供了许多潜在优点.拍卖是一种典型的商务活动,基于Agent的自主拍卖是传统拍卖方式的一个发展趋势,具有广泛应用前景.重点研究了建立自主拍卖系统所涉及的主要问题,包括拍卖大厅建模、拍卖大厅查询、交易对象定位、拍卖过程同步和出价策略等.基于移动Agent和博奕理论,提出了一种自主拍卖模型.该模型支持一次价格密封标价拍卖和双边拍卖两种拍卖机制.模型中的Agent接受拍卖任务后能够自动搜寻拍卖大厅、自主参与拍卖过程并向其所有者返回拍卖结果.     

基于多Agent拍卖的网格资源主动分配

为了保障网格资源的利用率和实现资源主动分配,提出基于FIPA（Foundation of Intelligent Physi-cal Agents）英式拍卖和荷兰式拍卖协议的网格资源分配方法,在多Agent开发平台JADE（Java Agent Develop-ment Framework）下分别对这两种拍卖协议作了实现,给出了具体的实现算法、步骤、参与拍卖的各Agent的交互过程以及拍卖结果。最后,用实例说明了仿真实现过程的正确性。     

基于多Agent拍卖的网格资源主动分配

为了保障网格资源的利用率和实现资源主动分配,提出基于FIPA（FoundationofIntelligentPhysi-calAgents）英式拍卖和荷兰式拍卖协议的网格资源分配方法,在多Agent开发平台JADE（JavaAgentDevelop-mentFramework）下分别对这两种拍卖协议作了实现,给出了具体的实现算法、步骤、参与拍卖的各Agent的交互过程以及拍卖结果。最后,用实例说明了仿真实现过程的正确性。     

基于组合拍卖机制的移动Agent投标策略

针对Agent系统资源分配需求提出一种兼顾Agent时间片数量要求和执行截止期限要求的投标策略。定义CPU时间片组合拍卖问题模型,设计Agent各种投标信息处理方法,包括适合组合拍卖CPU时间片机制的Agent零智能投标算法和NZIPca投标算法。仿真结果表明NZIPca策略具有较强的竞标能力。     

基于多Agent的多属性拍卖系统研究

通过对现有网上拍卖系统的深入分析,指出多属性网上拍卖系统的研究是最为薄弱的环节。依据网上交易的需求和分布式人工智能迅速发展,提出了一种基于多Agent的多属性网上拍卖系统,着重对多属性拍卖协议和策略,以及系统构架进行了探讨,给出了集成式的多属性网上拍卖系统的算法,并对今后的研究方向进行了展望。     

基于拍卖博弈的电子商务自动协商

为提高电子商务自动协商系统效率,本文以拍卖博弈理论为基础,提出并实现了一种基于拍卖博弈的自动协商Agent模型,并在此基础上实现了一个基于拍卖博弈的电子商务自动协商原型系统,应用于一个企业敏捷供应链管理系统中实现自动协商交易。     

一种安全的多属性拍卖模型

网络拍卖不仅成为电子商务不可分割的部分,而且是自治Agent和多Agent系统(MAS)技术的重要应用领域.同时,拍卖作为一种有效的资源分配形式,在联盟生成等MAS问题中有着重要的应用,因而受到学者们越来越多的关注.拍卖的安全性、隐私性特征是拍卖研究的重要方面.给出了一个一般的多属性拍卖模型和一个安全的多属性拍卖协议--SVAMA协议,并证明了SVAMA的一些重要性质,如Strategy-proof等.并与已有的多属性拍卖和使用的安全方法进行了比较,部分改进了David,Brandt等人的工作.     

一个基于移动Agent的多轮电子拍卖方案

Subramanian提出了一种多轮电子拍卖方案，具有匿名性、安全性和原子性等特点。在其基础上引入移动Agent技术，提出一种新的电子拍卖方案。     

电子商务智能Agent的自适应模糊推理

电子市场中的买卖双方达成交易的过程可以看作是一个连续双向拍卖(CDA)协议。面向电子商务实际应用，给出了CDA协议下买卖双方参与竟标的模糊规则及模糊推理方法。在推理过程中，交易Agent可以根据市场需求状况和自身特性对模糊规则的某些参数进行合理优化，从而自动适应市场变化。     

具有迁移能力的基于Agent分布仿真中的通信系统

对基于Agent系统的分布仿真是仿真领域的重要研究和应用方向，而分布仿真中的通信系统是其中的基础部分．提出并实现了一种支持基于Agent系统分布仿真的通信系统．该系统除了提供基本的仿真通信支持外，还能够有效地支持仿真中Agent的迁移，具有对应用系统透明、通信效率高等优点．首先给出了通信系统的结构及其基本思想，对局部服务Agent和通信过程进行了详细的描述；从应用系统级和分布仿真级两个层次，给出了结构化的通信协议；在此基础之上，给出了完整的Agent迁移支持方案，包括迁移过程、迁移过程中的消息处理和迁移后的通信；最后对通信系统的性能进行了测试．     

基于移动Agent的智能拍卖系统研究

该文基于买方为主的拍卖结构,提出了一种基于移动Agent技术的多属性拍卖系统。采用Skyline算法实现招标的选优,协同过滤技术实现投标的推荐,利用移动Agent技术优势完成多属性拍卖过程的自动化处理。分析表明该系统是一种较为有效,智能化的系统。     

基于博弈分析的电子商务自动协商系统

为提高基于拍卖机制的电子商务自动协商系统效率，该文以非合作博弈论为基础提出了基于博弈分析的自动协商Agent模型及基于拍卖机制和博弈分析的自动投标协商算法，实现了一个基于拍卖机制和博弈分析的电子商务自动协商原型系统，并应用在一个企业敏捷供应链管理系统中实现自动协商交易。     

An agent-based English auction protocol using Elliptic Curve Cryptosystem for mobile commerce

Rapid development of the Internet and the extensive use of mobile phones have increased demand for mobile devices in Internet auctions. This trend is acting as an incentive to develop an auction model for mobile-based environment. Recently, Kuo-Hsuan Huang proposed a mobile auction agent model (MoAAM), which allows the bidders to participate in online auctions through a mobile agent. He used modular exponentiation operations in his method. As a result, the processing time for key generation, bidding, and verification were long. Thus, we propose to add the concept of Elliptic Curve Cryptosystem (ECC) onto MoAAM, because ECC has low computation amount and small key size, both of which will aid to increase the speed in generating keys, bidding, and verification. In terms of reduction of computation load on mobile devices and auction-manager server, the proposed method will make online auction system more efficient as well as more convenient to use. This paper mainly uses the English auction protocol as the key auction protocol. The protocol consists of four entities: Registration Manager (RM), Agent House (AH), Auction House (AUH), and Bidders (B). The Registration Manager registers and verifies Bidder identity. The Agent House manages the agents and assigns public transaction keys to Bidders. The Auction House provides a place for auction and maintains all necessary operations for a smooth online auction. Bidders are buyers who are interested in purchasing items at the auction. Our proposed method conforms to the requirements of an online auction protocol in terms of anonymity, traceability, no framing, unforgetability, non-repudiation, fairness, public verifiability, unlinkability among various auction rounds, linkability within a single auction round, efficiency of bidding, one-time registration, and easy revocation.     

Automatic price negotiation on the web: An agent-based web application using fuzzy expert system

A traditional internet auction is restricted by the limitation of time. It is necessary to conduct an internet auction in a certain time period. The final trading price is determined until this certain period ends. This study improves this situation by removing the time limitation. Based on the fuzzy inference theory, this paper proposes an agent-based price negotiation system for on-line auctions. Mainly, three agents are used in the study: a seller agent, a buyer agent, and a mediator agent. The proposed system provides an easy-to-use environment and good customizability for users (buyers or sellers) to customize their price negotiation strategies using user-defined fuzzy rules. The final negotiated price is immediately determined after the buyer sends his bids to the proposed system. This study develops a Java-based computer package to implement the price negotiation system where Model-View-Controller (MVC) design pattern is employed in design of the package. Unified Modeling Language (UML) is also utilized to describe the structures and behaviors of the package. To validate the proposed system, this study built an on-line auction website with the proposed price negotiation mechanism for internet users to buy or sell their merchandises. An evaluation was finally conducted to investigate the users’ satisfaction with the proposed system.Briefly, the proposed system is featured by: (1) instantly getting negotiated price without waiting; (2) conducting price negotiation at any time; (3) determining strategy rules easily, and (4) using customizable negotiation strategies defined by users.     

MoRVAM: A reverse Vickrey auction system for mobile commerce

Internet auctions bring buyers and sellers together for the purpose of trading goods and services online. In order to get the goods, a buyer must search for items through several auction sites. When the auction starts, the buyer needs to connect to these auction sites frequently so that he/she can monitor the bid states and re-bid. In this paper, we propose an automated negotiation model between two participants, for mobile commerce, using collaborative mobile agents called MoRVAM, which mediates between the buyer and the sellers, and executes bidding asynchronously and autonomously. A new RVT protocol is also implemented to achieve unconditional bid privacy. Advantages of the RVT protocol are addressed as well. All the bidding process can be implemented without revealing losing bid and unnecessary information.     

Toward market-driven agents for electronic auction

While there are several existing agent-based systems addressing the crucial and difficult issues of automated negotiation and auction, this research has designed and engineered a society of trading agents with two distinguishing features: 1) a market-driven negotiation strategy and 2) a deal optimizing auction protocol. Unlike some of the existing systems where users manually select predefined trading strategies, in the market-driven approach, trading agents automatically select the appropriate strategies by examining the changing market situations. Results from a series of experiments suggest that the market-driven approach generally achieved more favorable outcomes as compared to the fixed strategy approach. Furthermore, it provides a more intuitive simulation of trading because trading agents are able to respond to different market situations with appropriate strategies. By augmenting the auction protocol with a deal optimization stage, trading agents can be programmed to optimize transaction deals by delaying the finalization of deals in search of better deals. Experimental results showed that by having a deal optimization stage, the auction protocol produced generally optimistic outcomes     

基于多Agent的可满足性问题求解系统研究

为了得到高效可扩展的可满足性问题求解方法,融合目前解决可满足性问题(SAT)的诸多最新策略:快速DPLL、启发式极性决策算法等,提出了一种基于多Agent(Multi-Agent)的可满足性问题(SAT)验证方法.该方法给出了基于多Agent的可满足性问题求解系统的总体结构、工作流程和消息协议,详细分析了有关Agent的结构原理,在JADF(Java Agent development framework)基础上设计出智能仿真模型,通过实例研究表明该方法比传统的一般性求解方法精度高、速度快,且有较好的扩展性和可移植性.