Multi-Agent Negotiation for Adaptive Capacity Scaling in Post-Merger Payment Networks
Keywords:
multi-agent systems, negotiation protocols, capacity scaling, post-merger integration, transaction processingAbstract
After the merger of digital payment platforms, transaction throughput and integration complexity can increase exponentially, which might be too much for old infrastructure to handle. This aim of this study is to suggests a multi-agent negotiation paradigm for flexible capacity scaling across diverse authorisation clusters. Agents engage in decentralised reasoning over latency service-level goals (SLOs) and compute-cost budgets, dynamically compute reallocation, memory, and message queue quotas.
Downloads
References
M. Wooldridge, An Introduction to MultiAgent Systems, 2nd ed. Wiley, 2009.
K. Sycara, “Multiagent systems,” AI Magazine, vol. 19, no. 2, pp. 79–92, 1998.
M. Yokoo, S. Kraus, T. Ito, and K. Kuwabara, “The effect of communication among agents in distributed constraint satisfaction problems,” Artificial Intelligence, vol. 101, no. 1-2, pp. 123–155, 1998.
R. H. Bordini, M. Wooldridge, and J. F. Hübner, “Programming multi-agent systems in AgentSpeak using Jason,” Wiley Series in Agent Technology, 2007.
T. Sandholm, “Distributed rational decision making,” in Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, G. Weiss, Ed. MIT Press, 1999, pp. 201–258.
F. Bellifemine, G. Caire, and D. Greenwood, Developing Multi-Agent Systems with JADE. Wiley, 2007.
M. J. Wooldridge and N. R. Jennings, “Intelligent agents: Theory and practice,” The Knowledge Engineering Review, vol. 10, no. 2, pp. 115–152, 1995.
J. F. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach, 7th ed. Pearson, 2017.
P. Gupta and N. McKeown, “Packet classification on multiple fields,” in ACM SIGCOMM Computer Communication Review, vol. 29, no. 4, 1999, pp. 147–160.
L. Kleinrock, Queueing Systems, Volume 1: Theory. Wiley-Interscience, 1975.
D. Fudenberg and J. Tirole, Game Theory. MIT Press, 1991.
R. K. Dash, N. R. Jennings, and C. Sierra, “A computationally efficient heuristic for multi-issue negotiation,” in Proceedings of the 2nd International Joint Conference on Autonomous Agents and Multiagent Systems, 2003, pp. 119–126.
C. Boutilier, R. Brafman, C. Domshlak, H. H. Hoos, and D. Poole, “CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements,” Journal of Artificial Intelligence Research, vol. 21, pp. 135–191, 2004.
M. H. M. Win, K. Leung, and A. W. C. Fu, “Dynamic resource allocation in data centers for maximizing service-level agreement compliance,” in 2016 IEEE International Conference on Cloud Computing Technology and Science (CloudCom), 2016, pp. 128–135.
S. Bianchi, G. D’Angelo, and G. P. Rossi, “Resource allocation for transaction processing in distributed payment systems,” Journal of Network and Computer Applications, vol. 68, pp. 42–56, 2016.
D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization. Athena Scientific, 1997.
A. M. MacKenzie and S. B. Wicker, “Game theory in communications: Motivation, explanation, and application to power control,” in IEEE Global Telecommunications Conference (GLOBECOM), 2001, vol. 2, pp. 821–826.
R. Buyya, C. S. Yeo, and S. Venugopal, “Market-oriented cloud computing: Vision, hype, and reality for delivering IT services as computing utilities,” in Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications, 2008, pp. 5–13.
J. Yang, K. Chen, and Y. Xue, “Game-theoretic approach for resource allocation in mobile edge computing,” in 2017 IEEE International Conference on Communications (ICC), 2017, pp. 1–6.
M. Chiang and T. Zhang, “Fog and IoT: An overview of research opportunities,” IEEE Internet of Things Journal, vol. 3, no. 6, pp. 854–864, Dec. 2016.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
