matching

(redirected from matchings)
Also found in: Dictionary, Thesaurus, Medical, Encyclopedia.

Cash Flow Matching

The practice of matching returns on a portfolio to future capital outlays. That is, cash flow matching involves investing in certain securities with a certain expected return so that the investor will be able to pay for future liabilities. Pension funds and annuities perform the most cash flow matching, as they have future liabilities that are both large and relatively easy to estimate. Portfolios that perform cash flow matching usually invest in low-risk, investment-grade securities. The practice is also called portfolio dedication, matching, or the structured portfolio strategy.

matching

Wall Street Words: An A to Z Guide to Investment Terms for Today's Investor by David L. Scott. Copyright © 2003 by Houghton Mifflin Company. Published by Houghton Mifflin Company. All rights reserved. All rights reserved.

matching

the process of matching revenues and profits with the associated expenses incurred in earning these revenues. See ACCRUALS PRINCIPLE OF ACCOUNTING.
Collins Dictionary of Business, 3rd ed. © 2002, 2005 C Pass, B Lowes, A Pendleton, L Chadwick, D O’Reilly and M Afferson
References in periodicals archive ?
On the other hand, by Lemma 6 we conclude that [N.sub.D] is the number of unmatched nodes with respect to any maximum matchings. These unmatched nodes are just the driver nodes.
It should be noted that the set of matched nodes of maximum matchings is not unique, since it is related to the order of implementing the fundamental transformations.
Here we have enumerated all possible combinations of maximum matchings, respectively, {2, 3, 5}, {3, 4, 5}, and {3, 5, 6}.
It also reveals the underlying relationship between the structure of a digraph and its maximum matchings.
Given a set P of n points in the plane, with n even, we consider the problem of packing plane perfect matchings into K(P).
In Section 3 we prove bounds on the number of plane matchings that can be packed into K(P).
We show that if P is in regular wheel configuration, then [n/2] - 1 edge-disjoint plane matchings can be packed into K(P); this bound is tight as well.
1: Number of plane perfect matchings in a point set P of n points (n is even).
Now we show how to pack n/2 plane matchings into K(P).
In this section we show that at least [[log.sub.2] n] - 1 plane matchings can be packed into K(P).
[M.sub.1](B) and [M.sub.2](B)) be two edge-disjoint plane matchings in R (resp.
Theorem 6 For a set P of n = [2.sup.i] x m points in general position in the plane with n even, m [greater than or equal to] 4, i [greater than or equal to] 0, at least i + 2 plane matchings can be packed into K(P).

Site: Follow: Share:
Open / Close