Indexed by:
Abstract:
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. © Springer-Verlag Berlin Heidelberg 2006.
Keyword:
Reprint 's Address:
Email:
Source :
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN: 0302-9743
Year: 2006
Volume: 4088 LNAI
Page: 644-649
Language: English
0 . 4 0 2
JCR@2005
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 3
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 3
Affiliated Colleges: