{"title":"贝叶斯说服如何帮助减少非法停车和其他不受欢迎的社会行为","authors":"P. Hernández, Z. Neeman","doi":"10.1257/mic.20190295","DOIUrl":null,"url":null,"abstract":"We consider the question of how best to allocate enforcement resources across different locations with the goal of deterring unwanted behavior. We rely on “Bayesian persuasion” to improve deterrence. We focus on the case where agents care only about the expected amount of enforcement resources given messages received. Optimization in the space of induced mean posterior beliefs involves a partial convexification of the objective function. We describe interpretable conditions under which it is possible to explicitly solve the problem with only two messages: “high enforcement” and “enforcement as usual.” We also provide a tight upper bound on the total number of messages needed to achieve the optimal solution in the general case as well as a general example that attains this bound. (JEL D83, K42, R41)","PeriodicalId":47467,"journal":{"name":"American Economic Journal-Microeconomics","volume":" ","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"How Bayesian Persuasion Can Help Reduce Illegal Parking and Other Socially Undesirable Behavior\",\"authors\":\"P. Hernández, Z. Neeman\",\"doi\":\"10.1257/mic.20190295\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the question of how best to allocate enforcement resources across different locations with the goal of deterring unwanted behavior. We rely on “Bayesian persuasion” to improve deterrence. We focus on the case where agents care only about the expected amount of enforcement resources given messages received. Optimization in the space of induced mean posterior beliefs involves a partial convexification of the objective function. We describe interpretable conditions under which it is possible to explicitly solve the problem with only two messages: “high enforcement” and “enforcement as usual.” We also provide a tight upper bound on the total number of messages needed to achieve the optimal solution in the general case as well as a general example that attains this bound. (JEL D83, K42, R41)\",\"PeriodicalId\":47467,\"journal\":{\"name\":\"American Economic Journal-Microeconomics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2022-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"American Economic Journal-Microeconomics\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://doi.org/10.1257/mic.20190295\",\"RegionNum\":2,\"RegionCategory\":\"经济学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"American Economic Journal-Microeconomics","FirstCategoryId":"96","ListUrlMain":"https://doi.org/10.1257/mic.20190295","RegionNum":2,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ECONOMICS","Score":null,"Total":0}
How Bayesian Persuasion Can Help Reduce Illegal Parking and Other Socially Undesirable Behavior
We consider the question of how best to allocate enforcement resources across different locations with the goal of deterring unwanted behavior. We rely on “Bayesian persuasion” to improve deterrence. We focus on the case where agents care only about the expected amount of enforcement resources given messages received. Optimization in the space of induced mean posterior beliefs involves a partial convexification of the objective function. We describe interpretable conditions under which it is possible to explicitly solve the problem with only two messages: “high enforcement” and “enforcement as usual.” We also provide a tight upper bound on the total number of messages needed to achieve the optimal solution in the general case as well as a general example that attains this bound. (JEL D83, K42, R41)