Market-based control: a paradigm for distributed resource allocation
Market-based control: a paradigm for distributed resource allocation
Computationally Manageable Combinational Auctions
Management Science
An efficient approximate allocation algorithm for combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Iterative Combinatorial Auctions: Theory and Practice
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Resource allocation games with changing resource capacities
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Combinatorial Auctions
Towards self-organising agent-based resource allocation in a multi-server environment
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
An Adaptive Bidding Strategy in Multi-round Combinatorial Auctions for Resource Allocation
ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 02
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Agents' bidding strategies in a combinatorial auction controlled grid environment
TADA/AMEC'06 Proceedings of the 2006 AAMAS workshop and TADA/AMEC 2006 conference on Agent-mediated electronic commerce: automated negotiation and strategy design for electronic markets
| Hi-index | 0.00 |
Combinatorial auction, where bidders can bid on bundles of items, has been the subject of increasing interest in recent years. Although much research work has been conducted on combinatorial auctions, most has focused on the winner determination problem. A largely unexplored area of research in combinatorial auctions is the design of bidding strategies. In this paper, we propose a new adaptive bidding strategy for combinatorial auction-based resource allocation problem in dynamic markets. A bidder adopting this strategy can adjust his profit margin constantly according to his bidding history, thus perceiving and responding to the dynamic market in a timely manner. Experiment results show that agents adaptive bidding strategy perform very well, even without any prior knowledge about the market.