Related papers: Matching in Closed-Form: Equilibrium, Identificati…
We study the design of a decentralized two-sided matching market in which agents' search is guided by the platform. There are finitely many agent types, each with (potentially random) preferences drawn from known type-specific…
Conditional specification of distributions is a developing area with many applications. In the finite discrete case, a variety of compatible conditions can be derived. In this paper, we propose an alternative approach to study the…
We present an alternative account of the problem of classifying and finding normal forms for arbitrary bilinear forms. Beginning from basic results developed by Riehm, our solution to this problem hinges on the classification of…
This primary purpose of this paper is to succinctly state a number of verifiable and tractable sufficient conditions under which a particular class of conservative signal processing structures may be readily used to solve a companion class…
We extend to characteristic two recent results about isotropy of quadratic forms over function fields. In particular, we provide a characterization of function fields not only of quadratic forms but also more generally of polynomials in…
When several two-sided matching markets merge into one, it is inevitable that some agents will become worse off if the matching mechanism used is stable. I formalize this observation by defining the property of integration monotonicity,…
Characteristic modes of a spherical shell are found analytically as spherical harmonics normalized to radiate unitary power and to fulfill specific boundary conditions. The presented closed-form formulas lead to a proposal of precise…
The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…
We present a class of one-to-one matching models with perfectly transferable utility. We discuss identification and inference in these separable models, and we show how their comparative statics are readily analyzed.
We consider stable and popular matching problems in arbitrary graphs, which are referred to as stable roommates instances. We extend the 3/2-approximation algorithm for the maximum size weakly stable matching problem to the roommates case,…
Linear mixed-effects models are a central analytical tool for modeling hierarchical and longitudinal data, as they allow simultaneous representation of fixed and random sources of variation. In practice, inference for such models is most…
We shall derive and propose several efficient overlapping domain decomposition methods for solving some typical linear inverse problems, including the identiffication of the flux, the source strength and the initial temperature in second…
It is shown that the partial temperatures of a homogeneous multicomponent gas mixture in the thermodynamical equilibrium cannot be equal to each other. New general solutions for equilibrium distribution functions of the multicomponent…
We fully solve a sorting problem with heterogeneous firms and multiple heterogeneous workers whose skills are imperfect substitutes. We show that optimal sorting, which we call mixed and countermonotonic, is comprised of two regions. In the…
The last decade has witnessed an explosion in the development of models, theory and computational algorithms for "big data" analysis. In particular, distributed computing has served as a natural and dominating paradigm for statistical…
We present a refined duality estimate for parabolic equations. This estimate entails new results for systems of reaction-diffusion equations, including smoothness and exponential convergence towards equilibrium for equations with quadratic…
We investigate corrector estimates for the solutions of a thermoelasticity problem posed in a highly heterogeneous two-phase medium and its corresponding two-scale thermoelasticity model which was derived in an earlier paper by two-scale…
We study stability notions for networked many-to-many matching markets with individually insignificant agents in distributional form. Outcomes are formulated as joint distributions over characteristics of agents and contract choices.…
In the literature, the matchings between spacetimes have been most of the times implicitly assumed to preserve some of the symmetries of the problem involved. But no definition for this kind of matching was given until recently. Loosely…
We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of…