Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Integer Programming for Combinatorial Auction Winner Determination Arne Andersson Mattias Tenhunen Fredrik Ygge
 

Summary: Integer Programming for Combinatorial Auction Winner Determination
Arne Andersson Mattias Tenhunen Fredrik Ygge
Computing Science Department
Information Technology
Uppsala University
Box 337
SE ­ 751 05 Uppsala, Sweden
{arnea,tein,ygge}@csd.uu.se
http://www.csd.uu.se/”{arnea,tein,ygge}
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 effi­
ciency of the auction, while keeping risks for bidders low.
However, the determination of an optimal winner combina­
tion in combinatorial auctions is a complex computational
problem.
In this paper we (i) compare recent algorithms for win­
ner determination to traditional algorithms, (ii) present
and benchmark a mixed integer programming approach to

  

Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences