| dc.contributor.author | Bertsimas, Dimitris J. | |
| dc.contributor.author | Hawkins, Jeff | |
| dc.contributor.author | Perakis, Georgia | |
| dc.date.accessioned | 2003-12-23T02:41:43Z | |
| dc.date.available | 2003-12-23T02:41:43Z | |
| dc.date.issued | 2002-01 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/4006 | |
| dc.description.abstract | Online auctions are arguably one of the most important and distinctly new applications of the internet. The predominant player in online auctions, eBay, has over 18.9 milllion users, and it was the host of over $5 billion worth of goods sold in the year 2000. Using methods from approximate dynamic programming and integer programming, we design algorithms for optimally bidding for a single item online auction, and simultaneous or overlapping multiple online auctions. We report computational evidence using data from eBay's web site from 1772 completed auctions for personal digital assistants and from 4208 completed auctions for stamp collections that show that (a) the optimal dynamic strategy outperforms simple but widely used static heuristic rules for a single auction, and (b) a new approach combining the value functions of single auctions found by dynamic programming using an integer programming framework produces high quality solutions fast and reliably. | en |
| dc.description.sponsorship | Singapore-MIT Alliance (SMA) | en |
| dc.format.extent | 508996 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | High Performance Computation for Engineered Systems (HPCES); | |
| dc.subject | online auctions | en |
| dc.subject | optimal bidding algorithms | en |
| dc.subject | eBay | en |
| dc.subject | optimal dynamic strategy | en |
| dc.subject | static heuristic rules | en |
| dc.title | Optimal Bidding in Online Auctions | en |
| dc.type | Article | en |
