IDEAS home Printed from
MyIDEAS: Login to save this article or follow this journal

Von Neumann–Morgenstern solutions in the assignment market

  • Núñez, Marina
  • Rafels, Carles

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.

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL:
Download Restriction: Full text for ScienceDirect subscribers only

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Article provided by Elsevier in its journal Journal of Economic Theory.

Volume (Year): 148 (2013)
Issue (Month): 3 ()
Pages: 1282-1291

in new window

Handle: RePEc:eee:jetheo:v:148:y:2013:i:3:p:1282-1291
Contact details of provider: Web page:

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.:

as in new window
  1. EHLERS, Lars, 2005. "Von Neumann-Morgenstern Stable Sets in Matching Problems," Cahiers de recherche 2005-11, Universite de Montreal, Departement de sciences economiques.
  2. Núñez, Marina & Rafels, Carles, 2009. "A glove-market partitioned matrix related to the assignment game," Games and Economic Behavior, Elsevier, vol. 67(2), pages 598-610, November.
  3. Quint, Thomas, 1991. "The core of an m-sided assignment game," Games and Economic Behavior, Elsevier, vol. 3(4), pages 487-503, November.
  4. T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer, vol. 30(2), pages 177-185.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:148:y:2013:i:3:p:1282-1291. 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: (Zhang, Lei)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.