Solving WDP in combinatorial double auction based on trading strategy

被引：0

作者：

Liu, Yuan ^{[1
]}

Liu, Yuan-An ^{[1
]}

Ma, Xiao-Lei ^{[1
]}

Liu, Kai-Ming ^{[1
]}

机构：

[1] School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China

来源：

Journal of China Universities of Posts and Telecommunications | 2012年 / 19卷 / SUPPL. 1期

关键词：

Commerce - Problem solving - Optimization;

D O I：

10.1016/S1005-8885(11)60453-6

中图分类号：

学科分类号：

摘要：

A solution for winner determination problem (WDP) in combinatorial double auction (CDA) was presented. Different from determining winner by solving optimization model which was non-deterministic polynomial (NP)-hard when the number of participants or resource types amounted to a large scale, the solution put the WDP goal-social welfare maximization into design of the trading strategy and determined winners by the process of resource allocation and pricing. In its corresponding allocation and pricing algorithm, sellers were allowed partially trading their bundles; the transaction path was approximated to Marshallian path; the utility for each winner was non-negative. Simulations show, compared to the WDP optimization model, the proposed algorithm can generate larger social welfare and it is particularly time efficient in conducting large-scale CDA. © 2012 The Journal of China Universities of Posts and Telecommunications.

引用

页码：148 / 152