System and method for intraday netting payment finality

• US 6,076,074 A
• Filed: 05/05/1999
• Issued: 06/13/2000
• Est. Priority Date: 05/05/1998
• Status: Active Grant

• Current Assignee: The Clearing House Payments Company LLC (The Clearing House LLC)
• Original Assignee: The Clearing House Service Company, LLC
• Inventors: Pawelczyk, Joseph S., Thomas, George F., Cotton, Robert M.
• Primary Examiner(s): Trammell, James P.
• Assistant Examiner(s): Retta, Yehdega
• Application Number:
  US09/305,311
• Time in Patent Office: 405 Days
• Field of Search: 705/1, 705/35, 705/39, 705/40
• US Class Current: 705/40
• CPC Class Codes: G06Q 20/102 Bill distribution or payments
• CPC Class Codes: G06Q 40/00 Finance; Insurance; Tax strategies; Processing of corporate or income taxes
• CPC Class Codes: G06Q 40/02 Banking, e.g. interest calculation or account maintenance credit or loans G06Q40/03

Abstract

A system is provided for continuous intraday final settlement of payment orders among a plurality of financial-institution participants. The system includes a central controlling agent, including a central computer operable to communicate electronically with satellite computer stations of the plurality of participants to receive payment orders therefrom, and to control release of payments among the plurality of participants; and means for storing a plurality of prefunded balances in a prefunded balance account, each balance representing the right of one of the participants to payment from the prefunded balance account and containing an initial prefunded balance for each participant at the start of each business day.

Claims

1. A system for continuous intraday final settlement of payment orders among a plurality of financial-institution participants, each having an associated satellite computer station operable to transmit payment orders electronically and each being operable to function as a payment receiving participant and a payment sending participant;

said system comprising;

(a) a central controlling agent, including a central computer operable to communicate electronically with the satellite computer stations of the plurality of participants to receive payment orders therefrom, and to control release of payment orders among the plurality of participants; and

(b) means for storing a plurality of prefunded balances in a prefunded balance account, each balance representing the right of one of the participants to payment from the prefunded balance account and containing an initial prefunded balance for each participant at a start of each business day,

wherein said central computer is operable on a continuous basis;

(1) upon receipt of a payment order by said central controlling agent from one of said participants, operating as a sending participant, for payment to another of said participants, operating as a receiving participant, to categorize each received payment order as small if it is less than a predetermined percentage of one of the initial prefunded balance for the associated sending participant and the initial prefunded balance for the associated receiving participant, and as large otherwise;

(2) to store the received payment order in a queue maintained by said central computer;

(3) to monitor the queue for previously stored small payment orders as candidates for immediate release for payment;

(4) to determine if release of a candidate small payment order for payment will cause available balances for both the sending participant and the receiving participant associated with the candidate small payment order to fall within respective predetermined limits;

(5) if the determination in step (4) is positive, to release the candidate small payment order by debiting the available balance of the sending participant and crediting the available balance of the receiving participant by the amount of the associated candidate small payment order;

(6) to monitor the queue for previously stored target large payment orders for payment from a sending participant to a receiving participant;

(7) to release a target large payment order stored in the queue by performing multilateral batching (i) by forming a first tree comprised of the target payment order and, if necessary, helper payment orders in a direction towards the sending participant of the target payment order, from at least one sending participant other than the sending participant of the target large payment order;

(ii) by forming a second tree comprised of the target payment order and, if necessary, helper payment orders in a direction away from the receiving participant of the large target payment order, to at least one receiving participant other than the receiving participant of the target payment order;

(iii) debiting the available balances of the sending participant of the target large payment order and of the sending participants of the helper payment orders in a multilateral batch comprising the target and helper payment orders of the first and second trees by the amounts of each respective payment order; and

(iv) crediting the balances of the receiving participant of the target large payment and of the receiving participants of the helper payment orders in the multilateral batch by the amounts of the respective payment orders;

the multilateral batch having been chosen so that after the payment orders comprising the first and second trees are released, the resulting position in the available balance of each participant involved in the multilateral batching falls within predetermined limits.

2. The system according to claim 1, wherein the central computer system is operable to selectively offset, in a bilateral batch, the amount of a target large payment order by searching the queue for a previously queued second payment order from the associated receiving participant of the target large payment order;

to generate a pseudo-payment order in an amount of a net difference between the target large payment order and the second payment order; and

to store the pseudo-payment order in the queue.

3. The system according to claim 2, wherein the central computer is operable to select the second payment order in the bilateral batch within a range between half as large as the target large payment order of the bilateral batch and twice as large as the target large payment order.

