A Perfect Match Condition for Point-Set Matching Problems Using the Optimal Mass Transport Approach

We study the performance of optimal mass transport--based methods applied to point-set matching problems. The present study, which is based on the L2 mass transport cost, states that perfect matches always occur when the product of the point-set cardinality and the norm of the curl of the nonrigid deformation field does not exceed some constant. This analytic result is justified by a numerical study of matching two sets of pulmonary vascular tree branch points whose displacement is caused by the lung volume changes in the same human subject. The nearly perfect match performance verifies the effectiveness of this mass transport--based approach.Read More: http://epubs.siam.org/doi/abs/10.1137/12086443

Hedonic price equilibria, stable matching, and optimal transport: equivalence, topology, and uniqueness

Hedonic pricing with quasi-linear preferences is shown to be equivalent to stable matching with transferable utilities and a participation constraint, and to an optimal transportation (Monge-Kantorovich) linear programming problem. Optimal assignments in the latter correspond to stable matchings, and to hedonic equilibria. These assignments are shown to exist in great generality; their marginal indirect payoffs with respect to agent type are shown to be unique whenever direct payoffs vary smoothly with type. Under a generalized Spence-Mirrlees condition (also known as a twist condition) the assignments are shown to be unique and to be pure, meaning the matching is one-to-one outside a negligible set. For smooth problems set on compact, connected type spaces such as the circle, there is a topological obstruction to purity, but we give a weaker condition still guaranteeing uniqueness of the stable match

Hedonic price equilibria, stable matching, and optimal transport: equivalence, topology, and uniqueness

Hedonic pricing with quasilinear preferences is shown to be equivalent to stable matching with transferable utilities and a participation constraint, and to an optimal transportation (Monge-Kantorovich) linear programming problem. Optimal assignments in the latter correspond to stable matchings, and to hedonic equilibria. These assignments are shown to exist in great generality; their marginal indirect payoffs with respect to agent type are shown to be unique whenever direct payoffs vary smoothly with type. Under a generalized Spence-Mirrlees condition the assignments are shown to be unique and to be pure, meaning the matching is one-to-one outside a negligible set. For smooth problems set on compact, connected type spaces such as the circle, there is a topological obstruction to purity, but we give a weaker condition still guaranteeing uniqueness of the stable match. An appendix resolves an old problem (# 111) of Birkhoff in probability and statistics [5], by giving a necessary and sufficient condition on the support of a joint probability to guarantee extremality among all joint measures with the same marginals.

Local matching indicators for transport problems with concave costs

In this paper, we introduce a class of indicators that enable to compute efficiently optimal transport plans associated to arbitrary distributions of N demands and M supplies in R in the case where the cost function is concave. The computational cost of these indicators is small and independent of N. A hierarchical use of them enables to obtain an efficient algorithm

Combining Boundary-Conforming Finite Element Meshes on Moving Domains Using a Sliding Mesh Approach

For most finite element simulations, boundary-conforming meshes have significant advantages in terms of accuracy or efficiency. This is particularly true for complex domains. However, with increased complexity of the domain, generating a boundary-conforming mesh becomes more difficult and time consuming. One might therefore decide to resort to an approach where individual boundary-conforming meshes are pieced together in a modular fashion to form a larger domain. This paper presents a stabilized finite element formulation for fluid and temperature equations on sliding meshes. It couples the solution fields of multiple subdomains whose boundaries slide along each other on common interfaces. Thus, the method allows to use highly tuned boundary-conforming meshes for each subdomain that are only coupled at the overlapping boundary interfaces. In contrast to standard overlapping or fictitious domain methods the coupling is broken down to few interfaces with reduced geometric dimension. The formulation consists of the following key ingredients: the coupling of the solution fields on the overlapping surfaces is imposed weakly using a stabilized version of Nitsche's method. It ensures mass and energy conservation at the common interfaces. Additionally, we allow to impose weak Dirichlet boundary conditions at the non-overlapping parts of the interfaces. We present a detailed numerical study for the resulting stabilized formulation. It shows optimal convergence behavior for both Newtonian and generalized Newtonian material models. Simulations of flow of plastic melt inside single-screw as well as twin-screw extruders demonstrate the applicability of the method to complex and relevant industrial applications