摘要
组合双向拍卖是组合拍卖和双向拍卖的组合。与组合拍卖或双向拍卖相比,组合双向拍卖问题更加复杂,目前对它的研究也较少。本文运用整数规划的方法建立了一个组合双向拍卖问题的一般化模型,并通过逐步转化,把组合双向拍卖简化为单边拍卖,有助于利用求解单边拍卖的方法来求解复杂的双向拍卖问题,使这一问题的研究得到了简化。
Combinatorial double auction （CDA） combines combinatorial auction and double auction. Compared with combinatorial auction and double auction, there is very litter documented research on CDA due to its complexity. An optimization model for combinatorial double auction based on integer programming method is established and transformed into single- sided auction, which will benefit to solve combinatorial double auction with the method used for singlesided auction and to make the problem much more easier.
出处
《中国管理科学》
CSSCI
2005年第5期44-48,共5页
Chinese Journal of Management Science
基金
国家自然科学基金资助项目(70371023)
国家教育委员会博士点基金(20030358052)
关键词
组合双向拍卖
单边拍卖
最优化模型
交易剩余
combinatorial double auction
single - sided auction
optimization model
trade surplus
