Games implementing the stable rule of marriage problems in strong Nash equilibria
In a marriage problem, we introduce a condition called "exclusive matchability (EM)": the condition mainly says that each pair of a man and a woman can choose to be a matching pair regardless of others' actions. This condition is essential to strong Nash implementation of the stable rule. We show that any mechanism which satisfies exclusive matchability implements the stable rule in strong Nash equilibria.
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.
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.
Volume (Year): 20 (2003)
Issue (Month): 1 ()
|Note:||Received: 17 May 1999/Accepted: 30 August 2001|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/355|