Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 30, 2017 | Submitted
Report Open

Dominant and Nash Strategy Mechanisms for the Assignment Problem

Olson, Mark A.

Abstract

In this paper, I examine the problem of matching or assigning a fixed set of goods or services to a fixed set of agents. I characterize the social choice correspondences that can be implemented in dominant and Nash strategies when transfers are not allowed. This is an extension of the literature that was begun by Gibbard (1973) and Satterthwaite (1975), who independently proved that if a mechanism is nonmanipulable it is dictatorial. For the classes of mechanisms that are described in the paper, the results imply that the only mechanisms that are implementable in dominant and Nash strategies are choice mechanisms that rely only on ordinal rankings. I also describe a subclass of mechanisms that are Pareto optimal. In addition, the results explain the modeling conventions found in the literature - that when nontransfer mechanisms are studied individuals are endowed with ordinal preferences, and when transfer mechanisms are studied individuals are endowed with cardinal preferences.

Additional Information

I would like to thank John Ledyard for his valuable help and comments; as usual, he is absolved from any responsibility in the accuracy of this paper.

Attached Files

Submitted - sswp770.pdf

Files

sswp770.pdf
Files (1.5 MB)
Name Size Download all
md5:825c2b4486030d11e01c8270630df1ad
1.5 MB Preview Download

Additional details

Created:
August 20, 2023
Modified:
January 14, 2024