Hedonic price equilibria, stable matching, and optimal transport: equivalence, topology, and uniqueness
Hedonic pricing with quasilinear preferences is shown to be equivalent to stable matching with transferable utilities and a participation constraint, and to an optimal transportation (Monge-Kantorovich) linear programming problem. Optimal assignments in the latter correspond to stable matchings, and to hedonic equilibria. These assignments are shown to exist in great generality; their marginal indirect payoffs with respect to agent type are shown to be unique whenever direct payoffs vary smoothly with type. Under a generalized Spence-Mirrlees condition the assignments are shown to be unique and to be pure, meaning the matching is one-to-one outside a negligible set. For smooth problems set on compact, connected type spaces such as the circle, there is a topological obstruction to purity, but we give a weaker condition still guaranteeing uniqueness of the stable match. An appendix resolves an old problem (# 111) of Birkhoff in probability and statistics , by giving a necessary and sufficient condition on the support of a joint probability to guarantee extremality among all joint measures with the same marginals.
|Date of creation:||28 Sep 2007|
|Contact details of provider:|| Postal: The Institute for Fiscal Studies 7 Ridgmount Street LONDON WC1E 7AE|
Phone: (+44) 020 7291 4800
Fax: (+44) 020 7323 4780
Web page: http://cemmap.ifs.org.uk
More information through EDIRC
|Order Information:|| Postal: The Institute for Fiscal Studies 7 Ridgmount Street LONDON WC1E 7AE|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Roth,Alvin E. & Sotomayor,Marilda A. Oliveira, 1992.
Cambridge University Press, number 9780521437882, February.
- Roth, Alvin E. & Sotomayor, Marilda, 1992. "Two-sided matching," Handbook of Game Theory with Economic Applications,in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 16, pages 485-541 Elsevier.
- Gretsky, Neil E & Ostroy, Joseph M & Zame, William R, 1992. "The Nonatomic Assignment Model," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(1), pages 103-127, January.
- Neil E. Gretsky & Joseph M. Ostroy & William R. Zame, 1990. "The Nonatomic Assignment Model," UCLA Economics Working Papers 605, UCLA Department of Economics.
- repec:dau:papers:123456789/6443 is not listed on IDEAS
- James Heckman & Rosa Matzkin & Lars Nesheim, 2005. "Nonparametric estimation of nonadditive hedonic models," CeMMAP working papers CWP03/05, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
- Gretsky, Neil E. & Ostroy, Joseph M. & Zame, William R., 1999. "Perfect Competition in the Continuous Assignment Model," Journal of Economic Theory, Elsevier, vol. 88(1), pages 60-118, September. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:ifs:cemmap:23/07. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Emma Hyman)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.