Matching Function Equilibria with Partial Assignment: Existence, Uniqueness and Estimation
We argue that models coming from a variety of fields, such as matching models and discrete choice models among others, share a common structure that we call matching function equilibria with partial assignment. This structure includes an aggregate matching function and a system of nonlinear equations. We provide a proof of existence and uniqueness of an equilibrium and propose an efficient algorithm to compute it. For a subclass of matching models, we also develop a new parameter-free approach for constructing the counterfactual matching equilibrium. It has the advantage of not requiring parametric estimation when computing counterfactuals. We use our procedure to analyze the impact of the elimination of the Social Security Student Benefit Program in 1982 on the marriage market in the United States. We estimate several candidate models from our general class of matching functions and select the best fitting model using information based criterion.
Code (0)
등록된 구현이 없습니다.
Tasks
counterfactualDiscrete Choice ModelsMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Matching with Transfers under Distributional Constraints
We study two-sided many-to-one matching markets with transferable utilities, e.g., labor and rental housing markets, in which money can exchange hands between agents, subject to distributional constraints on the set of f…
Learning Partial Graph Matching via Optimal Partial Transport
Partial graph matching extends traditional graph matching by allowing some nodes to remain unmatched, enabling applications in more complex scenarios. However, this flexibility introduces additional complexity, as both t…
Graph MatchingA new proof for the existence of Nash equilibrium
We present a new proof for the existence of a Nash equilibrium, which involves no fixed point theorem. The self-contained proof consists of two parts. The first part introduces the notions of root function and pre-equili…
The Structure of Equilibria in Trading Networks with Frictions
Several structural results for the set of competitive equilibria in trading networks with frictions are established: The lattice theorem, the rural hospitals theorem, the existence of side-optimal equilibria, and a group…
Towards Understanding the Endemic Behavior of a Competitive Tri-Virus SIS Networked Model
This paper studies the endemic behavior of a multi-competitive networked susceptible-infected-susceptible (SIS) model. Specifically, the paper deals with three competing virus systems (i.e., tri-virus systems). First, we…