matching

(redirected from matchings)
Also found in: Dictionary, Thesaurus, Medical, Legal, 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

matching

the process of matching revenues and profits with the associated expenses incurred in earning these revenues. See ACCRUALS PRINCIPLE OF ACCOUNTING.
References in periodicals archive ?
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).
We define the plane matching persistency of a point set P, denoted by pmp(P), to be the smallest number of edge-disjoint plane matchings such that, if we remove them from K(P) the resulting graph does not have any plane perfect matching.
In this paper only perfect matchings are considered and they are simply called matchings.
The number of perfect matchings in a complete graph [K.
In this section we prove lower bounds on the number of plane matchings that can be packed into K(P).
by removing an arbitrary set of k--1 edge-disjoint perfect matchings from G, the resulting graph still contains a perfect matching, and
Let M be any set of n edge-disjoint perfect matchings in [K.
k-1], then [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] has a matching of size [n/2].
4] showed that if [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is a geometric graph corresponding to a colored point set P, then the minimum-weight colored matching of P is non-crossing.
Lemma 1 If P is in convex position, where [absolute value of P] is even and [absolute value of P] [greater than or equal to] 4, then every plane matching in P contains at least two edges of CH(P).
Claim 1: For each i, where 0 [less than or equal to] i < L, Mj is a plane perfect matching in P.