Von Neumann–Morgenstern solutions in the assignment market

Marina Núñez () and Carles Rafels

Journal of Economic Theory, 2013, vol. 148, issue 3, 1282-1291

Abstract: The existence of von Neumann–Morgenstern solutions (stable sets) for assignment games has been an unsolved question since Shapley and Shubik (1972) [11]. For each optimal matching between buyers and sellers, Shubik (1984) [12] proposed considering the union of the core of the game and the core of the subgames that are compatible with this matching. We prove in the present paper that this set is the unique stable set for the assignment game that excludes third-party payments with respect to a fixed optimal matching. Moreover, the stable sets that we characterize, as well as any other stable set of the assignment game, have a lattice structure with respect to the same partial order usually defined on the core.

Keywords: Assignment game; Core; Von Neumann–Morgenstern stable set (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0022053113000227
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:148:y:2013:i:3:p:1282-1291

DOI: 10.1016/j.jet.2012.10.002

Access Statistics for this article

Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell

More articles in Journal of Economic Theory from Elsevier
Bibliographic data for series maintained by Catherine Liu ().