Abstract
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 Vickrey and English auctions are designed to solve the assignment problem along with oridinal 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
