Using Graph Properties and Clustering Techniques to Select Division Mechanisms for Scalable Negotiations

This paper focuses on enabling the use of negotiation for complex system optimisation, which main challenge nowadays is scalability. Our hypothesis is that analysing the underlying network structure of these systems can help divide the problems in subproblems which facilitate distributed decision making through negotiation in these domains. In this paper, we verify this hypothesis with an extensive set of scenarios for a proof-of-concept problem. After selecting a set of network metrics for analysis, we cluster the scenarios according to these metrics and evaluate a set of mediation mechanisms in each cluster. The validation experiments show that the relative performance of the different mediation mechanisms change for each cluster, which confirms that network-based metrics may be useful for mechanism selection in complex networks.

[1]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[2]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[4]  P. Van Mieghem,et al.  Influence of assortativity and degree-preserving rewiring on the spectra of networks , 2010 .

[5]  Sarvapali D. Ramchurn,et al.  Trading agents for the smart electricity grid , 2010, AAMAS.

[6]  H. Wiener Structural determination of paraffin boiling points. , 1947, Journal of the American Chemical Society.

[7]  Francesco Amigoni,et al.  A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes , 2005, AAMAS '05.

[8]  S. Strogatz Exploring complex networks , 2001, Nature.

[9]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[10]  Andrew B. Whinston,et al.  Solving the combinatorial double auction problem , 2005, Eur. J. Oper. Res..

[11]  Makoto Yokoo,et al.  An efficient approximate algorithm for winner determination in combinatorial auctions , 2000, EC '00.

[12]  Pavel Surynek,et al.  Multi-Robot Path Planning , 2011 .

[13]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[14]  B. Schaller New York City's Congestion Pricing Experience and Implications for Road Pricing Acceptance in the United States , 2010 .

[15]  Cees Witteveen,et al.  Push and rotate: cooperative multi-agent path planning , 2013, AAMAS.

[16]  Albert-László Barabási,et al.  Hierarchical organization in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  D. Parkes,et al.  Auctions, Bidding and Exchange Design , 2004 .

[18]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[19]  Oded Goldreich Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard , 2011, Studies in Complexity and Cryptography.

[20]  Vito Latora,et al.  Modeling cascading failures in the North American power grid , 2005 .

[21]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[22]  Ryszard Kowalczyk,et al.  Searching for fair joint gains in agent-based negotiation , 2009, AAMAS.

[23]  David E. Goldberg,et al.  Multiobjective Estimation of Distribution Algorithms , 2006, Scalable Optimization via Probabilistic Modeling.

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

[25]  Minjie Zhang,et al.  Bilateral single-issue negotiation model considering nonlinear utility and time constraint , 2014, Decis. Support Syst..

[26]  Katia P. Sycara,et al.  No-commitment branch and bound search for distributed constraint optimization , 2006, AAMAS '06.

[27]  Victor R. Lesser,et al.  Cooperative, Multistep Negotiation over a Multi-dimensional Utility Function , 2000, Artificial Intelligence and Soft Computing.

[28]  Hiroki Sayama,et al.  Negotiating Complex Contracts , 2003 .

[29]  Nicholas R. Jennings,et al.  Optimal negotiation of multiple issues in incomplete information settings , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[30]  Adolfo Steiger-Garção,et al.  Multi-criteria Negotiation in Multi-Agent Systems , 1999, CEEMAS.

[31]  Pavel Surynek,et al.  An Optimization Variant of Multi-Robot Path Planning Is Intractable , 2010, AAAI.

[32]  Huaiqing Wang,et al.  Modeling constraint-based negotiating agents , 2002, Decis. Support Syst..

[33]  Martin Bichler,et al.  An experimental analysis of multi-attribute auctions , 2000, Decis. Support Syst..