Advanced Search
MyIDEAS: Login to save this article or follow this journal

A simple procedure to obtain the extreme core allocations of an assignment market

Contents:

Author Info

  • Josep Izquierdo

    ()

  • Marina Núñez

    ()

  • Carles Rafels

    ()

Abstract

Given an assignment market, we introduce a set of vectors, one for each possible ordering on the player set, which we name the max-payoff vectors. Each one of these vectors is obtained recursively only making use of the assignment matrix. Those max-payoff vectors that are efficient turn up to give the extreme core allocations of the market. When the assignment market has large core (that is to say, the assignment matrix is dominant diagonal and doubly dominant diagonal) all the max-payoff vectors are extreme core allocations.

(This abstract was borrowed from another version of this item.)

Download Info

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: http://hdl.handle.net/10.1007/s00182-007-0091-4
Download Restriction: Access to full text is restricted to subscribers.

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.

Bibliographic Info

Article provided by Springer in its journal International Journal of Game Theory.

Volume (Year): 36 (2007)
Issue (Month): 1 (September)
Pages: 17-26

as in new window
Handle: RePEc:spr:jogath:v:36:y:2007:i:1:p:17-26

Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00182/index.htm

Order Information:
Web: http://link.springer.de/orders.htm

Related research

Keywords: Assignment game; Core; Extreme core points; Max-payoff vectors;

Other versions of this item:

References

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. 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.
  2. Leonard, Herman B, 1983. "Elicitation of Honest Preferences for the Assignment of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 91(3), pages 461-79, June.
  3. Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Pere Villar, Joan, 2002. "Assignment Games Satisfy the CoMa-Property," Games and Economic Behavior, Elsevier, vol. 38(2), pages 231-239, February.
  4. Nunez, Marina & Rafels, Carles, 2003. "Characterization of the extreme core allocations of the assignment game," Games and Economic Behavior, Elsevier, vol. 44(2), pages 311-331, August.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Martínez-de-Albéniz, F. Javier & Núñez, Marina & Rafels, Carles, 2011. "Assignment markets with the same core," Games and Economic Behavior, Elsevier, vol. 73(2), pages 553-563.
  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.

Lists

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

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:36:y:2007:i:1:p:17-26. 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: (Guenther Eichhorn) or (Christopher F Baum).

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.