EconPapers    
Economics at your fingertips  
 

Stable Allocation Mechanism

Mourad Baïou () and Michel Balinski
Additional contact information
Mourad Baïou: CECO - Laboratoire d'économétrie de l'École polytechnique - X - École polytechnique - IP Paris - Institut Polytechnique de Paris - CNRS - Centre National de la Recherche Scientifique

Working Papers from HAL

Abstract: The stable allocation problem is the generalization of the well-known and much studied stable (0,1)-matching problems to the allocation of real numbers (hours or quantities). There are two distinct sets of agents, a set I of "employees" or "buyers" and a set J of "employers" or "sellers", each agent with preferences over the opposite set and each with a given available time or quantity. In common with its specializations, and allocation problem may have exponentially many stable solutions (though in the "generic" case it has exactly one stable allocation). A mechanism is a function that selects exactly one stable allocation for any problem. The "employee-optimal" mechanism XI that always selects xI, the "employee-optimal" stable allocation, is characterized as the unique one that is, for employees, either "efficient", or "monotone", or "strategy-proof."

Keywords: Affectation stable; Mariage stable; Couplage stable; Transport ordinal; Problème d'admission; Many-to-many matching; Two sided market; Stable assignment; Stable marriage; Stable matching; Two-sided market; Ordinal transportation; University admissions (search for similar items in EconPapers)
Date: 2002
Note: View the original document on HAL open archive server: https://hal.science/hal-00243002
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://hal.science/hal-00243002/document (application/pdf)

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:hal:wpaper:hal-00243002

Access Statistics for this paper

More papers in Working Papers from HAL
Bibliographic data for series maintained by CCSD ().

 
Page updated 2025-03-19
Handle: RePEc:hal:wpaper:hal-00243002