Abstract: A bidding strategy is proposed for resource allocation demand of mobile agent system. In this strategy, both Agent time slice demand and execution deadline demand are considered. The CPU slice combinational auction model is defined. And a method is designed to process the agent bidding information. A constrained zero intelligent bidding algorithm and New Zero-Intelligence-Plus for sealed combinatorial Auction(NZIPca) bidding algorithm for this mechanism are designed. Simulation results show that NZIPca stratage has better winning performance.

Key words: combinational auction, mobile Agent, bidding strategy

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

关键词: 组合拍卖, 移动Agent, 投标策略

CLC Number: 

• TP309