{"id":1812,"date":"2024-11-19T20:48:13","date_gmt":"2024-11-19T20:48:13","guid":{"rendered":"https:\/\/qsms.bme.hu\/?p=1812"},"modified":"2024-11-19T20:48:13","modified_gmt":"2024-11-19T20:48:13","slug":"november-15-christopher-stapenhurst-qsms-seminar","status":"publish","type":"post","link":"https:\/\/qsms.bme.hu\/index.php\/2024\/11\/19\/november-15-christopher-stapenhurst-qsms-seminar\/","title":{"rendered":"November 15: Christopher Stapenhurst (QSMS Seminar)"},"content":{"rendered":"\n<p>Christopher Stapenhurst<strong>\u00a0<\/strong>(QSMS) will present &#8220;<em>Red and Gold (with Andrew Clausen and John Moore)<\/em>&#8221; on November 15th, 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>Clausen and Stapenhurst (2024) obtain a lower bound on the cost of the optimal static, bribe-proof mechanism. But what about dynamic mechanisms? We propose a mechanism called \u201cRed and Gold\u201d that uses a nuisance action to deter bribes at arbitrarily small cost. The agent receives either a red or a gold ticket. If the monitor reports shirking then she is asked to guess the colour of the agent&#8217;s ticket. If the monitor&#8217;s guess is correct, then she receives an arbitrarily small reward, and the agent receives a large fine. Otherwise, the agent gets no fine. It follows that any equilibrium belief of the monitor leaves exactly one of the agent&#8217;s types better off rejecting bribes. But then the monitor can perfectly infer the agent&#8217;s type, so the type that rejects bribes would be better off accepting them. Hence there can be no bribes in equilibrium.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Christopher Stapenhurst\u00a0(QSMS) will present &#8220;Red and Gold (with Andrew Clausen and John Moore)&#8221; on November 15th, 2024, at 10:30 AM, in room QA406. Abstract:&nbsp;&nbsp;&nbsp; Clausen and Stapenhurst (2024) obtain a lower bound on the cost of the optimal static, bribe-proof mechanism. But what about dynamic mechanisms? We propose a mechanism called \u201cRed and Gold\u201d that &hellip; <a href=\"https:\/\/qsms.bme.hu\/index.php\/2024\/11\/19\/november-15-christopher-stapenhurst-qsms-seminar\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;November 15: Christopher Stapenhurst (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-1812","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\/1812","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=1812"}],"version-history":[{"count":1,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/posts\/1812\/revisions"}],"predecessor-version":[{"id":1813,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/posts\/1812\/revisions\/1813"}],"wp:attachment":[{"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/media?parent=1812"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/categories?post=1812"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/qsms.bme.hu\/index.php\/wp-json\/wp\/v2\/tags?post=1812"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}