@InProceedings{andersson00a,
  author =	 {Arne Andersson and Mattias Tenhunen and Fredrik
                  Ygge},
  title =	 {Integer Programming for Combinatorial Auction Winner
                  Determination},
  googleid =	 {CScWdn-0ItAJ:scholar.google.com/},
  booktitle =	 {Proceedings of the Fourth International Conference
                  on MultiAgent Systems},
  pages =	 {39--46},
  year =	 2000,
  publisher =	 {{IEEE}},
  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 },
  keywords =     {combinatorial auctions},
  url =		 {http://jmvidal.cse.sc.edu/library/andersson00a.pdf},
  cluster = 	 {14997748168632182537}
}