A general information equilibrium model in the case of ideal information transfer is defined and then used to derive the relationship between supply (information destination) and demand (information source) with the price as the detector of information exchange between demand and supply. We...

This paper studies many-to-one matching markets where each student is assigned to a hospital. Each hospital has possibly multiple positions and responsive preferences. We study the game induced by the student-optimal stable matching mechanism. We assume that students play their weakly dominant...

Studying the interaction between preference and capacity manipulation in matching markets, we prove that acyclicity is a necessary and sufficient condition that guarantees the stability of a Nash equilibrium and the strategy-proofness of truthful capacity revelation under the hospital-optimal...

This paper studies many-to-one matching markets where each student is assigned to a hospital. Each hospital has possibly multiple positions and responsive preferences. We study the game induced by the student-optimal stable matching mechanism. We assume that students play their weakly dominant...

We study many-to-one matching markets where hospitals have responsive preferences over students. We study the game induced by the student-optimal stable matching mechanism. We assume that students play their weakly dominant strategy of truth-telling.

Recently, several school districts in the US have adopted or consider adopting the Student-Optimal Stable mechanism or the Top Trading Cycles mechanism to assign children to public schools. There is evidence that for school districts that employ (variants of) the so-called Boston mechanism the...

It is found that the “Theory of Moves” is adequate in a Cold War scenario, with functionally equal participants, such as the Cuban Missile Crisis. The destabilization of normal incentive systems, under power and information asymmetry, is what prevents an equilibrium from being reached, as...

This paper considers a matchmaker game in the Shapley-Shubik(1971) (one-to-one) assignment problem. Each …rm proposes how muchit is willing to pay each worker if they are matched. Each worker alsoproposes which salary she is willing to accept from each …rm if they arematched. The matchmaker...

Both rematching proof and strong equilibrium outcomes are stable with respect to the true preferences in the marriage problem. We show that not all rematching proof or strong equilibrium outcomes are stable in the college admissions problem. But we show that both rematching proof and strong...

In this paper, we analyze capacity manipulation games in hospital-intern markets inspired by the real-life entry-level labor markets for young physicians seeking residencies at hospitals. In these markets, where the matching is determined by a centralized clearinghouse called the National...