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.
Volume (Year): 20 (2003)
Issue (Month): 1 ()
|Note:||Received: 17 May 1999/Accepted: 30 August 2001|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:20:y:2003:i:1:p:33-39. 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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.