An Experimental Examination into the Design of Decentralized Methods to Solve the Assignment Problem with and without Money
An experimental examination of the assignment problem, matching individuals to positions or slots, is conducted in which various assignment mechanisms are analyzed. Generalized versions of both the Vicrey and English auctions are designed to solve the assignment problem along with ordinal ranking mechanisms (serial dictator and "funny" money system). The generalized auctions result in efficient allocations. In contrast, the ordinal ranking mechanisms, which require no monetary transfers, are significantly less efficient in their assignments. However, the efficient allocations obtained from the competitive bidding processes are at the expense of consumers' surplus since demanders retain significantly larger profits with the ordinal ranking mechanisms.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 4 (1994)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:4:y:1994:i:1:p:11-40. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.