Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Introduction to Multiagent Systems
Introduction to Multiagent Systems
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Methods for boosting revenue in combinatorial auctions
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Hi-index | 0.00 |
Combinatorial auctions can be used to reach efficient resource and task allocations in multi-agent system where the items are complementary or substitutable. Determining the winners is NP-complete. This paper presents a negotiation model which is based on the multi-agent, and gives the basic characteristics and the satisfied conditions of winner determination which is determined by the solution of Nash negotiation and indicate the rationality and fairness of this method based on the analysis about the utility increment of the bid agent and the benefit increment of the auction agent.