Weighting estimation methods for opponents' utility functions using boosting in multi-time negotiations

Recently, multi-issue closed negotiations have attracted attention in multi-agent systems. In particular, multitime and multi-lateral negotiation strategies are important topics in multi-issue closed negotiations. In multi-issue closed negotiations, an automated negotiating agent needs to have strategies for estimating an opponent's utility function by learning the opponent's behaviors since the opponent's utility information is not open to others. However, it is difficult to estimate an opponent's utility function for the following reasons: (1) Training datasets for estimating opponents' utility functions cannot be obtained. (2) It is difficult to apply the learned model to different negotiation domains and opponents. In this paper, we propose a novel method of estimating the opponents' utility functions using boosting based on the least-squares method and nonlinear programming. Our proposed method weights each utility function estimated by several existing utility function estimation methods and outputs improved utility function by summing each weighted function. The existing methods using boosting are based on the counting method, which counts the number of values offered, considering the time elapsed when they were offered. Our experimental results demonstrate that the accuracy of estimating opponents' utility functions is significantly improved under various conditions compared with existing utility function estimation methods without boosting.

[1]  Tim Baarslag Exploring the Strategy Space of Negotiating Agents: A Framework for Bidding, Learning and Accepting in Automated Negotiation , 2016 .

[2]  A. Rubinstein Perfect Equilibrium in a Bargaining Model , 1982 .

[3]  Katsuhide Fujita Automated strategy adaptation for multi-times bilateral closed negotiations , 2014, AAMAS.

[4]  Sarit Kraus,et al.  Strategic Negotiation in Multiagent Environments , 2001, Intelligent robots and autonomous agents.

[5]  Katsuhide Fujita,et al.  Alternating Offers Protocol Considering Fair Privacy for Multilateral Closed Negotiation , 2017, PRIMA.

[6]  Chunyan Miao,et al.  KEMNAD: A KNOWLEDGE ENGINEERING METHODOLOGY FOR NEGOTIATING AGENT DEVELOPMENT , 2012, Comput. Intell..

[7]  Sarit Kraus,et al.  Multiagent Negotiation under Time Constraints , 1995, Artif. Intell..

[8]  Katsuhide Fujita,et al.  Compromising Strategy Using Weighted Counting in Multi-times Negotiations , 2014, 2014 IIAI 3rd International Conference on Advanced Applied Informatics.

[9]  Nicholas R. Jennings,et al.  Using Gaussian Processes to Optimise Concession in Complex Negotiations against Unknown Opponents , 2011, IJCAI.

[10]  Sarit Kraus,et al.  The First Automated Negotiating Agents Competition (ANAC 2010) , 2012, New Trends in Agent-Based Complex Automated Negotiations.

[11]  R. Schapire The Strength of Weak Learnability , 1990, Machine Learning.

[12]  Evgueni,et al.  Automatic Knowledge Transfer for Agent-based Bilateral Negotiation Tasks , 2014 .

[13]  Tim Baarslag Accepting Optimally with Incomplete Information , 2016 .

[14]  Takayuki Ito,et al.  Modern Approaches to Agent-based Complex Automated Negotiation , 2017 .

[15]  Katsuhide Fujita,et al.  Compromising Strategy Based on Estimated Maximum Utility for Automated Negotiation Agents Competition (ANAC-10) , 2011, IEA/AIE.

[16]  Koen V. Hindriks,et al.  Accepting optimally in automated negotiation with incomplete information , 2013, AAMAS.

[17]  Sarit Kraus,et al.  Evaluating practical negotiating agents: Results and analysis of the 2011 international competition , 2013, Artif. Intell..

[18]  Nicholas R. Jennings,et al.  Using similarity criteria to make issue trade-offs in automated negotiations , 2002, Artif. Intell..

[19]  N. R. Jennings,et al.  Multi-Issue Negotiation with Deadlines , 2006, J. Artif. Intell. Res..

[20]  Gerhard Weiss,et al.  An Efficient and Adaptive Approach to Negotiation in Complex Environments , 2012, ECAI.

[22]  Piotr Czyzżak,et al.  Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization , 1998 .

[23]  Koen V. Hindriks,et al.  Alternating Offers Protocols for Multilateral Negotiation , 2017 .

[24]  Sarit Kraus,et al.  GENIUS: AN INTEGRATED ENVIRONMENT FOR SUPPORTING THE DESIGN OF GENERIC AUTOMATED NEGOTIATORS , 2012, Comput. Intell..

[25]  Katsuhide Fujita,et al.  Preliminary Estimating Method of Opponent’s Preferences Using Simple Weighted Functions for Multi-lateral Closed Multi-issue Negotiations , 2017 .

[26]  Gerhard Weiss,et al.  Using Transfer Learning to Model Unknown Opponents in Automated Negotiations , 2014, ANAC@AAMAS.

[27]  Gerhard Weiss,et al.  Conditional Restricted Boltzmann Machines for Negotiations in Highly Competitive and Complex Domains , 2013, IJCAI.

[28]  Katsuhide Fujita,et al.  RandomDance: Compromising Strategy Considering Interdependencies of Issues with Randomness , 2017 .

[29]  K. Fujita,et al.  Weighting estimation methods for opponents' utility functions using boosting in multi-time negotiations , 2017 .