A note on gender fairness in matching problems

Basit Öğe Kaydı
dc.contributor.authorÖzkal-Sanver, I
dc.date.accessioned2024-07-18T20:58:30Z
dc.date.available2024-07-18T20:58:30Z
dc.date.issued2004
dc.departmentİstanbul Bilgi Üniversitesien_US
dc.description.abstractWe introduce the gender fairness (GF) axiom. We show that the core is the minimal solution which satisfies Pareto optimality (PO), converse consistency (CC), and gender fairness. (C) 2003 Elsevier B.V. All rights reserved.en_US
dc.identifier.doi10.1016/j.mathsocsci.2003.08.001
dc.identifier.endpage217en_US
dc.identifier.issn0165-4896
dc.identifier.issn1879-3118
dc.identifier.issue2en_US
dc.identifier.startpage211en_US
dc.identifier.urihttps://doi.org/10.1016/j.mathsocsci.2003.08.001
dc.identifier.urihttps://hdl.handle.net/11411/8992
dc.identifier.volume47en_US
dc.identifier.wosWOS:000188762600005en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofMathematical Social Sciencesen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectMatchingen_US
dc.subjectCoreen_US
dc.subjectConverse Consistencyen_US
dc.subjectGender Fairnessen_US
dc.titleA note on gender fairness in matching problems
dc.typeArticle

Dosyalar

Koleksiyon

Web of Science Indexed Publications