|
||||||||||||||||||||||
|
||||||||||||||||||||||
 ABSTRACT
In this study we provide a strategy that maximizes the expected revenues of the auctioneer in an expanding multi-unit auction. We model the auction process as a state graph in which nodes are auction states and edges are transitions. With this model, finding the optimal strategy is equivalent to solving a search problem on the state graph. We prove that the search problem to be solved, although seemingly exponentially complex, is actually linearly bounded. Based on this result, we introduce an informed strategy that optimizes the auctioneer's revenue. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
General Terms:
The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads:  Adobe Acrobat
 QuickTime
 Windows Media Player
 Real Player
|
||||||||||||||||||||||
Pdf
I.2