We prove a “General Manipulability Theorem” for general one-to-one two-sided matching markets with money. This theorem implies two folk theorems, the Manipulability Theorem and the General Impossibility Theorem, and provides a sort of converse of the Non-Manipulability Theorem (Demange,...

We prove a “General Manipulability Theorem” for general one-to-one two-sided matching markets with money. This theorem implies two folk theorems, the Manipulability Theorem and the General Impossibility Theorem, and provides a sort of converse of the Non-Manipulability Theorem (Demange,...

For the assignment game, we anlayze the following mechanism: sellers, simultaneously, fix their prices first, then buyers, sequentially, decide which object to buy, if any, among the remaining objects. The first phase of the game determines the potential proces, while the second phase determines...

We prove two Folk Theorems which, together with the Non-Manipulability Theorem (Demange (1982) and Leonard (1983)), have stimulated the development of the theory on incentives for the one-to-one two-sided matching models with money as a continuous variable.

A dynamic game where agents "behave cooperatively" is postulated: At each stage, current nontrading agents can trade and the payoffs from transactions done are maintained in the subsequent stages. The game ends when no interaction is able to benefit the agents involved (case in which a core...