{"id":1590,"date":"2023-07-04T18:41:21","date_gmt":"2023-07-04T09:41:21","guid":{"rendered":"https:\/\/saraheee.com\/?p=1590"},"modified":"2023-07-07T18:43:40","modified_gmt":"2023-07-07T09:43:40","slug":"game-theory-10-chap17-sequential-rationality-in-games-of-imperfect-information","status":"publish","type":"post","link":"https:\/\/saraheee.com\/ko\/2023\/07\/game-theory-10-chap17-sequential-rationality-in-games-of-imperfect-information\/","title":{"rendered":"Game Theory 10 \u2013 chap17. Sequential rationality in games of imperfect information"},"content":{"rendered":"<p>5. Dynamic Bayesian Games<br>5.1 Games of Imperfect Information and Sequential Rationality*<\/p>\n\n\n\n<p>The next example demonstrates that subgame perfection is dysfunctional in dynamic games of imperfect into (equivalently, <em>incomplete<\/em> info)<\/p>\n\n\n\n<p><mark style=\"background-color:var(--global-color-10)\" class=\"has-inline-color\">EXAMPLE 5.1<\/mark>. Player 1 first moves by choosing one of the three actions: T, M, and B. If player 1 chooses either T or M, then player 2 learns only that player 1 did not choose B, choosing between L and R.<\/p>\n\n\n\n<figure class=\"wp-block-table alignright\"><table><tbody><tr><td>1 \\ 2<\/td><td>L<\/td><td>R<\/td><\/tr><tr><td>T<\/td><td>2, 1<\/td><td>0, 0<\/td><\/tr><tr><td>M<\/td><td>0, 2<\/td><td>0, 1<\/td><\/tr><tr><td>B<\/td><td>1, 3<\/td><td>1, 3<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"alignleft size-full is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/saraheee.com\/wp-content\/uploads\/2023\/06\/image-16.png\" alt=\"\" class=\"wp-image-1591\" width=\"416\" height=\"275\" srcset=\"https:\/\/saraheee.com\/wp-content\/uploads\/2023\/06\/image-16.png 832w, https:\/\/saraheee.com\/wp-content\/uploads\/2023\/06\/image-16-300x198.png 300w, https:\/\/saraheee.com\/wp-content\/uploads\/2023\/06\/image-16-768x508.png 768w\" sizes=\"(max-width: 416px) 100vw, 416px\" \/><\/figure><\/div>\n\n\n<p>In (B, R) player 2&#8217;s behavior is not sequentially rational, because R is <strong><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-8-color\">strictly dominated<\/mark><\/strong> at his information set<\/p>\n\n\n\n<p>Note that SPE = NE as there is no proper subgame<\/p>\n\n\n\n<p><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-15-color\">(T, L), (B, R) is NE<\/mark><\/p>\n\n\n\n<p><\/p>\n\n\n\n<p>The next example demonstrates why we need another ingredient: player&#8217;s beliefs<\/p>\n\n\n\n<p><mark style=\"background-color:var(--global-color-10)\" class=\"has-inline-color\">EXAMPLE 5.2<\/mark>. <\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"alignleft size-full is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/saraheee.com\/wp-content\/uploads\/2023\/06\/image-17.png\" alt=\"\" class=\"wp-image-1593\" width=\"395\" height=\"275\" srcset=\"https:\/\/saraheee.com\/wp-content\/uploads\/2023\/06\/image-17.png 790w, https:\/\/saraheee.com\/wp-content\/uploads\/2023\/06\/image-17-300x209.png 300w, https:\/\/saraheee.com\/wp-content\/uploads\/2023\/06\/image-17-768x535.png 768w\" sizes=\"(max-width: 395px) 100vw, 395px\" \/><\/figure><\/div>\n\n\n<figure class=\"wp-block-table alignright\"><table><tbody><tr><td>1 \\ 2<\/td><td>L<\/td><td>R<\/td><\/tr><tr><td>T<\/td><td>4, 1<\/td><td>0, 0<\/td><\/tr><tr><td>M<\/td><td>3, 0<\/td><td>0, 1<\/td><\/tr><tr><td>B<\/td><td>2, 2<\/td><td>2, 2<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>In contrast with the previous example, neither L nor R is strictly dominated<\/p>\n\n\n\n<p>Hence both strategies can be a best response, depending on <strong><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-8-color\">player 2&#8217;s beliefs<\/mark><\/strong><\/p>\n\n\n\n<p><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-15-color\">Player 2&#8217;s BR at {x,y} = \\(\\begin{cases}L \\quad p = Pr(\\text{player 2 at x}) > \\frac{1}{2} \\\\ \\{L,R\\} \\quad p=\\frac{1}{2} \\\\ R \\quad p &lt; \\frac{1}{2}\\end{cases}\\)<\/mark><\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Beliefs<\/h3>\n\n\n\n<p>Player i&#8217;s beliefs are a probability distribution over his decision nodes satisfying<\/p>\n\n\n\n<p>\\(\\sum_{x \\in I}\\mu_i(x)\\) = 1 for each information set \\(I \\subset D_i\\).<\/p>\n\n\n\n<p><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-15-color\">e.g., in {a, b, c, d}, II = {{p, 1-p}, {q, 1-q}} = {{a, c}, {b, d}}<br>The sum of the decision nodes of a and c is 1, b and d are also 1, and beliefs can be defined by their respective probability distributions<\/mark><\/p>\n\n\n\n<p><mark style=\"background-color:var(--global-color-10)\" class=\"has-inline-color\">EXAMPLE 5.3<\/mark>.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"alignleft size-large is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/saraheee.com\/wp-content\/uploads\/2023\/07\/image-11-1024x618.png\" alt=\"\" class=\"wp-image-1687\" width=\"512\" height=\"309\" srcset=\"https:\/\/saraheee.com\/wp-content\/uploads\/2023\/07\/image-11-1024x618.png 1024w, https:\/\/saraheee.com\/wp-content\/uploads\/2023\/07\/image-11-300x181.png 300w, https:\/\/saraheee.com\/wp-content\/uploads\/2023\/07\/image-11-768x463.png 768w, https:\/\/saraheee.com\/wp-content\/uploads\/2023\/07\/image-11.png 1084w\" sizes=\"(max-width: 512px) 100vw, 512px\" \/><\/figure><\/div>\n\n\n<ul class=\"wp-block-list\">\n<li>No need to specify player 2&#8217;s beliefs<\/li>\n\n\n\n<li>Player 3 has two info sets,<\/li>\n<\/ul>\n\n\n\n<p>\\(\\mathbb{I}_3\\) = {{a, b}, {c}}.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Player 3&#8217;s possible beliefs are<\/li>\n<\/ul>\n\n\n\n<p><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-15-color\">\\(\\mu_3 = (\\mu_3(a), \\mu_3(b))\\)<\/mark><br><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-15-color\">\\(\\mu_3(a) + \\mu_3(b) = 1\\)<\/mark><\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Bayesian Beliefs<\/h3>\n\n\n\n<p>Consider a decision node x in information set <em>I<\/em><\/p>\n\n\n\n<p>Given a strategy profile \\(\\sigma = (\\sigma_1, \\sigma_2)\\), we define<\/p>\n\n\n\n<p>\\(P_\\sigma(x)\\) = the probability of node x being reached under \\(\\sigma\\)<br>\\(P_\\sigma(I)\\) = the probability of info set <em>I<\/em> being reached under \\(\\sigma\\)<\/p>\n\n\n\n<p>Player <em>i<\/em>&#8216;s beliefs \\(\\mu\\) are said to be <em>Bayesian given<\/em> \\(\\sigma\\) if for every x \u2208 <em>I<\/em>.<\/p>\n\n\n\n<p>\\(\\mu_i(x) = \\frac{P_\\sigma(x)}{P_\\sigma(I)}\\) whenever \\(P_\\sigma(I)\\) &gt; 0<\/p>\n\n\n\n<p><mark style=\"background-color:var(--global-color-10)\" class=\"has-inline-color\">EXAMPLE 5.4<\/mark>. Suppose that the 3 players play according to \\(\\sigma\\) in the following game: <\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"alignleft size-large is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/saraheee.com\/wp-content\/uploads\/2023\/07\/image-12-1024x588.png\" alt=\"\" class=\"wp-image-1691\" width=\"512\" height=\"294\" srcset=\"https:\/\/saraheee.com\/wp-content\/uploads\/2023\/07\/image-12-1024x588.png 1024w, https:\/\/saraheee.com\/wp-content\/uploads\/2023\/07\/image-12-300x172.png 300w, https:\/\/saraheee.com\/wp-content\/uploads\/2023\/07\/image-12-768x441.png 768w, https:\/\/saraheee.com\/wp-content\/uploads\/2023\/07\/image-12.png 1194w\" sizes=\"(max-width: 512px) 100vw, 512px\" \/><\/figure><\/div>\n\n\n<p>\\(P_sigma(x)\\) = (0.5T + 0.5B, (0.2L + 0.8R, 0.8L + 0.2R), W)<\/p>\n\n\n\n<p>\\(P_\\sigma(x) = P_\\sigma(y)\\) = 0.5<br>\\(P_\\sigma(a)\\) = 0.1<br>\\(P_\\sigma(b)\\) = 0.4<br>\\(P_\\sigma(c)\\) = 0.4<br>\\(P_\\sigma(I)\\) = 0.9, where <em>I<\/em> = {a, b, c}<\/p>\n\n\n\n<p>Player 3&#8217;s Bayesian beliefs given \\(\\sigma\\) are<\/p>\n\n\n\n<p><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-15-color\">\\(\\mu_3(a) = \\frac{P_\\sigma(a)}{P_\\sigma(I)} = \\frac{0.1}{0.9} = \\frac{1}{9}\\), \\(\\mu_3(b) = \\mu_3(c) = \\frac{4}{9}\\)<\/mark><\/p>\n\n\n\n<p><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-15-color\">P(A|B) = P(A\u22c2B)\/P(B)<\/mark><\/p>\n\n\n\n<p>When P1 plays B and P2 plays R at node y, P3&#8217;s info set <em>I<\/em> is never reached.<br>In this case, we say \\(\\mu_3\\) is <em>unrestricted<\/em> and any arbitrary \\(\\mu_3\\) is Bayesian.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Sequential Rationality<\/h3>\n\n\n\n<p>Recall that in games of perfect information, the principle of sequential rationality requires that each player&#8217;s strategy be optimal at <strong><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-8-color\">every decision node<\/mark><\/strong>, given the strategy profile, regardless of whether the node is reached.<\/p>\n\n\n\n<p>Since some decision nodes are indistinguishable in <em>games of imperfect information<\/em>, we amend the principle as follows:<\/p>\n\n\n\n<p>In games of <strong><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-8-color\">imperfect<\/mark><\/strong> information, the principle of sequential rationality requires that each player&#8217;s strategy be optimal at <strong><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-8-color\">every information set<\/mark><\/strong>, given the strategy profile and <strong><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-global-color-8-color\">the player&#8217;s beliefs<\/mark><\/strong>, regardless of whether the set is reached.<\/p>\n\n\n\n<p><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Reference: Chang-Koo Chi, (36\/50) Game Theory and Applications 10 \u2013 Sequential rationality in games of imperfect information, Jul 14, 2020,\u00a0<a href=\"https:\/\/youtu.be\/jEEyjlxt1ug\" rel=\"noopener\">https:\/\/youtu.be\/jEEyjlxt1ug<\/a><\/li>\n<\/ul>\n\n\n\n<p><\/p>","protected":false},"excerpt":{"rendered":"<p>We explain how to define sequential rationality in dynamic Bayesian games and why traditional equilibria (SPE or NE) do not satisfy sequential rationality.<\/p>","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[34,95,4,94,96,93],"class_list":["post-1590","post","type-post","status-publish","format-standard","hentry","category-game-theory-and-applications","tag-beliefs","tag-dynamic-bayesian-games","tag-game-theory","tag-imperfect-information","tag-jul-4-2023","tag-sequential-rationality"],"_links":{"self":[{"href":"https:\/\/saraheee.com\/ko\/wp-json\/wp\/v2\/posts\/1590"}],"collection":[{"href":"https:\/\/saraheee.com\/ko\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/saraheee.com\/ko\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/saraheee.com\/ko\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/saraheee.com\/ko\/wp-json\/wp\/v2\/comments?post=1590"}],"version-history":[{"count":25,"href":"https:\/\/saraheee.com\/ko\/wp-json\/wp\/v2\/posts\/1590\/revisions"}],"predecessor-version":[{"id":4629,"href":"https:\/\/saraheee.com\/ko\/wp-json\/wp\/v2\/posts\/1590\/revisions\/4629"}],"wp:attachment":[{"href":"https:\/\/saraheee.com\/ko\/wp-json\/wp\/v2\/media?parent=1590"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/saraheee.com\/ko\/wp-json\/wp\/v2\/categories?post=1590"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/saraheee.com\/ko\/wp-json\/wp\/v2\/tags?post=1590"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}