Abstract
The learning behaviours of buyers and sellers in the sealed-bid Bargaining Mechanism were studied under the assumption of bounded rationality. The learning process of the agents is modelled by particle swarm optimization (PSO) algorithm. In the proposed model, there are two populations of buyers and sellers with limited computation ability and they were randomly matched to deal repeatedly. The agent’s bidding strategy is assumed to be a linear function of his value of trading item and each agent adjusts his strategy in repeated deals by imitating the most successful member in his population and by own past experience. Such learning pattern by PSO is closer to the behaviours of human beings in real life. Finally, the simulated results show that the bidding strategies of the agents in both populations will converge near the theoretical linear equilibrium solutions (LES).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
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
Zhu, X., Yu, Q., Wang, X. (2006). Strategic Learning in the Sealed-Bid Bargaining Mechanism by Particle Swarm Optimization Algorithm. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence. ICIC 2006. Lecture Notes in Computer Science(), vol 4114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37275-2_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-37275-2_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37274-5
Online ISBN: 978-3-540-37275-2
eBook Packages: Computer ScienceComputer Science (R0)