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

Employment By Lotto Revisited

Contents:

Author Info

  • BETTINA KLAUS

    ()
    (Faculty of Business and Economics, University of Lausanne, Internef 538, CH-1015 Lausanne, Switzerland)

  • FLIP KLIJN

    ()
    (Harvard Business School, Baker Library|Bloomberg Center 437, Soldiers Field, Boston, MA 02163, USA; Institute for Economic Analysis (CSIC), Campus UAB, 08193 Bellaterra (Barcelona), Spain)

Abstract

We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for the so-called stable marriage problem. We complement Aldershof et al.'s (1999) analysis in two ways. First, we give an alternative and intuitive description of employment by lotto in terms of a probabilistic serial dictatorship on the set of stable matchings. Second, we show that Aldershof et al.'s (1999) conjectures are correct for small matching markets but not necessarily correct for large matching markets.

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://www.worldscinet.com/cgi-bin/details.cgi?type=pdf&id=pii:S0219198909002248
Download Restriction: Access to full text is restricted to subscribers.

File URL: http://www.worldscinet.com/cgi-bin/details.cgi?type=html&id=pii:S0219198909002248
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 World Scientific Publishing Co. Pte. Ltd. in its journal International Game Theory Review.

Volume (Year): 11 (2009)
Issue (Month): 02 ()
Pages: 181-198

as in new window
Handle: RePEc:wsi:igtrxx:v:11:y:2009:i:02:p:181-198

Contact details of provider:
Web page: http://www.worldscinet.com/igtr/igtr.shtml

Order Information:
Email:

Related research

Keywords: Employment by lotto; probabilistic mechanism; two-sided matching; stability;

Other versions of this item:

Find related papers by JEL classification:

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. Bettina Klaus & Flip Klijn, 2006. "Procedurally fair and stable matching," Economic Theory, Springer, vol. 27(2), pages 431-447, January.
Full references (including those not matched with items on IDEAS)

Citations

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:wsi:igtrxx:v:11:y:2009:i:02:p:181-198. 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: (Tai Tone Lim).

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.