A Baseline for Non-Linear Bilateral Negotiations The full results of the agents competing in ANAC 2014

In the past few years, there is a growing interest in automate d negotiation in which software agents facilitate negotiation on behalf of their users and try to reach joint agreements. The potential value of dev eloping such mechanisms becomes enormous when negotiation domain is too comp lex for humans to find agreements (e.g. e-commerce) and when software compo nents need to reach agreements to work together (e.g. web-service compos ition). Here, one of the major challenges is to design agents that are able to deal with incomplete information about their opponents in negotiation as well as to effectively negotiate on their users’ behalves. To facilitate the research in t is field, an automated negotiating agent competition has been organized yearly. T his paper introduces the research challenges in ANAC 2014 and explains the compet ition set up and competition results. Furthermore, a detailed analysis of t he best performing five agent has been examined.

[1]  K. Lange,et al.  Coordinate descent algorithms for lasso penalized regression , 2008, 0803.3876.

[2]  Takayuki Ito,et al.  AgentK: Compromising Strategy based on Estimated Maximum Utility for Automated Negotiating Agents , 2012, New Trends in Agent-Based Complex Automated Negotiations.

[3]  Ya'akov Gal,et al.  BRAM Agent , 2013, Complex Automated Negotiations.

[4]  Nicholas R. Jennings,et al.  IAMhaggler2011: A Gaussian Process Regression Based Negotiation Agent , 2013, Complex Automated Negotiations.

[5]  Ya'akov Gal,et al.  Algorithm selection in bilateral negotiation , 2016, Autonomous Agents and Multi-Agent Systems.

[6]  Takayuki Ito,et al.  An Approach to Scalable Multi-issue Negotiation: Decomposing the Contract Space Based on Issue Interdependencies , 2010, 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[7]  Avshalom Elmalech,et al.  Gahboninho: Strategy for Balancing Pressure and Compromise in Automated Negotiation , 2013, Complex Automated Negotiations.

[8]  Inon Zuckerman,et al.  DoNA - A Domain-Based Negotiation Agent , 2014, ANAC@AAMAS.

[9]  Gerhard Weiss,et al.  Automated Negotiation Based on Sparse Pseudo-Input Gaussian Processes 1 , 2013 .

[10]  Bálint Szöllosi-Nagy,et al.  A Greedy Coordinate Descent Algorithm for High-Dimensional Nonlinear Negotiation , 2014, ANAC@AAMAS.

[11]  Nicholas R. Jennings,et al.  An Overview of the Results and Insights from the Third Automated Negotiating Agents Competition (ANAC2012) , 2014, Novel Insights in Agent-based Complex Automated Negotiation.

[12]  Carles Sierra,et al.  GANGSTER: An Automated Negotiator Applying Genetic Algorithms , 2014, ANAC@AAMAS.

[13]  Charles Cajori.  FOR R. S. , 2012 .

[14]  Hiromitsu Hattori,et al.  Multi-issue Negotiation Protocol for Agents: Exploring Nonlinear Utility Spaces , 2007, IJCAI.

[15]  Takayuki Ito,et al.  WhaleAgent: Hardheaded Strategy and Conceder Strategy Based on the Heuristics , 2014, ANAC@AAMAS.

[16]  Takayuki Ito,et al.  A Secure and Fair Protocol that Addresses Weaknesses of the Nash Bargaining Solution in Nonlinear Negotiation , 2010 .

[17]  Takayuki Ito,et al.  Agent's Strategy in Multiple-Issue Negotiation Competition and Analysis of Result , 2013, PRIMA.

[18]  Mark Klein,et al.  Addressing stability issues in mediated complex contract negotiations for constraint-based, non-monotonic utility spaces , 2010, Autonomous Agents and Multi-Agent Systems.

[19]  Pinar Yolum,et al.  Learning opponent’s preferences for effective negotiation: an approach based on concept learning , 2010, Autonomous Agents and Multi-Agent Systems.

[20]  Yoshiaki Kadono.  Agent YK: An Efficient Estimation of Opponent's Intention with Stepped Limited Concessions , 2014, ANAC@AAMAS.

[21]  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 .

[22]  Takayuki Ito,et al.  Efficient issue-grouping approach for multiple interdependent issues negotiation between exaggerator agents , 2014, Decis. Support Syst..

[23]  Gerhard Weiss,et al.  OMAC: A Discrete Wavelet Transformation Based Negotiation Agent , 2014, Novel Insights in Agent-based Complex Automated Negotiation.

[24]  Makoto Niimi,et al.  AgentM , 2014, ANAC@AAMAS.

[25]  Ho-fung Leung,et al.  ABiNeS: An Adaptive Bilateral Negotiating Strategy over Multiple Items , 2012, 2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.

[26]  Katsuhide Fujita,et al.  k-GAgent: Negotiating Agents Considering Interdependencies Between Issues , 2014, ANAC@AAMAS.

[27]  Koen V. Hindriks,et al.  A Tit for Tat Negotiation Strategy for Real-Time Bilateral Negotiations , 2013, Complex Automated Negotiations.

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

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

[30]  Catholijn M. Jonker,et al.  From problems to protocols: Towards a negotiation handbook , 2013, Decis. Support Syst..

[31]  Wietske Visser,et al.  A Framework for Qualitative Multi-Criteria Preferences (extended abstract) , 2012 .

[32]  Sarit Kraus,et al.  The Second Automated Negotiating Agents Competition (ANAC2011) , 2013, Complex Automated Negotiations.

[33]  Hiromitsu Hattori,et al.  A multi-issue negotiation protocol among agents with nonlinear utility functions , 2008, Multiagent Grid Syst..

[34]  Mark Klein,et al.  Negotiating Complex Contracts , 2003, AAMAS '02.

[35]  Bo An,et al.  Yushu: A Heuristic-Based Agent for Automated Negotiating Competition , 2012, New Trends in Agent-Based Complex Automated Negotiations.

[36]  Sarit Kraus,et al.  Principles of Automated Negotiation , 2014 .

[37]  Katsuhide Fujita.  Automated Negotiating Agent with Strategy Adaptation for Multi-times Negotiations , 2013, 2013 IEEE 6th International Conference on Service-Oriented Computing and Applications.

[38]  Takayuki Ito,et al.  On the Complexity of Utility Hypergraphs , 2014, ANAC@AAMAS.