Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

CP
2000
Springer

favoriteEmaildiscussreport

98views Artificial Intelligence» more CP 2000»

An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions

14 years 2 months ago

An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions

Download www.kecl.ntt.co.jp

Yuko Sakurai, Makoto Yokoo, Koji Kamei

Real-time Traffic

Artificial Intelligence | CP 2000 |

claim paper

Related Content

» Algorithm for optimal winner determination in combinatorial auctions

» Integer Programming for Combinatorial Auction Winner Determination

» Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and General...

» Randomized methods for solving the Winner Determination Problem in combinatorial auctions

» Comparing winner determination algorithms for mixed multiunit combinatorial auctions

» Approximate bidding algorithms for a distributed combinatorial auction

» An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions

» Parameterizing the winner determination problem for combinatorial auctions

» Winner determination for mixed multiunit combinatorial auctions via petri nets

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	2000
Where	CP
Authors	Yuko Sakurai, Makoto Yokoo, Koji Kamei

Comments (0)