Abstract
Negotiations are an important way of reaching agreements between selfish autonomous agents. In this paper we focus on one-to-many bargaining within the context of agent-mediated electronic commerce. We consider an approach where a seller negotiates over multiple interdependent attributes with many buyers individually. Bargaining is conducted in a bilateral fashion, using an alternating-offers protocol. In such a one-to-many setting, “fairness,” which corresponds to the notion of envy-freeness in auctions, may be an important business constraint. For the case of virtually unlimited supply (such as information goods), we present a number of one-to-many bargaining strategies for the seller, which take into account the fairness constraint, and consider multiple attributes simultaneously. We compare the performance of the bargaining strategies using an evolutionary simulation, especially for the case of impatient buyers and small premature bargaining break off probability. Several of the developed strategies are able to extract almost all the surplus; they utilize the fact that the setting is one-to-many, even though bargaining occurs in a bilateral fashion.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Goldberg, A.V., Hartline, J.D.: Envy-free auctions for digital goods. In: Proceedings of the 4th conference on Electronic commerce, pp. 29–35. ACM, New York (2003)
Gerding, E., van Bragt, D., Poutré, J.L.: Multi-issue negotiation processes by evolutionary simulation: Validation and social extensions. Computational Economics 22, 39–63 (2003)
Fatima, S., Wooldridge, M., Jennings, N.R.: Comparing equilibria for game theoretic and evolutionary bargaining models. In: Proc. 5th Int. Workshop on Agent-Mediated E-Commerce, Melbourne, Australia, pp. 70–77 (2003)
Phelps, S., McBurney, P., Parsons, S., Sklar, E.: Co-evolutionary auction mechanism design: A preliminary report. In: Padget, J.A., Shehory, O., Parkes, D.C., Sadeh, N.M., Walsh, W.E. (eds.) AMEC 2002. LNCS (LNAI), vol. 2531, pp. 123–142. Springer, Heidelberg (2002)
Cliff, D.: Explorations in evolutionary design of online auction market mechanisms. Electronic Commerce Research and Applications 2, 162–175 (2003)
Klein, M., Faratin, P., Sayama, H., Bar-Yam, Y.: Negotiating complex contracts. Group Decision and Negotiation 12, 111–125 (2003)
Faratin, P., Sierra, C., Jennings, N.R.: Using similarity criteria to make issue trade-offs. Journal of Artificial Intelligence 142, 205–237 (2003)
Ehtamo, H., Hämäläinen, R.P.: Interactive multiple-criteria methods for reaching pareto optimal agreements in negotiations. Group Decision and Negotiation 10, 475–491 (2001)
Somefun, D.J.A., Gerding, E.H., Bohte, S.M., La Poutré, J.A.H.: Automated negotiation and bundling of information goods. In: Faratin, P., Parkes, D.C., Rodríguez-Aguilar, J.-A., Walsh, W.E. (eds.) AMEC 2003. LNCS, vol. 3048, pp. 1–17. Springer, Heidelberg (2004)
Rubinstein, A.: Perfect equilibrium in a bargaining model. Econometrica 50, 97–109 (1982)
Tesfatsion, L.: (Guest Editor) Special issue on agent-based computational economics. Journal of Economic Dynamics and Control 25 (2001)
Bäck, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, Oxford (1996)
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
Gerding, E.H., Somefun, D.J.A., La Poutré, J.A.H. (2006). Multi-attribute Bilateral Bargaining in a One-to-Many Setting. In: Faratin, P., Rodríguez-Aguilar, J.A. (eds) Agent-Mediated Electronic Commerce VI. Theories for and Engineering of Distributed Mechanisms and Systems. AMEC 2004. Lecture Notes in Computer Science(), vol 3435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575726_10
Download citation
DOI: https://doi.org/10.1007/11575726_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29737-6
Online ISBN: 978-3-540-33166-7
eBook Packages: Computer ScienceComputer Science (R0)