{"id":1609,"date":"2023-05-25T12:30:13","date_gmt":"2023-05-25T12:30:13","guid":{"rendered":"https:\/\/qsms.bme.hu\/?p=1609"},"modified":"2023-05-25T12:30:13","modified_gmt":"2023-05-25T12:30:13","slug":"may-30-szilvia-papai-qsms-seminar","status":"publish","type":"post","link":"https:\/\/qsms.bme.hu\/index.php\/2023\/05\/25\/may-30-szilvia-papai-qsms-seminar\/","title":{"rendered":"May 30: \u00a0Szilvia Papai (QSMS Seminar)"},"content":{"rendered":"\n<figure class=\"wp-block-image size-full is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/qsms.bme.hu\/wp-content\/uploads\/2023\/05\/Screenshot-2023-05-25-141854.png\" alt=\"\" class=\"wp-image-1610\" width=\"309\" height=\"442\" srcset=\"https:\/\/qsms.bme.hu\/wp-content\/uploads\/2023\/05\/Screenshot-2023-05-25-141854.png 321w, https:\/\/qsms.bme.hu\/wp-content\/uploads\/2023\/05\/Screenshot-2023-05-25-141854-210x300.png 210w\" sizes=\"auto, (max-width: 309px) 85vw, 309px\" \/><\/figure>\n\n\n\n<p><strong><strong>Szilvia Papai<\/strong><\/strong>\u00a0 (Concordia University)\u00a0will present her paper &#8220;<strong>Fair Maximum Matching Under Dichotomous Preference<\/strong><em>&#8220;<\/em> (co-authored with<em> <\/em>Shahidul Islam) on May 30th at 2:30 PM, room QA 406.\u00a0One-to-one meetings with the speaker can be arranged; please contact the seminar organizers, Dr. No\u00e9mie Cabau (<a rel=\"noreferrer noopener\" href=\"mailto:cabau.noemie@gtk.bme.hu\" target=\"_blank\">cabau.noemie@gtk.bme.hu<\/a>) and Dr. Arseniy Samsonov (<a rel=\"noreferrer noopener\" href=\"mailto:samsonov.arseniy@gtk.bme.hu\" target=\"_blank\">samsonov.arseniy@gtk.bme.hu<\/a>).\u00a0\u00a0<\/p>\n\n\n\n<p><strong>Abstract:&nbsp;&nbsp;<\/strong>&nbsp;<\/p>\n\n\n\n<p>In a many-to-one matching problem children have dichotomous preferences over daycares, and daycares have strict priorities over children. Given the limited enrolment capacity of daycares, the main objective is to \ufb01nd a matching mechanism that is fair for children (i.e., does not violate the daycare priorities) and maximizes the number of matched children. We identify a class of mechanisms that are fair and always lead to a maximum matching. We also show that these mechanisms are strategyproof for the children.\u00a0<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Szilvia Papai\u00a0 (Concordia University)\u00a0will present her paper &#8220;Fair Maximum Matching Under Dichotomous Preference&#8220; (co-authored with Shahidul Islam) on May 30th at 2:30 PM, room QA 406.\u00a0One-to-one meetings with the speaker can be arranged; please contact the seminar organizers, Dr. No\u00e9mie Cabau (cabau.noemie@gtk.bme.hu) and Dr. Arseniy Samsonov (samsonov.arseniy@gtk.bme.hu).\u00a0\u00a0 Abstract:&nbsp;&nbsp;&nbsp; In a many-to-one matching problem children have &hellip; <a href=\"https:\/\/qsms.bme.hu\/index.php\/2023\/05\/25\/may-30-szilvia-papai-qsms-seminar\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;May 30: \u00a0Szilvia Papai (QSMS Seminar)&#8221;<\/span><\/a><\/p>\n","protected":false},"author":12,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[22,4,17],"tags":[],"class_list":["post-1609","post","type-post","status-publish","format-standard","hentry","category-event","category-news","category-seminar"],"_links":{"self":[{"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/posts\/1609","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/users\/12"}],"replies":[{"embeddable":true,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/comments?post=1609"}],"version-history":[{"count":1,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/posts\/1609\/revisions"}],"predecessor-version":[{"id":1611,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/posts\/1609\/revisions\/1611"}],"wp:attachment":[{"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/media?parent=1609"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/categories?post=1609"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/tags?post=1609"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}