{"title":"评论","authors":"Jennifer La'O","doi":"10.1086/700898","DOIUrl":null,"url":null,"abstract":"In most macroeconomic models, time is infinite. Agents are endowed with rational expectations including the cognitive ability to solve complex infinite-horizon planning problems. This is a heroic assumption; but when does it matter? In “Monetary Policy Analysis When Planning Horizons Are Finite,” Michael Woodford reconsiders this unrealistic feature, introduces a novel bounded-rationality framework to address it, and explores under what circumstances this affects the policy conclusions of the standard New Keynesian paradigm. Woodford develops a new cognitive framework in which agents transform their infinite-horizon problem into a sequence of simpler, finite-horizon ones. The solution method used by the agent is to backward induct over a finite set of periods given some perceived value function he has assigned to his perceived terminal nodes. This solution method seems quite natural; in fact, Woodford is motivated by a beautiful analogy to how state-of-the-art artificial intelligence (AI) programs play the games of chess or go. Take chess—a gamewith a finite strategy space and thereby in theory solvable via backward induction. In practice, however, the space of strategies is so large that solving the game in this fashion would require unfathomableprocessing power. Consider then themost effectiveAI programs. A typical decision-making process may be described as follows: at each turn, the machine looks forward at all possible moves for both itself and its opponent a finite number of turns, thereby creating a decision tree with finite nodes. It assigns a value to each of the different possible terminal nodes; these values may be based on past experience or data. Finally, given these terminal node values, the machine backward","PeriodicalId":51680,"journal":{"name":"Nber Macroeconomics Annual","volume":"33 1","pages":"51 - 66"},"PeriodicalIF":7.5000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1086/700898","citationCount":"0","resultStr":"{\"title\":\"Comment\",\"authors\":\"Jennifer La'O\",\"doi\":\"10.1086/700898\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In most macroeconomic models, time is infinite. Agents are endowed with rational expectations including the cognitive ability to solve complex infinite-horizon planning problems. This is a heroic assumption; but when does it matter? In “Monetary Policy Analysis When Planning Horizons Are Finite,” Michael Woodford reconsiders this unrealistic feature, introduces a novel bounded-rationality framework to address it, and explores under what circumstances this affects the policy conclusions of the standard New Keynesian paradigm. Woodford develops a new cognitive framework in which agents transform their infinite-horizon problem into a sequence of simpler, finite-horizon ones. The solution method used by the agent is to backward induct over a finite set of periods given some perceived value function he has assigned to his perceived terminal nodes. This solution method seems quite natural; in fact, Woodford is motivated by a beautiful analogy to how state-of-the-art artificial intelligence (AI) programs play the games of chess or go. Take chess—a gamewith a finite strategy space and thereby in theory solvable via backward induction. In practice, however, the space of strategies is so large that solving the game in this fashion would require unfathomableprocessing power. Consider then themost effectiveAI programs. A typical decision-making process may be described as follows: at each turn, the machine looks forward at all possible moves for both itself and its opponent a finite number of turns, thereby creating a decision tree with finite nodes. It assigns a value to each of the different possible terminal nodes; these values may be based on past experience or data. Finally, given these terminal node values, the machine backward\",\"PeriodicalId\":51680,\"journal\":{\"name\":\"Nber Macroeconomics Annual\",\"volume\":\"33 1\",\"pages\":\"51 - 66\"},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1086/700898\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Nber Macroeconomics Annual\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://doi.org/10.1086/700898\",\"RegionNum\":1,\"RegionCategory\":\"经济学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Nber Macroeconomics Annual","FirstCategoryId":"96","ListUrlMain":"https://doi.org/10.1086/700898","RegionNum":1,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
In most macroeconomic models, time is infinite. Agents are endowed with rational expectations including the cognitive ability to solve complex infinite-horizon planning problems. This is a heroic assumption; but when does it matter? In “Monetary Policy Analysis When Planning Horizons Are Finite,” Michael Woodford reconsiders this unrealistic feature, introduces a novel bounded-rationality framework to address it, and explores under what circumstances this affects the policy conclusions of the standard New Keynesian paradigm. Woodford develops a new cognitive framework in which agents transform their infinite-horizon problem into a sequence of simpler, finite-horizon ones. The solution method used by the agent is to backward induct over a finite set of periods given some perceived value function he has assigned to his perceived terminal nodes. This solution method seems quite natural; in fact, Woodford is motivated by a beautiful analogy to how state-of-the-art artificial intelligence (AI) programs play the games of chess or go. Take chess—a gamewith a finite strategy space and thereby in theory solvable via backward induction. In practice, however, the space of strategies is so large that solving the game in this fashion would require unfathomableprocessing power. Consider then themost effectiveAI programs. A typical decision-making process may be described as follows: at each turn, the machine looks forward at all possible moves for both itself and its opponent a finite number of turns, thereby creating a decision tree with finite nodes. It assigns a value to each of the different possible terminal nodes; these values may be based on past experience or data. Finally, given these terminal node values, the machine backward
期刊介绍:
The Nber Macroeconomics Annual provides a forum for important debates in contemporary macroeconomics and major developments in the theory of macroeconomic analysis and policy that include leading economists from a variety of fields.