Quickly locating efficient, equitable deals in automated negotiations under two-sided information uncertainty

This paper develops an automated negotiation procedure inclusive of mechanism design and agent design for bilateral multi-issue negotiations under two-sided information uncertainty. The proposed negotiation mechanism comprises a protocol called MUP (Monotonic Utility-granting Protocol) and a matching strategy called WYDIWYG (What You Display Influences What You Get). The proposed preference elicitation procedure makes the agents faithful surrogates of the user they represent while the proposed Frontier Tracking Proposal Construction Algorithm (FTPCA) makes them learn the opponent's flexibility in negotiation and respond appropriately. The mechanism design and the agent design together help in locating efficient and equitable deals quickly. The efficiency, stability, simplicity, distribution symmetry and incentive compatibility of the proposed procedure are demonstrated through negotiation simulation experiments.

[1]  Melvin F. Shakun,et al.  Multi-bilateral Multi-issue E-negotiation in E-commerce with a Tit-for-Tat Computer Agent , 2005 .

[2]  J. Nash THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[3]  Bo Meng,et al.  An Adaptive Learning Method in Automated Negotiation Based on Artificial Neural Network , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[4]  Raymond Y. K. Lau,et al.  Towards genetically optimised responsive negotiation agents , 2004, Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004)..

[5]  R. Myerson,et al.  Efficient and Durable Decision Rules with Incomplete Information , 1983 .

[6]  Kalyan Chatterjee,et al.  Bargaining under Incomplete Information , 1983, Oper. Res..

[7]  Pirja Heiskanen,et al.  Decentralized method for computing Pareto solutions in multiparty negotiations , 1999, Eur. J. Oper. Res..

[8]  Jiming Liu,et al.  A genetic agent-based negotiation system , 2001, Comput. Networks.

[9]  Minjie Zhang,et al.  Adaptive conceding strategies for automated trading agents in dynamic, open markets , 2009, Decis. Support Syst..

[10]  Thomas L. Saaty,et al.  Decision-making with the AHP: Why is the principal eigenvector necessary , 2003, Eur. J. Oper. Res..

[11]  Chi-Bin Cheng,et al.  Intelligent agents for e-marketplace: Negotiation with issue trade-offs by fuzzy inference systems , 2006, Decis. Support Syst..

[12]  Jeffrey S. Rosenschein,et al.  Rules of Encounter - Designing Conventions for Automated Negotiation among Computers , 1994 .

[13]  R. Selten,et al.  A Generalized Nash Solution for Two-Person Bargaining Games with Incomplete Information , 1972 .

[14]  Eduardo Alonso Fernández,et al.  Rules of encounter: designing conventions for automated negotiation among computers , 1995 .

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

[16]  Michael Wooldridge,et al.  A Classification Scheme for Negotiation in Electronic Commerce , 2001 .

[17]  Raymond Y. K. Lau,et al.  Knowledge discovery for adaptive negotiation agents in e-marketplaces , 2008, Decis. Support Syst..

[18]  Michael Ströbel,et al.  A Framework for Electronic Negotiations Based on Adjusted-Winner Mediation , 2000, DEXA Workshop.

[19]  Lin Padgham,et al.  Searching for joint gains in automated negotiations based on multi-criteria decision making theory , 2007, AAMAS '07.

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

[21]  Jacques L. Koko,et al.  The Art and Science of Negotiation , 2009 .

[22]  Raymond Y. K. Lau Adaptive negotiation agents for e-business , 2005, ICEC '05.

[23]  Harri Ehtamo,et al.  How to select fair improving directions in a negotiation model over continuous issues , 1997, IEEE Trans. Syst. Man Cybern. Part C.

[24]  Richard Edwin Stearns,et al.  Mechanism design for software agents with complete information , 2005, Decis. Support Syst..

[25]  Raymond Y. K. Lau,et al.  Towards genetically optimised responsive negotiation agents , 2004 .

[26]  Henricus Emerence David Houba Game theoretic models of bargaining , 1994 .

[27]  Gregory E. Kersten,et al.  Pairwise issue modeling for negotiation counteroffer prediction using neural networks , 2011, Decis. Support Syst..

[28]  N. R. Jennings,et al.  To appear in: Int Journal of Group Decision and Negotiation GDN2000 Keynote Paper Automated Negotiation: Prospects, Methods and Challenges , 2022 .

[29]  Mihai Barbuceanu,et al.  A multi-attribute utility theoretic negotiation architecture for electronic commerce , 2000, AGENTS '00.

[30]  Nicholas R. Jennings,et al.  Acquiring user tradeoff strategies and preferences for negotiating agents: A default-then-adjust method , 2006, Int. J. Hum. Comput. Stud..

[31]  Nicholas R. Jennings,et al.  A fuzzy constraint based model for bilateral, multi-issue negotiations in semi-competitive environments , 2003, Artif. Intell..

[32]  Seng-cho Timothy Chou,et al.  Mediating a bilateral multi-issue negotiation , 2004, Electron. Commer. Res. Appl..

[33]  Nicholas R. Jennings,et al.  Acquiring domain knowledge for negotiating agents: a case of study , 2004, Int. J. Hum. Comput. Stud..

[34]  T. Saaty How to Make a Decision: The Analytic Hierarchy Process , 1990 .