Integer Programming for Combinatorial Auction Winner Determination Export

@inproceedings{andersson00a, abstract = {Combinatorial auctions are important as they enable bidders to place bids on combinations of items. Compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping low risks for bidders. However, the determination of an optimal winner combination in combinatorial auctions is a complex computational problem. In this paper we: 1) compare recent algorithms for winner determination to traditional algorithms; 2) present and benchmark a mixed integer programming approach to the problem, which enables very general auctions to be treated efficiently by standard integer programming algorithms (and hereby also by commercially available software); and 3) discuss the impact of the probability distributions chosen for benchmarking}, author = {Andersson, Arne and Tenhunen, Mattias and Ygge, Fredrik}, booktitle = {Proceedings of the Fourth International Conference on MultiAgent Systems}, citeulike-article-id = {1585759}, citeulike-linkout-0 = {http://jmvidal.cse.sc.edu/library/andersson00a.pdf}, keywords = {auctions, bibtex-import, combinatorial}, pages = {39--46}, posted-at = {2007-08-23 14:42:25}, priority = {2}, publisher = {{IEEE}}, title = {Integer Programming for Combinatorial Auction Winner Determination}, url = {http://jmvidal.cse.sc.edu/library/andersson00a.pdf}, year = {2000} }

TY - CONF ID - andersson00a L3 - citeulike-article-id:1585759 N2 - Combinatorial auctions are important as they enable bidders to place bids on combinations of items. Compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping low risks for bidders. However, the determination of an optimal winner combination in combinatorial auctions is a complex computational problem. In this paper we: 1) compare recent algorithms for winner determination to traditional algorithms; 2) present and benchmark a mixed integer programming approach to the problem, which enables very general auctions to be treated efficiently by standard integer programming algorithms (and hereby also by commercially available software); and 3) discuss the impact of the probability distributions chosen for benchmarking EP - 46 TI - Integer Programming for Combinatorial Auction Winner Determination PB - {IEEE} T2 - Proceedings of the Fourth International Conference on MultiAgent Systems SP - 39 KW - auctions KW - bibtex-import KW - combinatorial AU - Andersson, Arne AU - Tenhunen, Mattias AU - Ygge, Fredrik PY - 2000/// UR - http://jmvidal.cse.sc.edu/library/andersson00a.pdf ER -