How Sharing Information Can Garble Experts' Advice
نویسندگان
چکیده
منابع مشابه
How Sharing Information Can Garble Experts’ Advice
Executives often employ experts who draw on rich information to recommend an appropriate action. For instance, a commander-in-chief is advised by several intelligence experts about how to respond to potential threats. When such interactions are discussed in policy circles, a common worry is that there is not enough sharing of information among experts, resulting in bad advice and inefficient ou...
متن کاملHow Better Information Can Garble Experts’ Advice∗
We model two experts who must make predictions about whether an event will occur or not. The experts receive private signals about the likelihood of the event occurring, and simultaneously make one of a finite set of possible predictions, corresponding to varying degrees of alarm. The information structure is commonly known among the experts and the recipients of the advice. Each expert’s payof...
متن کاملHow Better Information Can Reduce the Credibility of Experts’ Advice∗
We model two experts who must make “bottom line” (yes/no) predictions about whether an event will occur or not. The experts receive private signals about the possibility of the bad event occurring—private signals that are much more informative than the coarse recommendations they can ultimately communicate. The experts like to make correct predictions, and otherwise we restrict their payoffs on...
متن کاملExperts' Advice to Information Systems Doctoral Students
This paper summarizes the results of a panel discussion offering advice to doctoral students in advancing through their programs and getting a start on their career. The panel was held at the 2003 Annual Conference of the Southern Association for Information Systems, and panelists included senior MIS faculty members who, combined, have chaired over 80 dissertations. Topics included choosing a d...
متن کاملHow to Garble RAM Programs3
Assuming solely the existence of one-way functions, we show how to construct Garbled RAM Programs (GRAM) where its size only depends on fixed polynomial in the security parameter times the program running time. We stress that we avoid converting the RAM programs into circuits. As an example, our techniques implies the first garbled binary search program (searching over sorted encrypted data sto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Economic Review
سال: 2014
ISSN: 0002-8282
DOI: 10.1257/aer.104.5.463