Author: Onur Burak CelikPublisher:
ISBN:
Category :
Languages : en
Pages : 0
Book Description
Essays on Matching Markets with Correlated Preferences
Author: Onur Burak CelikMechanisms, Preferences, and Heterogeneity in Matching Markets
Author: Nadja Stroh-MaraunPublisher:
ISBN:
Category : Markets
Languages : en
Pages :
Book Description
Optimal Truncation in Matching Markets
Author: Peter ColesPublisher:
ISBN:
Category : Electronic book
Languages : en
Pages :
Book Description
Two-Sided Matching
Author: Alvin E. RothPublisher: Cambridge University Press
ISBN: 1107782430
Category : Business & Economics
Languages : en
Pages : 288
Book Description
Two-sided matching provides a model of search processes such as those between firms and workers in labor markets or between buyers and sellers in auctions. This book gives a comprehensive account of recent results concerning the game-theoretic analysis of two-sided matching. The focus of the book is on the stability of outcomes, on the incentives that different rules of organization give to agents, and on the constraints that these incentives impose on the ways such markets can be organized. The results for this wide range of related models and matching situations help clarify which conclusions depend on particular modeling assumptions and market conditions, and which are robust over a wide range of conditions. 'This book chronicles one of the outstanding success stories of the theory of games, a story in which the authors have played a major role: the theory and practice of matching markets ... The authors are to be warmly congratulated for this fine piece of work, which is quite unique in the game-theoretic literature.' From the Foreword by Robert Aumann
Preference Structure and Random Paths to Stability in Matching Markets
Author: James W. BoudreauReciprocal Preferences in Matching Markets
Author: Timm OpitzPublisher:
ISBN:
Category :
Languages : en
Pages : 0
Book Description
Agents with reciprocal preferences prefer to be matched to a partner who also likes to collaborate with them. In this paper, we introduce and formalize reciprocal preferences, apply them to matching markets, and analyze the implications for mechanism design. Formally, the preferences of an agent can depend on the preferences of potential partners and there is incomplete information about thepartners' preferences. We find that there is no stable mechanism in standard two-sided markets. Observing the final allocation of the mechanism enables agents to learn about each other's preferences, leading to instability. However, in a school choice setting with one side of the market being non-strategic, modified versions of the deferred acceptance mechanism can achieve stability. These results provide insights into non-standard preferences in matching markets, and their implications for efficient information and mechanism design.
Efficiency and Stability in Large Matching Markets
Author: Yeon-Koo CheClearing Matching Markets Efficiently
Author: Itai AshlagiPublisher:
ISBN:
Category :
Languages : en
Pages : 58
Book Description
We study how to reduce congestion in two-sided matching markets with private preferences. We measure congestion by the number of bits of information that agents must (i) learn about their own preferences, and (ii) communicate with others before obtaining their final match. Previous results by Segal (2007) and Gonczarowski et al. (2015) suggest that a high level of congestion is inevitable under arbitrary preferences before the market can clear with a stable matching. We show that when the unobservable component of agent preferences satisfies certain natural assumptions, it is possible to recommend potential matches and encourage informative signals such that the market reaches a stable matching with a low level of congestion. This is desirable because the communication overhead is minimized while agents have negligible incentives to leave the marketplace or to look beyond the set of recommended partners. The main idea is to only recommend partners with whom the agent has a non-negligible chance of both liking and being liked by. The recommendations are based both on the observable component of preferences, and on the signals sent by agents on the other side that indicate interest.
Fundamentals of Computation Theory
Author: Evripidis BampisPublisher: Springer
ISBN: 9783030865924
Category : Computers
Languages : en
Pages : 476
Book Description
This book constitutes the proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, FCT 2021, held in Athens, Greece, in September 2021. The 30 full papers included in this volume were carefully reviewed and selected from 94 submissions. In addition, the book contains 2 invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.
Market Structure and Dynamics
Author: Qingyun Wu (Researcher in game theory and market design)Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
This thesis consists of three self-contained essays that investigate the algebraic structure of matching markets and the stabilization dynamics in decentralized markets. Chapter 2 is based on Wu and Roth (2018). It studies envy-free matchings that naturally arise from workers retiring or companies expanding. We show that the set of envy-free matchings forms a lattice that has a Conway-like join, but not a Conway-like meet. Furthermore, a job hopping process in which companies make offers to their favorite blocking workers, and workers accept their favorite offers, producing a sequence of vacancy chains, is a Tarski operator on this lattice. The fixed points of this Tarski operator correspond to the set of stable matchings; and the steady state matching starting from any given initial state is derived analytically. Chapter 3 is based on Wu (2020). The goal of this chapter, is to provide a systematic approach for analyzing entering classes in the college admissions model. When dealing with a many-to-one matching model, we often convert it into a one-to-one matching problem by assigning each seat of a college to a single student, instead of matching each college to multiple students. The preferences in this new model are significantly correlated and severely restrict the possible changes to entering classes. Through the so-called "rotations" that correspond to the join-irreducible elements in the lattice of stable matchings, we present a unified treatment for several results on entering classes, including the famous "Rural Hospital Theorem". We also show that, the least preferred student in an entering class appears to play a very interesting role. For example, each entering class can be completely characterized by its worst student. Chapter 4 is based on Gu, Roth, and Wu (2020). The motivating question is that, how come some black markets, such as the market for hitmen are well-regulated, but many others like the market for drugs are far from being under our control, even though we try very hard to eliminate them. To understand this, we build a three-dimensional discrete time Markov chain to study how black markets evolve over time, focusing on social repugnance and search frictions. We borrow tools from Markov jump processes, random walks, exponential martingales and optional sampling theory to analyze both the steady state limit and the realizations along the way. In the first part of the chapter, we identify conditions that lead to market survival or extinction. And the second part studies speed of convergence. We show that if a market is going to die eventually, then it dies exponentially fast. This further implies if a market has survived for a long time, then it is likely to survive forever.