{"id":1766,"date":"2024-09-25T11:36:38","date_gmt":"2024-09-25T11:36:38","guid":{"rendered":"https:\/\/qsms.bme.hu\/?p=1766"},"modified":"2024-10-07T07:19:24","modified_gmt":"2024-10-07T07:19:24","slug":"october-4-toygar-t-kerman-qsms-seminar","status":"publish","type":"post","link":"https:\/\/qsms.bme.hu\/index.php\/2024\/09\/25\/october-4-toygar-t-kerman-qsms-seminar\/","title":{"rendered":"October 4: Toygar T. Kerman \u00a0(QSMS Seminar)"},"content":{"rendered":"\n<p>Toygar Kerman (Corvinus University) will present &#8220;<em>Nested Self-Selectivity<\/em>&#8221; (with Semih Koray, Bilkent University) on October 4th, 2024, at 10:30 AM, in room QA406.<\/p>\n\n\n\n<p><strong>Abstract:&nbsp;&nbsp;<\/strong>&nbsp;<\/p>\n\n\n\n<p>A society that will make a choice from a set of alternatives might also need to choose the choice rule that will be employed to make the choice. In such a situation, the notion of self-selectivity requires a social choice function (SCF) to choose itself among a set of rival SCFs. However, verifying self-selectivity might be difficult as the set of rival SCFs may be very large. We show that self- selectivity of an SCF (that satisfies independence of irrelevant alternatives) relative to some very large sets of SCFs can be verified by checking self-selectivity relative to a much smaller set of SCFs that is nested in the large set. Moreover, we show that if an SCF is self-selective relative to two different sets of rival functions, then it is self-selective relative to the intersection and union of these sets.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Toygar Kerman (Corvinus University) will present &#8220;Nested Self-Selectivity&#8221; (with Semih Koray, Bilkent University) on October 4th, 2024, at 10:30 AM, in room QA406. Abstract:&nbsp;&nbsp;&nbsp; A society that will make a choice from a set of alternatives might also need to choose the choice rule that will be employed to make the choice. In such a &hellip; <a href=\"https:\/\/qsms.bme.hu\/index.php\/2024\/09\/25\/october-4-toygar-t-kerman-qsms-seminar\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;October 4: Toygar T. Kerman \u00a0(QSMS Seminar)&#8221;<\/span><\/a><\/p>\n","protected":false},"author":15,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[22,4,17],"tags":[],"class_list":["post-1766","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\/1766","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\/15"}],"replies":[{"embeddable":true,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/comments?post=1766"}],"version-history":[{"count":4,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/posts\/1766\/revisions"}],"predecessor-version":[{"id":1791,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/posts\/1766\/revisions\/1791"}],"wp:attachment":[{"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/media?parent=1766"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/categories?post=1766"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/tags?post=1766"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}