Implementing matching rules by type pretension mechanisms
dc.authorwosid | Sanver, M. Remzi/G-2339-2019 | |
dc.contributor.author | Özkal-Sanver, I | |
dc.contributor.author | Sanver, MR | |
dc.date.accessioned | 2024-07-18T20:58:30Z | |
dc.date.available | 2024-07-18T20:58:30Z | |
dc.date.issued | 2005 | |
dc.department | İstanbul Bilgi Üniversitesi | en_US |
dc.description | 27th Bosphorus Workshop on Economic Design -- AUG 21-28, 2004-2005 -- Bodrum, TURKEY | en_US |
dc.description.abstract | We consider a two-sided matching model where agents' preferences are a function of the types of their potential mates. Matching rules are manipulated by type misrepresentation. We explore the implementability of the G-core in G-Strong Nash Equilibria. Although direct type pretension mechanisms rule out bad equilibria, the existence of equilibrium cannot be generally guaranteed. However, taking G as the discrete partition, the individually rational matching correspondence is partially implementable in Nash equilibria. On the other hand, incorporating a certain degree of hypocrisy in the mechanism, i.e., allowing agents to pretend different types to different potential mates, ensures the full implementability of the G-core in G-Strong Nash Equilibria. (c) 2005 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi | 10.1016/j.mathsocsci.2005.04.003 | |
dc.identifier.endpage | 317 | en_US |
dc.identifier.issn | 0165-4896 | |
dc.identifier.issn | 1879-3118 | |
dc.identifier.issue | 3 | en_US |
dc.identifier.scopus | 2-s2.0-23944525039 | en_US |
dc.identifier.scopusquality | Q2 | en_US |
dc.identifier.startpage | 304 | en_US |
dc.identifier.uri | https://doi.org/10.1016/j.mathsocsci.2005.04.003 | |
dc.identifier.uri | https://hdl.handle.net/11411/8993 | |
dc.identifier.volume | 50 | en_US |
dc.identifier.wos | WOS:000232035800006 | en_US |
dc.identifier.wosquality | Q4 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier Science Bv | en_US |
dc.relation.ispartof | Mathematical Social Sciences | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Matching | en_US |
dc.subject | Endowments | en_US |
dc.subject | Type Pretension Mechanism | en_US |
dc.subject | Marriage Problems | en_US |
dc.title | Implementing matching rules by type pretension mechanisms | en_US |
dc.type | Conference Object | en_US |