4. The system according to claim 1, wherein the central computer is operable to select small payment orders for release from the queue in accordance with a first-in first-out queue discipline.

5. The system according to claim 4, wherein the central computer is operable to select small payment orders for release from the queue in accordance with the Gale-Shapley algorithm.

6. The system according to claim 1, wherein the central computer selects the predetermined percentage for categorizing queued payment orders as small payment orders to be 80% of the lesser of the initial prefunded balance for the associated sending participant and the initial prefunded balance for the associated receiving participant.

7. The system according to claim 1, wherein the central computer is operable to set the predetermined limits such that the available balance of any of the prefunded balances cannot exceed 200% of the initial prefunded balance or go below zero.

8. The system according to claim 1, wherein the small category of payment orders is divided into subcategories medium and very small, wherein only large and medium payment orders are eligible to become helper payment orders.

9. The system according to claim 8, wherein the queue comprises a plurality of queues, and wherein very small, medium and large payment orders are stored in various ones of said plurality of queues on the basis of the size of the respective payment orders.

10. A method for continuous intraday final settlement of payment orders among a plurality of financial-institution participants, each having an associated satellite computer station operable to transmit payment orders electronically and each being operable to function as a payment receiving participant and a payment sending participant by a central controlling agent including a central computer operable to communicate electronically with the satellite computer stations of the plurality of participants to receive payment orders therefrom, and to control release of payment orders among the plurality of participants;

and means for storing a plurality of prefunded balances in a prefunded balance account, each balance representing the right of one of the participants to payment from the prefunded balance account and containing an initial prefunded balance at a start of each business day, said method comprising the steps of;

(1) upon receipt of a payment order by the central controlling agent from one of the participants, operating as a sending participant, for payment to another of the participants, operating as a receiving participant, categorizing each received payment order as small if it is less than a predetermined percentage of one of the initial prefunded balance for the associated sending participant and the initial prefunded balance for the associated receiving participant, and as large otherwise;

(2) storing the received payment order in a queue maintained by the central computer;

(3) monitoring the queue for previously stored small payment orders as candidates for immediate release for payment;

(4) determining if release of a candidate small payment order for payment will cause available balances for both the sending participant and the receiving participant associated with the candidate small payment order to fall within respective predetermined limits;

(5) if the determination in step (4) is positive, releasing the candidate small payment order by debiting the available balance of the sending participant crediting the available balance of the receiving participant by the amount of the associated candidate small payment order;

(6) monitoring the queue for previously stored target large payment orders for payment from a sending participant to a receiving participant;

(7) releasing a target large payment order stored in the queue by performing multilateral batching (i) by forming a first tree comprised of the target payment order and, if necessary, helper payment orders in a direction towards the sending participant of the target payment order, from at least one sending participant other than the receiving participant of the target large payment order;

(ii) by forming a second tree comprised of the target payment order and, if necessary, helper payment orders in a direction away from the receiving participant of the large target payment order, to at least one receiving participant other than the receiving participant of the target payment order;

(iii) debiting the available balances of the sending participant of the target large payment order and of the sending participants of the helper payment orders in a multilateral batch comprising the target and helper payment orders of the first and second trees by the amounts of each respective payment order; and

(iv) crediting the balances of the receiving participant of the target large payment and of the receiving participants of the helper payment orders in the multilateral batch by the amounts of the respective payment orders;

the multilateral batch having been chosen so that after the payment orders comprising the first and second trees are released, the resulting position in the available balance of each participant involved in the multilateral batching falls within predetermined limits.

11. The method according to claim 10, further comprising the steps of:

selectively offsetting, in a bilateral batch, the amount of the target large payment order by searching the queue for a previously queued second payment order from the associated receiving participant of the target large payment order;

generating a pseudo-payment order in an amount of a net difference between the target large payment order and the second payment order; and

storing the pseudo-payment order in the queue.

12. The method according to claim 11, wherein the second payment order in the bilateral batch must fall within a range between half as large as the target large payment order of the bilateral batch and twice as large as the target large payment order.

13. The method according to claim 10, wherein small payment orders are selected for release from the queue in accordance with a first-in first-out queue discipline.

14. The method according to claim 13, wherein small payment orders are selected for release from the queue in accordance with the Gale-Shapley algorithm.

15. The method according to claim 10, wherein the predetermined percentage for categorizing queued payment orders as small payment orders is selected to be 80% of the lesser of the initial prefunded balance for the associated sending participant and the initial prefunded balance for the associated receiving participant.

16. The method according to claim 10, wherein the predetermined limits are set such that the available balance of any of the prefunded balances cannot exceed 200% of the initial prefunded balance or go below zero.

