基于关联规则分析的组合拍卖竞胜标决定算法  

Algorithms for Combinatorial Auction Winner Determination Based on Item Association Analysis

作　　者：傅丽芳[1,2] 冯玉强[1] 

机构地区：[1]哈尔滨工业大学管理学院,哈尔滨150001 [2]东北农业大学信息与计算科学系,哈尔滨150030

出　　处：《系统管理学报》2008年第5期504-508,共5页Journal of Systems & Management

基　　金：国家自然科学基金资助项目(70471027,70572023);黑龙江省科技攻关资助项目(GC05A116)

摘　　要：组合拍卖竞胜标确定问题(WDP)是一个NP-完全问题,其算法研究一直是运筹学、人工智能和计算机科学等领域持续关注的热点。本文提出基于关联规则数据挖掘技术的组合拍卖竞胜标算法,并通过与经典的WDP精确算法和近似算法的比较,证明了该算法的有效性,为组合拍卖WDP算法提供了新的研究思路和方法。Combinatorial auction winner determination is a NP complete problem,which has been a hotspot in operation research,artificial intelligence and computer science research fields.The paper proposed a novel algorithm for WDP based on item association analysis method in data mining.A lot of simulating experiments were performed to testify its efficiency compared to the classic optimal and approximate algorithms proposed in previous literatures.The algorithm provides a new approach for the research of combinatorial auction winner determination problem.

关 键 词：组合拍卖 竞胜标确定算法 关联规则分析 资源配置效率 

分 类 号：F724[经济管理—产业经济] TP18[自动化与计算机技术—控制理论与控制工程]