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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ito, T., Yokoo, M., Matsubara, S.: Towards a Combinatorial Auction Protocol among Experts and Amateurs: The case of Single-Skilled Experts. In: AAMAS (2003)
Likhodedov, A., Sandholm, T.: Methods for boosting revenue in combinatorial auctions. In: AAAI (2004)
Hudson, B., Sandholm, T.: Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions. In: AAMAS (2004)
Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. AI (2002)
Kushilevitz, E.: Privacy and Communication Complexity. IEEE, Los Alamitos (1989)
Wooldridge, M.: An Introduction to Multi-Agent Systems, vol. 26. John Wiley & Sons, Chichester (2002)
Roh, A.E.: Axiomatic models of bargaining. Springer, New York (1979)
Avriel, M.: Nonlinear programming. Prenic—hall Co. Inc (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shi, MY., Hu, SL. (2006). Modeling Negotiation in Combinatorial Auctions Based on Multi-agent. In: Shi, ZZ., Sadananda, R. (eds) Agent Computing and Multi-Agent Systems. PRIMA 2006. Lecture Notes in Computer Science(), vol 4088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802372_73
Download citation
DOI: https://doi.org/10.1007/11802372_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36707-9
Online ISBN: 978-3-540-36860-1
eBook Packages: Computer ScienceComputer Science (R0)