Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding
暂无分享,去创建一个
[1] Nicholas R. Jennings,et al. Polynomial algorithms for clearing multi-unit single-item and multi-unit combinatorial reverse auctions , 2002, ECAI.
[2] Nicholas R. Jennings,et al. Optimal clearing algorithms for forward and reverse combinatorial auctions with demand/supply functi , 2002 .
[3] David Levine,et al. Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.
[4] Subhash Suri,et al. Market Clearability , 2001, IJCAI.
[5] Soumyadip Ghosh,et al. Bid Evaluation in Procurement Auctions with Piecewise Linear Supply Curves , 2005, J. Heuristics.
[6] Andrew J. Davenport,et al. Price Negotiations for Procurement of Direct Inputs , 2002 .
[7] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[8] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[9] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[10] Daniel Lehmann,et al. Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics , 2000, EC '00.