multi-unit

Experiments have been conducted. The experimental results show that auctioneer agent can find the optimal solution efficiently and can improve profit income with our algorithm in the multi-unit combinatorial auctions with reserve prices for limited problem scales.

实验结果表明，在考虑资源保留价的多单位组合拍卖中，拍卖Agent能够利用MUCARP算法在一定问题规模内快速地找到胜者确定问题的最优解，并使得拍卖Agent利润收益得到提升。

Determining the winners in combinatorial auction is NP-complete problem, and the winner determination in multi-unit combinatorial auctions with reserve prices is a more intractable one.

但组合拍卖中的胜者确定问题却是一个NP完全问题，而设置保留价的多单位组合拍卖中胜者确定问题是一个更复杂的计算问题。

To our knowledge, the research into multi-unit combinatorial auctions with reserve prices considered is more or less ignored.

据我们所知，设置保留价的多单位组合拍卖中胜者确定问题少有学者对其问津。