Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Decision procedures for multiple auctions
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
A Dynamic Programming Model for Algorithm Design in Simultaneous Auctions
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
Developing a bidding agent for multiple heterogeneous auctions
ACM Transactions on Internet Technology (TOIT)
Probabilistic Automated Bidding in Multiple Auctions
Electronic Commerce Research
Continuous value function approximation for sequential bidding policies
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Efficient Bidding Strategies for Simultaneous Cliff-Edge Environments
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Bidding optimally in concurrent second-price auctions of perfectly substitutable goods
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Journal of Artificial Intelligence Research
Efficient bidding strategies for Cliff-Edge problems
Autonomous Agents and Multi-Agent Systems
Web Intelligence and Agent Systems
| Hi-index | 0.00 |
This paper investigates utility maximising bidding heuristics for agents that participate in multiple heterogeneous auctions, in which the auction format and the starting and closing times can be different. Our strategy allows an agent to procure one or more items and to participate in any number of auctions. For this case, forming an optimal bidding strategy by global utility maximisation is computationally intractable, and so we develop two-stage heuristics that first provide reasonable bidding thresholds with simple strategies before deciding which auctions to participate in. The proposed approach leads to an average gain of at least 24% in agent utility over commonly used benchmarks.