Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/a-comparison-of-bidding-strategies-for-simultaneous-auctions-OuU14mWizP
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2006 by ACM Inc.
- ISSN
- 1551-9031
- DOI
- 10.1145/1124566.1124572
- Publisher site
- See Article on Publisher Site
Abstract
Bidding for multiple items or bundles on online auctions raise challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary bundle. In the real world all or most of the items of interest to an agent is not present in a single combinatorial auction. We focus on bidding for multiple items in a set of auctions, each of which sell only a single unit of a particular item. Hence an agent has to bid in multiple auctions to obtain item bundles. While an optimal bidding strategy is known when bidding in sequential auctions, only suboptimal strategies are available when bidding for items sold in auctions running simultaneously. We investigate a hill-climbing bidding strategy, which is optimal given an infinite number of restarts, to decide on an agent's bid for simultaneous auctions. We provide a comparison of this algorithm with existing ones, both in terms of utilities generated and computation time, along with a discussion of the strengths and weaknesses of these strategies.
Journal
ACM SIGecom Exchanges – Association for Computing Machinery
Published: Jan 1, 2006