Consistent Conjectures in Dynamic Matching Markets
We provide a framework to study stability notions for two-sided dynamic matching markets in which matching is one-to-one and irreversible. The framework gives center stage to the set of matchings an agent anticipates would ensue should they remain unmatched, which we refer to as the agent's conjectures. A collection of conjectures, together with a pairwise stability and individual rationality requirement given the conjectures, defines a solution concept for the economy. We identify a sufficient condition--consistency--for a family of conjectures to lead to a nonempty solution (cf. Hafalir, 2008). As an application, we introduce two families of consistent conjectures and their corresponding solution concepts: continuation-value-respecting dynamic stability, and the extension to dynamic markets of the solution concept in Hafalir (2008), sophisticated dynamic stability.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Dynamically Stable Matching
I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition…
BlockingFormMatching in Dynamic Imbalanced Markets
We study dynamic matching in exchange markets with easy- and hard-to-match agents. A greedy policy, which attempts to match agents upon arrival, ignores the positive externality that waiting agents generate by facilitati…
Stability in Repeated Matching Markets
This paper develops a framework for repeated matching markets. The model departs from the Gale-Shapley matching model by having a fixed set of long-lived hospitals match with a new generation of short-lived residents in …
When AI Agents Compete for Jobs: Strategic Capabilities and Economic Dynamics of AI Labour Markets
Emerging agentic marketplaces provide the economic infrastructure for matching and coordinating the large amounts of AI agents used in agentic swarms. Unlike human workers, AI agents can operate on multiple jobs simultan…
Non-Standard Choice in Matching Markets
We explore the possibility of designing matching mechanisms that can accommodate non-standard choice behavior. We pin down the necessary and sufficient conditions on participants' choice behavior for the existence of sta…