Modeling negotiation in combinatorial auctions based on multi-agent

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Shi, M. Y., & Hu, S. L. (2006). Modeling negotiation in combinatorial auctions based on multi-agent. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4088 LNAI, pp. 644–649). Springer Verlag. https://doi.org/10.1007/11802372_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free