Optimal partition of a large labor force into working pairs (Q847812)

From MaRDI portal
Revision as of 21:28, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Optimal partition of a large labor force into working pairs
scientific article

    Statements

    Optimal partition of a large labor force into working pairs (English)
    0 references
    0 references
    0 references
    19 February 2010
    0 references
    This article studies the problem of pairing workers and managers with different skills in an optimal manner. The authors first present the background to this interesting problem and a short overview of the literature. This is followed by the mathematical formulation of the pairing problem where the space of all skill types is a compact multi-dimensional Hausdorff space and the productivity of each pairing is a known, asymmetric function (to account that in each pair one person may be the manager and the other the assistant). The next two sections concentrate in the mixed pairing extension of the problem, where the existence of an optimal solution is proven and duality aspects are studied. The fifth and sixth section move on to describe the links of the optimal pairing problem with transportation theory. The article concludes with a section on examples of applications of this theory and a discussion of the results. Throughout this detailed article a large number of theorems, lemmas and propositions are presented and proven. The paper concludes with a list of useful references.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    task allocation
    0 references
    role
    0 references
    marginals
    0 references
    wage segregation
    0 references
    optimal decision theory
    0 references
    assortative matching
    0 references
    optimal transportation
    0 references
    Monge-Kantorovich
    0 references
    0 references