Detecting Opponent Concessions in Multi-Issue Automated Negotiation

  1. (PDF, 337 KB)
AuthorSearch for: ; Search for: ; Search for: ; Search for:
ConferenceThe 8th International Conference on Electronic Commerce (ICEC'06), August 14, 2006., Fredericton, New Brunswick, Canada
Subjectautomated negotiation; preferences; learning; mutli-issue negotiation; negotiation protocols; negotiation strategies; préférences; apprentissage; négociation multi-objet; protocoles de négociation; stratégies de négociation
AbstractAn agent engaged in multi-issue automated negotiation can benefit greatly from learning about its opponent's preferences. Knowledge of the opponent's preferences can help the agent not only to find mutually acceptable agreements more quickly, but also to negotiate deals that are better for the agent in question. In this paper, we describe a new technique for learning about an opponent's preferences by observing its history of offers in a negotiation. Patterns in the similarity between the opponent's offers and our own agent's offers are used to determine the likelihood that the opponent is making a concession at each stage in the negotiation. These probabilities of concession are then used to determine the opponent's most likely preference relation over all offers. Experimental results show that our technique significantly outperforms a previous method that assumes that a negotiation agent will always make concessions during the course of a negotiation.
Publication date
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number48552
NPARC number8913751
Export citationExport as RIS
Report a correctionReport a correction
Record identifier65e889f3-f32d-41ac-8acf-97f1817b7d3a
Record created2009-04-22
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)
Date modified: