The Michigan Internet AuctionBot: a configurable auction server for human and software agents
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Approaches to winner determination in combinatorial auctions
Decision Support Systems - Special issue on information and computational economics
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Sequential Auctions for the Allocation of Resources with Complementarities
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Computationally Manageable Combinatorial Auctions
Computationally Manageable Combinatorial Auctions
Economic mechanism design for computerized agents
WOEC'95 Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1
A model for the configurable composition and synchronization of complex trading activities
Proceedings of the 2003 ACM symposium on Applied computing
Hi-index | 0.01 |
This paper describes a way to obtain sub-optimal profits in bidding for combinations of goods that are on auction at different sites, and results for an autonomous agent that bids for goods according to the proposed strategy. The types of requirements for combinations are classified as complementary, substitutive and independent. For each type, this paper specifies the region in which bidding on goods will make a positive profit. A bidding strategy is then proposed for sequential auctions under the condition that the bids by the other participants in the auction can be represented by a probabilistic function. Two simulations were constructed to evaluate the proposed strategy. They indicated that the agent that applies the proposed strategy was superior to others that bid for combinations of goods according to simple and intuitive strategies. The simulations also indicated that the proposed strategy was the equilibrium strategy of those we tested, when two agents were simultaneously bidding for the same combination of goods.