Starting with an initial price vector, prices are adjusted in order to eliminate the demand excess and at the same time to keep the transfers to the sellers as low as possible. In each step of the auction, to which sellers should those transfers be made (minimal overdemanded sets) is the key...

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 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.

Starting with an initial price vector, prices are adjusted in order to eliminate the demand excess and at the same time to keep the transfers to the sellers as low as possible. In each step of the auction, to which sellers should those transfers be made (minimal overdemanded sets) is the key...

Starting with an initial price vector, prices are adjusted in order to eliminate the demand excess and at the same time to keep the transfers to the sellers as low as possible. In each step of the auction, to which sellers should those transfers be made (minimal overdemanded sets) is the key...

Rosenthal (1972) points out that the coalitional function form may be insufficient to analyze some strategic interactions of the cooperative normal form. His solution consists in representing games in effectiveness form, which explicitly describes the set of possible outcomes that each coalition...

In the one-sided Assignment game any two agents can form a partnership. If this is done, the partners undertake some joint activity, which produces a gain that is split between them. We approach this model by focusing on simple outcomes - feasible and individually rational outcomes where only...