Abstract
The Simple-Meta agent uses machine learning to select the negotiation strategy that is predicted to be most successful based on structural features of the domain.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We assume a one-to-one correspondence between an agent i ∈ A and its negotiation strategy; we use i to refer to either.
References
Lin, R., Kraus, S., Baarslag, T., Tykhonov, D., Hindriks, K.V., Jonker, C.M.: Genius: an integrated environment for supporting the design of generic automated negotiators. Comput. Intell. (2012)
Breiman, L., Friedman, J., Stone, C., Olshen, R.: Classification and Regression Trees. Chapman & Hall, New York (1984)
Shibata, R.: An optimal selection of regression variables. Biometrika 68(1), 45–54 (1981)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Japan
About this chapter
Cite this chapter
Ilany, L., Gal, Y.(. (2014). The Simple-Meta Agent. In: Marsa-Maestre, I., Lopez-Carmona, M., Ito, T., Zhang, M., Bai, Q., Fujita, K. (eds) Novel Insights in Agent-based Complex Automated Negotiation. Studies in Computational Intelligence, vol 535. Springer, Tokyo. https://doi.org/10.1007/978-4-431-54758-7_14
Download citation
DOI: https://doi.org/10.1007/978-4-431-54758-7_14
Published:
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-54757-0
Online ISBN: 978-4-431-54758-7
eBook Packages: EngineeringEngineering (R0)