Loading...
Please wait, while we are loading the content...
Similar Documents
An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions (2000)
| Content Provider | CiteSeerX |
|---|---|
| Author | Sakurai, Yuko Yokoo, Makoto Kamei, Koji |
| Description | In Proceedings of the Second acm Conference on Electronic Commerce This paper presents an approximate algorithm for the winner determination problem in combinatorial auctions. This algorithm is based on limited discrepancy search (LDS). Internet auctions have become an integral part of Electronic Commerce and can incorporate large-scale, complicated types of auctions including combinatorial auctions, where multiple items are sold simultaneously and bidders can express complementarity among these items. Although we can increase participants' utilities by using combinatorial auctions, determining the optimal winners is a complicated constraint optimization problem that is shown to be NP-complete. We introduce the idea... |
| File Format | |
| Language | English |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Optimal Winner Efficient Approximate Algorithm Approximate Algorithm Limited Discrepancy Search Integral Part Winner Determination Combinatorial Auction Electronic Commerce Multiple Item Complicated Constraint Optimization Problem Internet Auction Winner Determination Problem |
| Content Type | Text |
| Resource Type | Article |
