• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Multi-Stated Offset of Payments

Student: Papsheva Irina

Supervisor: Alexander Petrovich Kirsanov

Faculty: Faculty of Business Informatics

Educational Programme: Master

Year of Graduation: 2014

<div><p>Using offset of payments (clearing) in payment systems can significantly reduce number and total volume of payments, expand sphere of non-cash operations and simplify calculations . Clearing saves availability of cash, increases stability and liquidity of settlement participants.</p><p>Most studies about modeling of gross payments between settlement participants consider various models for optimizing the procedure of clearing. Authors describes different methods and algorithms to solve this problem depending on the method of formalizing they describe. Some studies analyzed the complexity of the proposed algorithms. However, these studies did not analyze step-by-step the dependence of clearing efficiency from the structure of initial payments (or payoff matrix ) to the procedure of clearing.</p><p>This paper identifies and analyzes the basic properties of sets of payments in different payment systems. Based on this analysis model of aggregate gross payments in the form of a random scaleless graph is constructed . This paper presents the algorithm for constructing of scaleless oriented weighted random graphs for evaluating the effectiveness of clearing procedure.</p><p>This article is devoted to the problem of reducing gross payments between settlement participants by clearing or netting arrangements. Matrix and graph models are developed and used to describe set of payments. The main features of these models which can be found in actual payment systems are analyzed in this work. Using simulation modeling it is investigated the efficiency of the clearing process for various initial matrixes of gross payments.<br />As a result:</p><ul><li>Properties of gross payments graphs were revealed;</li><li>A model of payments in the form of random, oriented, scaleless , weighted graph was developed;</li><li>The clearing procedure was formalized as a linear programming transport problem;</li><li>A software tool for conducting the procedure of clearing and it&rsquo;s efficiency estimating was developed.</li></ul></div><p>&nbsp;</p>

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses