The Evolution of Core Stability in Decentralized Matching Markets
نویسندگان
چکیده
منابع مشابه
The Evolution of Core Stability in Decentralized Matching Markets
Decentralized matching platforms on the internet allow large numbers of agents to interact anonymously at virtually no cost. Very little information is available to market participants and trade takes place at many different prices simultaneously. We propose a decentralized, completely uncoupled learning process in such environments that leads to stable and efficient outcomes. Agents on each si...
متن کاملIncentives in decentralized random matching markets
Decentralized markets are modeled by means of a sequential game where, starting from any matching situation, firms are randomly given the opportunity to make job offers. In this random context, we prove the existence of ordinal subgame perfect equilibria where firms act according to a list of preferences. Moreover, every such equilibrium preserves stability for a particular profile of preferenc...
متن کاملCore Stability and Core Selection in a Decentralized Labor Matching Market
We propose a dynamic model of decentralized many-to-one matching in the context of a competitive labor market. Through wage offers and wage demands, firms compete over workers and workers compete over jobs. Firms make hire-and-fire decisions dependent on the wages of their own workers and on the alternative workers available on the job market. Workers bargain for better jobs; either individuall...
متن کاملDecentralized Bargaining in Matching Markets: Efficient Stationary Equilibria and the Core
This paper studies market clearing in matching markets. The model is non-cooperative, fully decentralized, and in Markov strategies. Workers and firms bargain with each other to determine who will be matched to whom and at what terms of trade. Once a worker-firm pair reach agreement they exit the market. Alternative possible matches affect agents’ bargaining positions. We ask when do such marke...
متن کاملRobust Stability in Matching Markets∗
In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. First, we show an impossibility result: Even when school priorities are publicly known and only students can behave st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2013
ISSN: 1556-5068
DOI: 10.2139/ssrn.2274753