17. The method according to claim 10, wherein the small category of payment orders is divided into subcategories medium and very small, wherein only large and medium payment orders are eligible to become helper payment orders.

18. The method according to claim 17, wherein the queue comprises a plurality of queues, and wherein very small, medium and large payment orders are stored in various ones of said plurality of queues on the basis of the size of the respective payment orders.

19. A computer-readable medium storing code executable by a central computer, the code controlling the central computer to perform a method for continuous intraday final settlement of payment orders among a plurality of financial-institution participants, each having an associated satellite computer station operable to transmit payment orders electronically and each being operable to function as a payment receiving participant and a payment sending participant, the central computer forming a part of a central controlling agent and being operable to communicate electronically with the satellite computer stations of the plurality of participants to receive payment orders therefrom, to control release of payment orders among the plurality of participants, and to control means for storing a plurality of prefunded balances in a prefunded balance account, each balance representing the right of one of the participants to payment from the prefunded balance account and containing an initial prefunded balance for each participant at a start of each business day, the method comprising the steps of:

(1) upon receipt of a payment order by the central controlling agent from one of the participants, operating as a sending participant, for payment to another of the participants, operating as a receiving participant, categorizing each received payment order as small if it is less than a predetermined percentage of one of the initial prefunded balance for the associated sending participant and the initial prefunded balance for the associated receiving participant, and as large otherwise;

(2) storing the received payment order in a queue maintained by the central computer;

(3) monitoring the queue for previously stored small payment orders as candidates for immediate release for payment;

(4) determining if release of a candidate small payment order for payment will cause available balances of both the sending participant and the receiving participant associated with the candidate small payment order to fall within respective predetermined limits;

(5) if the determination in step (4) is positive, releasing the candidate small payment order by debiting the available balance of the sending participant and crediting the available balance of the receiving participant by the amount of the associated candidate small payment order;

(6) monitoring the queue for previously stored target large payment orders for payment from a sending participant to a receiving participant;

(7) releasing a target large payment order stored in the queue by performing multilateral batching (i) by forming a first tree comprised of the target payment order and, if necessary, helper payment orders in a direction towards the sending participant of the target payment order, from at least one sending participant other than the sending participant of the target large payment order;

(ii) by forming a second tree comprised of the target payment order and, if necessary, helper payment orders in a direction away from the receiving participant of the target large payment order, to at least one receiving participant other than the receiving participant of the target payment order;

(iii) debiting the available balances of the sending participant of the target large payment order and of the sending participants of the helper payment orders in a multilateral batch comprising the target and helper payment orders of the first and second trees by the amounts of each respective payment order; and

(iv) crediting the available balances of the receiving participant of the target large payment and of the receiving participants of the helper payment orders in the multilateral batch by the amounts of the respective payment orders;

the multilateral batch having been chosen so that after the payment orders comprising the first and second trees are released, the resulting position in the available balance of each participant involved in the multilateral batching falls within predetermined limits.

20. The computer-readable medium according to claim 19, further comprising code to cause the central computer to perform the steps of:

selectively offsetting, in a bilateral batch, the amount of the target large payment order by searching the queue for a previously queued second payment order from the associated receiving participant of the target large payment order;

generating a pseudo-payment order in an amount of a net difference between the target large payment order and the second payment order; and

storing the pseudo-payment order in the queue.

21. The computer-readable medium according to claim 20, wherein the second payment order in the bilateral batch must fall within a range between half as large as the target large payment order of the bilateral batch and twice as large as the target large payment order.

22. The computer-readable medium according to claim 19, wherein small payment orders are selected for release from the queue in accordance with a first-in first-out queue discipline.

23. The computer-readable medium according to claim 22, wherein small payment orders are selected for release from the queue in accordance with the Gale-Shapley algorithm.

24. The computer-readable medium according to claim 19, wherein the predetermined percentage for categorizing queued payment orders as small payment orders is selected to be 80% of the lesser of the initial prefunded balance for the associated sending participant and the initial prefunded balance for the associated receiving participant.

25. The computer-readable medium according to claim 19, wherein the predetermined limits are set such that the available balance of any of the prefunded balances cannot exceed 200% of the initial prefunded balance or go below zero.

26. The computer-readable medium according to claim 19, wherein the small category of payment orders is divided into subcategories medium and very small, wherein only large and medium payment orders are eligible to become helper payment orders.

27. The computer-readable medium according to claim 26, wherein the queue comprises a plurality of queues, and wherein very small, medium and large payment orders are stored in various ones of said plurality of queues on the basis of the size of the respective payment orders.