to do so, we identify the matching rule used by the Ministry using the information available to the candidates. The … structure of the algorithm that produce the final matching is also analyzed. Finally, we discuss the existence of quotas on …

This paper defines a notion of semi-stability for matching problem with couples, which is a natural generalization of …, and further identical to, the conventional stability for matching without couples. It is shown that there always exists a … semi-stable matching for couples markets with strict preferences, and the set of semi-stable matchings can be partitioned …

optimal for the seller to do away with any matching considerations and allocate the contract on the basis of price alone. If … matching is sufficiently important to the seller, the optimal mechanism may be implemented without commitment. However, if … matching is not sufficiently important, the seller suffers a loss when he is unable to commit. The magnitude of this loss …

In many auctions, matching between the bidder and seller raises the value of the contract for both parties. However … depresses bids. The more matching matters, the greater the penalty associated with observing the matches. …

In a menu auction, players submit bids for all choices the auctioneer A can make, and A then makes the choice that … maximizes the sum of bids. In a binomial menu auction (BMA), players submit acceptance sets (indicating which choices they would …

hyperplane with a 0-1 normal vector. We apply this theorem to an auction model and provide a unified approach to existing results …'s (2006) auction. …

. We apply it to an auction model and show that existing iterative auctions can be viewed as the process of finding a …

. We apply it to an auction model and show that existing iterative auctions can be viewed as the process of finding a …