Click here for full text:
An Optimal Dynamic Programming Model for Algorithm Design in Simultaneous Auctions.
Byde, Andrew
HPL-2001-67
Keyword(s): auction; decision theory; dynamic programming; algorithm
Abstract: In this paper we study algorithms for agents participating in multiple simultaneous auctions for a single private-value good; we use stochastic dynamic programming to derive formal methods for optimal algorithm specification; we study a number of algorithms of complementary complexity and effectiveness, and report preliminary tests on them. The methods and analysis in this paper extend naturally to more complicated scenarios, such as the purchase of multiple complementary goods, although different problem areas bring their own challenges with respect to computational complexity.
15 Pages
Back to Index
| 
printable version
