paper-with-me

Papers

A Control-Theoretic Approach to Dynamic Payment Routing for Success Rate Optimization

2025-10-19 · Aniket Agrawal, Harsharanga Patil arxiv

This paper introduces a control-theoretic framework for dynamic payment routing, implemented within JUSPAY's Payment Orchestrator to maximize transaction success rate. The routing system is modeled as a closed-loop feedback controller continuously sensing gateway performance, computing corrective actions, and dynamically routes transactions across gateway to ensure operational resilience. The system leverages concepts from control theory, reinforcement learning, and multi-armed bandit optimization to achieve both short-term responsiveness and long-term stability. Rather than relying on explicit PID regulation, the framework applies generalized feedback-based adaptation, ensuring that corrective actions remain proportional to observed performance deviations and the computed gateway score gradually converges toward the success rate. This hybrid approach unifies control theory and adaptive decision systems, enabling self-regulating transaction routing that dampens instability, and improves reliability. Live production results show an improvement of up to 1.15% in success rate over traditional rule-based routing, demonstrating the effectiveness of feedback-based control in payment systems.

📄 PDF Abstract BibTeX arXiv:2510.16735

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

An AI-powered Smart Routing Solution for Payment Systems

2021-11-01 · Ramya Bygari, Aayush Gupta, Shashwat Raghuvanshi, Aakanksha Bapna 외

In the current era of digitization, online payment systems are attracting considerable interest. Improving the efficiency of a payment system is important since it has a substantial impact on revenues for businesses. A g…

Maximizing Success Rate of Payment Routing using Non-stationary Bandits

2023-08-02 · Aayush Chaudhary, Abhinav Rai, Abhishek Gupta

This paper discusses the system architecture design and deployment of non-stationary multi-armed bandit approaches to determine a near-optimal payment routing policy based on the recent history of transactions. We propos…

Beyond Task Success: Measuring Workflow Fidelity in LLM-Based Agentic Payment Systems

2026-05-07 · Donghao Huang, Joon Kiat Chua, Zhaoxia Wang arxiv

LLM-based multi-agent systems are increasingly deployed for payment workflows, yet prevailing metrics, Task Success Rate (TSR) and Agent Handoff F1-Score (HF1), capture only final outcomes or unordered routing decisions.…

State-Dependent Processing in Payment Channel Networks for Throughput Optimization

2021-03-31 · Nikolaos Papadis, Leandros Tassiulas

Payment channel networks (PCNs) have emerged as a scalability solution for blockchains built on the concept of a payment channel: a setting that allows two nodes to safely transact between themselves in high frequencies …

Scheduling

Combining Cooperative Re-Routing with Intersection Coordination for Connected and Automated Vehicles in Urban Networks

2025-03-13 · Panagiotis Typaldos, Andreas A. Malikopoulos

In this paper, we present a hierarchical framework that integrates upper-level routing with low-level optimal trajectory planning for connected and automated vehicles (CAVs) traveling in an urban network. The upper-level…

Trajectory Planning