Approximation algorithms for a winner determination problem of single-item multi-unit auctions
暂无分享,去创建一个
[1] Yunhong Zhou,et al. Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems , 2006, ISAAC.
[2] Paul Milgrom,et al. Putting Auction Theory to Work , 2004 .
[3] Takayuki Ito,et al. An Analysis about Approximated Allocation Algorithms of Combinatorial Auctions with Large Numbers of Bids , 2007 .
[4] Martin Dyer,et al. AN O(n) ALGORITHM FOR THE MULTIPLE-CHOICE , 2007 .