ACM Home Page
Please provide us with feedback. Feedback
Opponent modelling in automated multi-issue negotiation using Bayesian learning
Full text PdfPdf (411 KB)
Source
International Conference on Autonomous Agents archive
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 table of contents
Estoril, Portugal
SESSION: Agent and multi-agent learning table of contents
Pages 331-338  
Year of Publication: 2008
ISBN:978-0-9817381-0-9
Authors
Koen Hindriks  Delft University of Technology, Delft, The Netherlands
Dmytro Tykhonov  Delft University of Technology, Delft, The Netherlands
Sponsors
ACM: Association for Computing Machinery
AAAI : Association for the Advancement of Artifical Intelligence
Publisher
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 89,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

The efficiency of automated multi-issue negotiation depends on the availability and quality of knowledge about an opponent. We present a generic framework based on Bayesian learning to learn an opponent model, i.e. the issue preferences as well as the issue priorities of an opponent. The algorithm proposed is able to effectively learn opponent preferences from bid exchanges by making some assumptions about the preference structure and rationality of the bidding process. The assumptions used are general and consist among others of assumptions about the independency of issue preferences and the topology of functions that are used to model such preferences. Additionally, a rationality assumption is introduced that assumes that agents use a concession-based strategy. It thus extends and generalizes previous work on learning in negotiation by introducing a technique to learn an opponent model for multi-issue negotiations. We present experimental results demonstrating the effectiveness of our approach and discuss an approximation algorithm to ensure scalability of the learning algorithm.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
Faratin, P., Sierra, C., and Jennings, N. R. 1998. Negotiation Decision Functions for Autonomous Agents, in: Int. Journal of Robotics and Autonomous Systems, 24 (3--4) 159--182.
 
5
Faratin, P., Sierra, C., and Jennings, N. R. 2003. Using Similarity Criteria to Make Negotiation Trade-Offs, Journal of Artificial Intelligence, 142 (2), pp. 205--237.
 
6
 
7
Lin R., Kraus, S., Wilkenfeld, J., Barry, J. 2006. An Automated Agent for Bilateral Negotiation with Bounded Rational Agents with Incomplete Information. ECAI 2006, pp. 270--274.
 
8
Narayanan, V., Jennings, N. R. 2006. Learning to Negotiate Optimally in Non-stationary Environments, CIA 2006, LNAI 4149, pp. 288--300.
 
9
Niimura, T., Ozawa, K., Hirano, O., 2001. Fuzzy Set-based Decision Support System for Transactions of Electricity in A Deregulated Environment, IFSA World Congress, pp. 87--92.
 
10
Osborne, M. J. and Rubinstein, A. 1994, A Course in Game Theory, The MIT Press.
 
11
Raiffa, H. 1982. The Art and Science of Negotiation, Harvard University Press.
 
12
 
13
 
14
Zeng, D., and Sycara, K. 1997. Benefits of Learning in Negotiation, in Proc. of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), Providence, RI.


Collaborative Colleagues:
Koen Hindriks: colleagues
Dmytro Tykhonov: colleagues