UBC Theses and Dissertations

UBC Theses Logo

UBC Theses and Dissertations

Essays on information and collective choice Bhattacharya, Sukanta 2006

Your browser doesn't seem to have a PDF viewer, please download the PDF to view this item.

Item Metadata

Download

Media
831-ubc_2006-199381.pdf [ 4.42MB ]
Metadata
JSON: 831-1.0092918.json
JSON-LD: 831-1.0092918-ld.json
RDF/XML (Pretty): 831-1.0092918-rdf.xml
RDF/JSON: 831-1.0092918-rdf.json
Turtle: 831-1.0092918-turtle.txt
N-Triples: 831-1.0092918-rdf-ntriples.txt
Original Record: 831-1.0092918-source.json
Full Text
831-1.0092918-fulltext.txt
Citation
831-1.0092918.ris

Full Text

Essays on Information and Collective Choice by Sukanta  Bhattacharya  B.Sc, The University of Calcutta, 1992 M.Sc, The University of Calcutta, 1994 A THESIS SUBMITTED IN PARTIAL F U L F I L M E N T OF T H E REQUIREMENTS FOR T H E D E G R E E OF DOCTOR OF PHILOSOPHY in The Faculty of Graduate Studies (Economics)  T H E UNIVERSITY OF BRITISH COLUMBIA July 2006 © S u k a n t a B h a t t a c h a r y a , 2006  11  Abstract This thesis consists of three essays that attempt to contribute towards a better understanding of the collective choice problems in presence of incomplete information. The first essay of this dissertation investigates a voting model with conflict of interest between the designer of the voting rule and the voters who share a common preference. We show that, given sophisticated voting by the voters, designer's optimal voting rule either nearly coincides with the voters' optimal rule or is a near unanimity rule for one of the alternatives. When the designer has a very strong bias in favour of one of the alternatives, her best option may lie in increasing the threshold of votes for that alternative. The second essay discusses an indirect voting mechanism that can achieve better informational efficiency. It is well known that under usual (simultaneous) voting rules, private information held by voters are imperfectly aggregated. We consider a multi-round sequential voting procedure which allows voters to choose when to cast their votes. Without any conflict of interest among voters, there is always an equilibrium under this rule which perfectly aggregates all the available information. Moreover, in an environment with conflicting interest among voters, we show that this indirect mechanism achieves as an equilibrium outcome what pre-play communication can achieve. The third essay examines committee design under endogenous information and shows that two opposing effects - the free-rider effect and the information complementarity effect - could get intensified in different parameter regions as the committee size increases. This induces a trade-off between quality and quantity of information for the committee designer. The model identifies parametric situations where it may be optimal to create a smaller committee to ensure better quality of information.  iii  Contents Abstract  ii  Contents  iii  List of Figures  v  Acknowledgements  vi  Dedication  vii  1 2  Overview and Summary  1  O p t i m a l V o t i n g R u l e s w i t h D i v e r g e n t Preferences  2.1 Introduction •2 .2 ' The Model and Results 2.3 Concluding Remarks  ....  :  3  4  9  9 17 36  Information Aggregation in Multi-round Elections . . . . . .  38  3.1 3.2 3.3 3.4  38 46 56 68  Introduction The Model with Common Interest Diverse Preference Concluding Remarks  Committee, Design w i t h Endogenous Information  70  4.1 4.2 4.3  Introduction The Model Committee Design 4.3.1 One member committee  70 76 80 81  4.3.2  82  Two member committee  iv  4.4  4.3.3 Comparison between committees Concluding Remarks  Bibliography A Appendices A . l Appendix to Chapter 2 A.1.1 Proof of Lemma 2.3 A.1.2 Proof of Lemma 2.4 A.2 Appendix to Chapter 4 A.2.1 Proof of Lemma 4.3 A.2.2 Proof of Lemma 4.4 . A.2.3 Proof of Proposition 4.1 A.2.4 Proof of Proposition 4.2  87 95 96 103 103 103 108 110 110 112 112 115  V  List of Figures 3.1 3.2  Equilibrium path of play for class 0 equilibria in D G S Equilibrium path of play in multi-round voting game  60 67  4.1 4.2  Pure Strategy Equilibria for Different Prior Values: c < C\. . . 90 Pure Strategy Equilibria for Different Prior Values: c > c_- • • 91  vi  Acknowledgements I must express m y indebtedness to m y supervisor Professor P a r i k s h i t G h o s h w i t h o u t whose guidance and supervision I w o u l d n ' t be able to complete this thesis. I a m also grateful to Professor P a t r i c k Francois and Professor O k a n Y i l a n k a y a who, as members of my supervisory committee, have always been sources of helpful suggestions and i n s p i r a t i o n . I w o u l d also like to t h a n k P r o fessor A s h o k K o t w a l , Professor M u k e s h E s w a r a n , Professor Y o r a m Halevy, Professor G o r k e m C e l i k , Professor Francisco G o n z a l e z and Professor A r t Shneyerov for useful comments at various stages of the dissertation. I h a d m a n y i l l u m i n a t i n g discussions w i t h m y colleagues at the U n i v e r s i t y of C a l c u t t a a n d m y classmates here at the U n i v e r s i t y of B r i t i s h C o l u m b i a w h i c h helped me i n different, often indirect, ways i n w r i t i n g this thesis.  Finally,  I must acknowledge the c o n t r i b u t i o n made towards this thesis by m y family, especially m y wife P i y a l i Sarkar, who had to bear w i t h a l l the family responsibilities d u r i n g m y long absence away from home.  To My Wife  Piyali  and  Daughter  Sharanya  1  1. Overview and Summary This dissertation consists of three essays that contribute towards the understanding of collective choice problems in presence of incomplete information. Any acceptable social choice rule should address two separate concerns. The first question deals with finding social choice rules that leads to an acceptable aggregation of individual preferences.  The literature on welfare economics  has dealt with this issue extensively. But any study that aims to deal with efficiency of collective decision in an uncertain environment must also acknowledge the role private information can play. Individual choice depends on private information and individual decisions are somehow aggregated to arrive at a collective decision. More informed decision-making increases the overall efficiency of the outcome. A n efficient social choice rule, therefore, besides finding an acceptable way to aggregate (possibly) diverse preferences of individuals, should recognize the importance of private information and take into account two factors. Institutions concerned with collective decisions should be designed to give proper incentives for information collection to the agents. Secondly, the private information of the agents should be used in the best possible way while making the final decision. These are the issues this dissertation intends to address. Voting is one of the most common social choice mechanisms used in prac-  2 tice to arrive at a collective decision. One purpose of holding elections is clearly to aggregate individual preferences. But even abstracting from that, differences of opinion among agents may arise due to different private information. Hence, one purpose that an election intends to serve is to aggregate this disparate information. It has been recognized in the literature that there are some voting mechanisms which serve this purpose better than others. Now, assuming that society's average preference is the same as that of the body to which the decision is delegated (e.g. a jury or a committee), the voting rule that leads to best possible use of information is optimal for the society. In the first essay of this dissertation we take up an abstract model of voting to examine the consequence of conflict of interest among the society at large and members of the jury or the committee. We characterize the optimal voting rule from society's point of view. The second essay of the thesis deals with the issue of information aggregation more closely, again in the context of a voting model. A well-known result in the literature on strategic voting is that simultaneous voting procedures cannot lead to efficient information aggregation if the information structure is rich enough. We look for a richer, yet practical, voting procedure that can achieve this end. We show that if the voters are allowed to choose the timing of their votes, then, under any voting rule, a substantial improvement towards better information aggregation can be made. The third and final essay of the thesis travels in another direction to investigate the incentive for collecting information when information is endogenous. We provide a model with multiple agents where agents are allowed to choose both the quality and the quantity of information. We show that  3  there may arise situations where a smaller group performs better even under the assumption of full information aggregation. The analytical framework adopted for this study has some restrictive features which are worth spelling out to give the reader a sense of its scope and possible limitations. First, we restrict attention throughout to binary choices. While restrictive, many problems of collective choice do involve two choices. For example, whether a bill should be accepted in the legislature, a defendant should be convicted on criminal charges, a job applicant should be hired, a particular Presidential candidate should be chosen in a two-party system, whether a medical panel should recommend surgery for a patient, and so on. Second, we adopt a preference structure where all conflicts of interest (if any) arise from the issue of how to deal with uncertainty. In other words, in our framework, if the state-of-the-world were commonly known, everyone would agree about the correct course of action. Since only noisy information is available, preferences can be characterized by the relative weights agents place on the two types of errors that may arise. Most of the analysis goes further and assumes that agents also share a common distribution of weights. Preferences of this class, while special, seem reasonable descriptions of some real world problems. For example, people agree that murderers should be imprisoned and innocent people are entitled to personal freedom.  Many  economic policies (e.g. trade) have distributional consequences and therefore lack of consensus regarding the optimal choice. However, disagreements over monetary policy seem to be rooted more in disagreements over potential consequences rather than conflicting objectives (everyone benefits from low  4  inflation' and reduced macroeconomic fluctuations). Members of academic departments have substantial common interest in hiring superior candidates and rejecting inferior ones, even though private information may lead them to rank the candidates for a position differently. In these scenarios, the problem is not how to resolve the tension between conflicting objectives, but how to aggregate private information and make collective choices as responsive to available information as possible. Many interesting problems, on the other hand, clearly involve conflicting aims as well as dispersed information. For example, people's preferences over Presidential candidates are likely to be a function both of perceived ability and the voter's ideological leanings. It would be nice to develop a theoretical framework that allows for both these aspects and their interplay. However, this is not an easy analytical task and the literature based on such analysis is still nascent. We believe, along with many other researchers in this area, that the insights learnt from studying the' pure information- aggregation problem can be useful in studying the more complex, hybrid cases. Chapter 2 analyzes the properties of collective decision making when it is implemented through some voting rule that gives each agent a single transferable vote and a minimum threshold of votes necessary for each alternative to be chosen. This is a very limited class of mechanisms. For the environments and problems considered, more general mechanisms will typically lead to more efficient outcomes. In the real world, overly complex mechanisms may be too costly or place too high a cognitive demand on participants, possibly outweighing their benefits in many cases. In any case, voting is a commonly observed method of making collective decisions, and therefore understanding  5 its strategic and welfare consequences is of p r a c t i c a l relevance. Since v o t i n g is often an imperfect way of aggregating i n f o r m a t i o n , there is also value to asking normative questions. C a n we m o d i f y collective decision m a k i n g procedures i n ways t h a t significantly improve outcomes, w i t h o u t a d d i n g too m u c h i n terms of c o m p l e x i t y or i m p l e m e n t a t i o n cost? T h e exercise i n chapter 3 is a step i n this direction. W e amend usual v o t i n g procedures by allowing voters to choose the t i m i n g of their votes, and releasing i n t e r i m s u m m a r y i n f o r m a t i o n about vote tallies. T h i s m o d i f i c a t i o n of rules does not seem too d e m a n d i n g given today's i n f o r m a t i o n technology. W e show t h a t if voters' fundamental objectives are closely aligned, such a m o d i f i c a t i o n allows i n f o r m a t i o n to be efficiently aggregated. In the analysis of C h a p t e r s 2 and 3, do not allow explicit pre-play c o m m u n i c a t i o n a m o n g the voters. T h i s seems reasonable i n some cases (e.g. i n n a t i o n a l elections), where the electorate is large and dispersed, but unrealistic i n others (e.g.  i n j u r y decisions). M o s t elections w i l l present  some  o p p o r t u n i t y for n o n - b i n d i n g pre-play c o m m u n i c a t i o n , but it may be imperfect for reasons of time, cost, c o m p l e x i t y or c o m m u n i c a t i o n difficulties. T h e a n a l y t i c a l framework adopted i n this study may be a reasonable a p p r o x i m a t i o n for some of these scenarios. A s mentioned, it w o u l d be nice to b u i l d a richer framework capable of h a n d l i n g more diverse preferences and o p p o r t u n i t y for pre-play cheap talk, but this raises significant technical difficulties w h i c h the literature on the subject is far from resolving satisfactorily.  6  E s s a y 1: O p t i m a l V o t i n g R u l e s w i t h D i v e r g e n t  Preferences  We investigate a model where the decision making is delegated to a group of individuals with disparate information but common preference. The group arrives at a decision using a voting mechanism where the voting rule is chosen by a designer who may have preference difference from that of group members. The designer faces a trade-off between choosing a rule that leads to maximum utilization of information and a rule that aggregates information in a way to suit her own preference. We show that the designer resolves this trade off by going to one of the extremes. In other words, either she chooses a rule that efficiently utilizes almost all available information or a rule that leads to almost all information being ignored. We provide a full characterization of these two cases based on the designer's preferences. We show that if the designer and the group has opposing biases in favour of one of the alternatives, then the best voting rule for the designer is nearly the one that is best for the group. If, on the other hand, the designer has similar, but relatively stronger, bias as the group for one of the alternatives, the optimal rule is one which requires near-unanimity rule for the favoured alternative. Intuitively, this gives the group greater incentive to vote for the designer's favoured alternative uninformatively (since the group has similar bias, it will vote uninformatively in favour of the designer's preferred alternative). We conclude by noting that for a wide range of designer's preferences, the optimal voting rule is almost independent of the designer's preference. In other words, decisive power (votes) is more important than constitutional power in many of the scenarios considered.  7 Essay 2 : Information Aggregation in M u l t i - R o u n d Elections In this essay we examine a model of sequential voting to examine its effects on the information aggregation properties of the voting rules. In contrast to some existing studies which claim that vote sequencing cannot change the equilibrium outcome of a voting game, we show that it does if the sequencing is endogenous. If the voters have common interest, or in other words if the sole purpose of the election is information aggregation, we show that with flexible timing there always exists a Bayesian Nash equilibrium, where information is fully aggregated. Moreover, if the model is symmetric, full information aggregation can be achieved as a symmetric equilibrium outcome. One of the most important features of our result is that this efficient equilibrium can be obtained irrespective of the voting cutoff. In the common interest case, if pre-play communication among the voters is allowed, all information is revealed instantly, and full information aggregation is achieved. The sequential voting procedure with flexibility in timing of the votes achieves the same in the absence of communication. A natural question is how well this indirect mechanism works in the presence of conflict of interest among the voters. No voting procedure will generally achieve full-information aggregation in this case since the voters have an incentive to strategically withhold their private information. We illustrate, with a two person example with conflicting preferences, that the equilibria of the sequential voting game are outcome equivalent to the set of efficient equilibria of the same voting game with pre-play communication. Unfortunately, we do not have a result that establishes a direct connection between the above two sets of equilibria under a more general environment.  8 E s s a y 3: E n d o g e n o u s I n f o r m a t i o n a n d C o m m i t t e e D e s i g n  The third essay of the thesis explores the moral hazard problem of individuals in the context of committee design with endogenous information. We identify two kinds of effects on the incentive for collecting information that could arise as a result of a larger committee size. Since information is a public good, with endogenous information collection there could arise a free-rider  effect  leading to a fall in the quality of information collected by each individual when several members are entrusted with the task. However, there could arise a complementarity  effect  as, in some situations, one's information may  not be valuable in itself but becomes valuable in conjunction with others' information. The second effect bolsters the incentive to collect information in a larger committee and could lead to better quality information collected by each member. .  In a model involving different levels of quality of information, the designer could face a trade-off between quantity and quality of information in some situations, while deciding on the size of the committee. We show that the resolution to this trade-off can go either way. We identify parameter zones where a smaller committee performs strictly better and thus provide a strict violation of one of the Condorcet jury theorems.  9  2. Optimal Voting Rules with Divergent Preferences 2.1  Introduction  Often we encounter situations where the decision maker or the society has to delegate the decision making to a group of agents (such as a jury or a committee or a legislature). With exogenous information, a group has access to greater information than a single individual and hence in an environment with imperfect information has an obvious advantage in decision-making. Differences of opinions among the member of this group may arise due to different information, which then can be aggregated to arrive at a group decision using some social choice rule. One problem the group decision making may encounter is that of aggregating the disparate information of individual members. Not all social choice rules perform equally well in this respect. A social choice rule is any rule that maps individual opinions into a group decision. If there is no inherent conflict of interest among the members of the group, the best social choice rule for the group is the one that aggregates individual information most efficiently. This is well documented in the literature on social choice and vot-  10 ing . If the designer of the choice rule has the same preference as the group, 1  the efficient rule for the group is the most efficient one for the designer. But if the designer's preference differs from that of the group, the optimal rule for the group may not be optimal for the designer because of the obvious reason that the designer has an incentive to distort the choice rule to suit her own preference. In many decision problems, time inconsistency of preference is well recognized. At the outset, an optimal plan for future course of actions can be identified, but when the time comes to execute these actions, they are no longer preferred. Time inconsistency can be observed in every sphere of life - from individual decisions to government policy making or societal response to an event. Individuals who have decided to quit smoking do it. Couples who have pledged to a future plan of savings over a life span spend money on a top end car by deviating from the original plan. Government policies are even more prone to time inconsistencies. Populism in the face of election, giving in to pressures from interest groups are commonly observed phenomena. In the sphere of law, long term justice demands impassionate reasoning. But in the emotionally charged atmosphere of a criminal trial, the jury's decision often gets affected by sympathy and emotions rather than pure logic. For example, in a trial for a heinous crime committed to a child, a jury may be more trigger happy, while the long term view of natural justice demands stronger evidence for conviction. Time inconsistency may arise due to strategic reasons as well. In a situation involving strategic interactions among multiple agents, an agent may make long term gains by committing Starting from Condorcet [12], in the eighteenth century, there exists a large literature that deals with voting and elections as social choice mechanisms. 1  11 to a particular course of actions against others under certain circumstances, but ex post there may still exist incentives for deviation from the promised course of action for the sake of short term benefits. To avoid the time inconsistency problems, two types of strategic responses are common. One is to engage in precommitments that reduce the opportunities to give in for temptations. Individuals commit to a generous pension plan to avoid the temptation of unnecessary current consumption. The other option available for avoiding time inconsistency problems is delegation of the decision making to some other agent or group of agents. In monetary and exchange rate policies, for instance, the credibility of the policy is very important and it can be costly in the long run to give in for temptations in the short run (Kydland and Prescott [32] and Barro and Gordon [4]). The time inconsistency problem in the context of monetary policy has been extensively studied in literature. Rogoff [48] showed that appointing an independent conservative central bank that put more weight on controlling inflation than increasing output would reduce the discretionary inflationary bias in monetary policy. The rules by which the central bank is governed are set by the government while the actual decision is taken by the bank independently. In the context of US trade policy, the incumbent President has very little discretion. There exist mandated sanctions by law implemented by US Trade Representatives against certain kind of behaviour of the trading partners of the United States. The delegation of decision is made to make the commitment to sanctions credible, thus avoiding the potential time inconsistency problems. Both precommitment and delegation of decision-making to other agents can be viewed as institutional devices to improve or eliminate the time  12 inconsistency problems. The purpose of this discussion is to argue that there may arise many real world situations where long term interest of the society may be in conflict with its short term decision makers. Often it is the case that the society sets the rules of decision making while the power of decision making rests with others. In this chapter, we analyze a model of a social institution where decision making is delegated to a group of agents. The said group of agents, who may or may not have the same preference as the society, arrives at a decision using some collective choice mechanism set by the society. Many social institutions fit into this category. Legislative decisions and jury trials are two of the more prominent ones. Voting is one of the most commonly observed collective choice mechanisms. Hence, it is interesting to examine a situation like above in the context of a simple voting model where the designer chooses the voting rule and the group takes the decision. In the presence of conflict of interest between the designer and the group, the designer faces a trade-off while choosing the voting rule. She may distort the voting rule from that which leads to efficient information aggregation to suit her own preference, but in the process loses valuable information. We show that the resolution of this trade-off has the nature of a corner solution. The best solution for the designer is either to induce usage (almost) all the information, or to induce the group to take the decision using as little information as possible in the decision making. The intuition behind this result lies in the convexity in the value of information  2  The convexity in the value of information has been first identified by Radner and Stiglitz[47] though in a different .model. But the result is general and holds under most environments. * • '• * . . . . 2  13 arising out of the complementarity of the private information possessed by different members of the group. It is well known that value of information is convex in a decision problem. As it turns out in our model, even when the decision is delegated, the convexity property carries over. We use a two alternative binary signal model where the group chooses one of the alternatives using a voting rule. Each member of the group, after observing her private signal, casts a vote for one of the alternatives. The votes are aggregated using the voting rule chosen by the designer.  This  is a standard model used extensively in the literature on sophisticated (or strategic) voting . We show that for a wide range of values of the designer's 3  preference parameter, the optimal voting rule for the designer is almost the same as the optimal voting rule for the group. If the group members vote in a sophisticated manner, then they try to rectify any deviation from their optimal voting rule by altering their equilibrium behaviour. Hence, the change in the voting rule by the designer to suit her own preference does not have the desired effect (or at least to the extent she desired) while resulting in loss of valuable information. More specifically, our results show that if the designer and the group members have opposing biases , the optimal voting rule for the designer is 4  almost the same as that of the group. On the other hand, if the designer 5  has a relatively stronger but similar bias as the group, then a unanimity or See Austen-Smith and Banks[3], Feddersen and Pesendorfer[21, 22], Miller[43] to name a few among many. An agent is biased in favour of of an alternative, if in the absence of any information she chooses that alternative. By almost same here we mean that the designer's optimal voting rule is either same as the group's optimal rule or just one off in either direction. 3  4  5  14 near-unanimity rule for the favoured alternative is optimal for the designer. Both results betray the initial intuition. With opposing biases, one would think that the designer will have greater incentive to manipulate the voting rule. While in case the designer has very strong bias in favour of one of the alternatives, it is likely to be the case that she will have incentive to make it easier for the group to choose that alternative. But exactly the opposite happens because of the sophisticated behaviour of the members, which the designer takes into account. The last result is somewhat related to what Feddersen and Pesendorfer[22] have shown. In their case, the probability of choosing an alternative wrongly may be higher under unanimity rule for that alternative than under some interior rule. We obtain a similar type of result though the equilibrium they select is different from ours. While a significant number of studies in the literature on strategic voting have dealt with properties of different voting rules , most are concerned 6  with finding the rule that aggregates information in the best possible way . 7  Austen-Smith and Banks [3], in a very important contribution to this field, have shown that with a binary signal structure there exist a unique voting rule that aggregates information efficiently and hence maximizes the group's ex-ante pay-off. We use this result extensively throughout in our model. Feddersen and Pesendorfer [21, 22], Duggan and Martinelli [20], Martinelli Some papers have examined the efficiency of different voting rules under the assumption of sincere voting. Sincere voting holds when voters vote the way they would had they been called upon to make the decision alone. See Miller [43], Ladha [33] and Berend and Paroush [6] for analysis of this. Young [53, 54] analyzes the same with more than two alternatives. We do not assume sincere voting a-priori, though this may arise as a result of equilibrium behaviour. W i t h a signal structure that allows for more than two realizations, generally there does not exist any voting rule that aggregates information efficiently. See Austen-Smith and Banks [3]. 6  7  15 [39], Meirowitz [42] and Wit [51] discussed asymptotic properties of different voting rules under various environments . 8  In an important contribution, McLennan [41] has shown that if the group members have common interest, the strategy profile that maximizes the exante (common) pay-off function given the voting rule constitutes a Bayesian Nash equilibrium. Since this equilibrium is the ex-ante pay-off maximizer for the group, this equilibrium is optimal among the class of Bayesian Nash equilibria from the point of view of the group. Chakraborty and Ghosh [10] have shown that there always exists an efficient equilibrium in pure strategies and they have provided a complete characterization of the pure strategy efficient equilibrium for a voting game in the binary signal case. In our model, we choose this equilibrium for the purpose of comparison across different voting rules. One important aspect of our model that merits some discussion here is that we don't allow for direct communication among the group members. With common interest among the group members, communication prior to voting would lead to all information becoming public knowledge. Hence, the decision will be independent of the voting rule, with every individual voting one way or the other. The designer can then do nothing by manipulating the voting rule. We show that even in the absence of communication the designer can do very little given sophisticated voting by the voters. Our model can also be related to the literature on committee design and delegation. One strand of literature in this area extends the information transmission model of Crawford and Sobel [14] to examine how a decisionSome have dealt with richer signal spaces, while others have incorporated heterogeneity among jury's preferences. 8  16 maker's welfare can be influenced by varying the composition of a committee consisting of members with useful information ("expertise") whose policy preferences differ from that of the decision-maker (or the organization). Gilligan and Krehbiel [26], Austen-Smith [1, 2], Krishna and Morgan [30, 31], Battaglini [5] examine situations where all committee members have the same information but may have different preferences. Wolinsky [52] examines a model where experts have the same preference but receive different signals, but the power of decision making rests with the designer, while in our model the decision is delegated to the group members. Li and Suen [37], 9  Dessein [17] and de Garidel-Thoron and Ottaviani [15] have studied models of delegation; but while the focus of these studies are mostly on composition of the group, we focus oh the choice of the decision rule for a group with given preference. Other notable contributions'to the literature'on voting with private information are the following. Dekel and Piccione [16] analyze sequential, rather than simultaneous, voting procedures. Persico [46] studies a voting model with endogenous information to compare among different voting rules in terms of the incentives generated for information acquisition, as well as their information aggregation properties. Coughlan [13], Doraszelski, Gerardi and Squintini [19] and Gerardi and Yariv[23] study voting behaviour when voters can communicate. While these are interesting issues in themselves, our focus lies elsewhere in the current exercise. The rest of the chapter is organized as follows. Section 2 analyzes the model and states the results. Section 3 concludes. 9  For a general model on the theory of delegation see Holmstrom [28].  17  2.2  The Model and Results  We consider a model of collective choice with n + 1 agents where there are two alternatives to choose from. We will use the terminology of the jury models for the rest of the chapter. Following the common practice in the jury literature, we assume that the collective decision must be made about whether to convict or acquit a defendant.  The two social alternatives are  — C (Conviction) or A (Acquittal). There are two possible states of nature - G (Guilty) and I (Innocent).  A l l the agents would like to convict the  guilty and acquit the innocent under complete information. With incomplete information, two types of error may arise as a result of the decision - namely convicting the innocent and acquitting the guilty. The utility function for agent i, u (d,uj), where d € {C,A} represents the ultimate decision and l  OJ € {G, 1} is the state-of-the-world, is the following:  (2-1)  for i £ {0,1,2..., n} where q € (0,1). t  Agents 1, 2 , n are referred to as jurors and they are collectively referred to as the jury, J. The members of the jury share a common preference, that is qi — qj for a l H = 1,2,..., n. Each member of the jury gets a signal on the actual state of nature. We consider a binary signal structure. Each signal has two possible realizations: "guilty" (g) or "innocent" (i). The signals are partially informative. For each j 6 J, Pr(g|G) = Pr  = p with p > |.  18 With probability greater than | , each signal is correct.  We also assume the  signals to be conditionally independent. The common prior probability on the event u = G is IT for all agents. Generally speaking, the problem can be posed as a standard mechanism design problem. Type of juror j, tj, is private information and belongs to the type space Tj = {i, g}. Each juror sends a message to the mechanism designer and each juror's message is a function of his type, ij, i.e. m.j : Tj —> Mj where Mj is the message space for juror j. The mechanism designer sets a choice rule, F that maps the vector of messages into a decision. In other words, let M = M x M x • • • x M . Then, F : M —> 1  2  n  {C, A}.  Given any  F , each juror chooses her message to maximize her pay-off. The designer chooses F to suit her own preference. In the ongoing exercise, we refrain from analyzing the general mechanism design problem. We restrict ourselves to a particular class of mechanism namely the voting mechanism with single transferable vote. Each juror can cast only one vote in favour of one of the alternatives and then the decision is taken according to some monotonic or cutoff rule. In the language of mechanism design, we we restrict the message space for each juror to be binary, i.e. Mj = {C, A} and the choice rule to be monotonic in the number of messages of each type, i.e. if the decision is conviction for some number of C votes, it must be the same for any higher number. We also restrict ourselves to deterministic mechanisms only. Why do we analyze such a restrictive mechanism? Voting is one of the age-old practical mechanisms using which collective choice problems are resolved. One advantage of a voting mechanism is that it is easily imple-  19 mentable. Moreover, a voting mechanism with a single transferable vote has an ethical flavour and is often seen as a desired democratic practice. Thus it is commonly observed in real world and demands closer attention in its own merit. Social scientists are aware of its importance. Starting from Condorcet' in the eighteenth century, economists and political scientists have contributed significantly in analyzing voting mechanisms. Even in recent times, a large number of studies, using sophisticated mathematical techniques have discussed relative merits and demerits of different voting rules in optimizing 10  the social outcome (Austen-Smith and Banks [3]Feddersen and Pesendorfer [21, 22], Duggan and Martinelli [20], Martinelli [39], Meirowitz [42] and Wit [51]). Our attempt here is to contribute towards this growing literature when there is conflict of interest between the voters and the designer of the voting rule. We assume that the joint decision is taken by the jury J by playing a non-cooperative simultaneous move Bayesian game. After observing their private signals, each juror j 6 J takes an action Xj E {C, A} simultaneously and independently of other jurors. The action Xj = C is interpreted as a vote for conviction while Xj = A is a vote for acquittal. The individual votes are then aggregated into a decision d by a voting rule which is chosen by agent 0. Henceforth, we will refer to agent 0 as the "designer" with a preference One can think of more complicated voting rules rather than the simple cutoff rule we consider here. Borda count is one such rule where alternatives are ranked by the voters in order of preference and then the winner is chosen by summing over the ranks obtained by each alternative. In our case, however, this does not have any significance since we are in an environment with two alternatives. Scoring rule is another rule where each alternative is given a score instead of a vote by each voter and then aggregate scores are used to pick the winner. We however restrict ourselves to cutoff voting rules with single non-transferable votes 10  20 parameter qp w h i c h m a y or m a y not be different from qj. B o t h qj a n d qo are c o m m o n knowledge. T h e t i m i n g of the game is as follows. T h e designer first chooses the v o t i n g rule. T h e jurors t h e n play the v o t i n g game. T h e votes are then aggregated a n d the decision is reached according to the specified v o t i n g rule. L e t the v o t i n g rule R denote the m i n i m u m number of C votes required to convict. G i v e n a n y R, w h e n a l l voters vote informatively the j u r y ' s ex-ante payoff is the following:  V (R, n; qj) = - £  Q)  x P  (1 - p ) " " ' TT (1 -  ) - £ G) p ~ (1 - pf (1 - TT) qj n  9  j  z=0  x  x=R  (2-2) Suppose we denote R (n) s  (I-TT^J *  sn  o  ^  e x  = arg max/j V (R, n; qj) . W e also assume that  t r e m e i n either direction such that R (n) € { 1 , 2 , n } . s  A s . . A u s t e n - S m i t h ' a n d Banks[3]'have pointed out, R (n) s  is the unique rule  under w h i c h a l l voters vote informatively i n e q u i l i b r i u m . Informative v o t i n g by a j u r o r means that a juror votes for C i f and only i f he receives a signal g. T h e i n t u i t i o n b e h i n d this result is t h a t since R (n) is o p t i m a l , the jurors want s  to move the v o t i n g rule towards R ( n ) . Suppose R < R ( n ) . T h e n when s  s  all others vote informatively, i f a juror votes informatively the p r o b a b i l i t y of c o n v i c t i o n is higher t h a n what is o p t i m a l . Hence the j u r o r wants to rectify this by v o t i n g A irrespective of signal. A s i m i l a r argument holds for R > R (n) as well. s  Henceforth, we w i l l call R (n) the jury-optimal rule. O b v i o u s l y , since s  under the j u r y - o p t i m a l rule every juror votes informatively, information is fully aggregated a n d the ex-ante pay-off of the j u r y is m a x i m i z e d .  Now if  21 the designer's preference is the same as the jury's, the jury-optimal rule is optimal for the designer as well. But if the designer's preference is different from the jury's preference, the designer may have an incentive to distort the voting rule to suit her own preference.  Apparently, the pay-off maximizing  voting rule for the designer should be different from the jury-optimal rule which maximizes the jury's pay-off. We show that, quite surprisingly, the designer's optimal voting rule is not very different from the jurors for a very wide range of preferences of the designer. Before we proceed further, we consider the benchmark case where all private signals become common knowledge. For the jury J of size n, consider the decision problem when the signal vector s = (si, S 2 , s ) n  is common  knowledge. In this case, from the jury's point of view, the optimal decision rule is to choose C whenever Pr (G\s)  > qj and to choose A if Pr (G\s)  < qj.  W i t h private signals, whether a jury would be able to implement the full information decision rule above depends, along with other things, on the voting rule R. The following definition characterizes the voting rules that satisfy full-informational equivalence. D e f i n i t i o n 2.1. A voting  rule  R satisfies  full-information  exists  a Bayesian  Nash  Pr (d = C\o~j, s) — 1 whenever  P r (G\s)  a jury  of size  n if there  R  whenever aj  Pr(G|s) < q  Jt  is the equilibrium We  where  strategy  for jury  Equilibrium  for  a j such  that  > qj and P r (dn — C\aj, s) = 0  d^ is the decision profile  equivalence  under  voting  rule  R. and  J.  now establish a property of the jury-optimal rule that we will exten-  sively use in what follows. The jury-optimal rule under which every juror votes informatively in equilibrium satisfies full-information equivalence.  22  L e m m a 2 . 1 . The jury-optimal  rule  rule,  that satisfies  full  R (n), for a jury  J of size  s  unique  voting  information  Proof.  See Austen-Smith and Banks [3].  n is the  equivalence.  |  Since the jury-optimal rule satisfies full-information equivalence, the outcome of a voting game with n jurors and voting rule R (n) is the same as s  the decision problem where an individual juror has access to all n signals. The optimal decision for the individual juror will then be to choose C if the number of guilty signals out of n is greater than or equal to R (n). If the s  jury's relative cost of convicting an innocent defendant, qj, falls, the jury would require less evidence to convict. Hence, if private signals become comknowledge, the number of guilty signals out of n required to convict  mon  falls with qj. Therefore, for a fixed jury of size n, R (n) falls with qj. s  When the size of the jury increases, more signals are available. Hence, the optimal number of guilty signals required to convict changes for a given preference of the jury. In other words, R (n) changes with n. In the next s  lemma we show that R (n) changes at half the rate of change in n. s  L e m m a 2.2.  Proof.  For any n, R (n + 2) = R (n) + 1. s  s  Take any n. Since R (n) satisfies full-information equivalence s  \ V  l-pj  n-2R (n)+2  /i  s  \  >  \  TT(1 - QJ)  (l-n)qj  / >  I  \ V  \ l - p  n-2R (n) a  \  Similarly, V  l-pj  (n+2)-2fi (n+2)+2 s  ^ (\ - qj)  (  p  (1-TT)<7J  \ 1 - P  y  n + 2  )-  2 R  *( + ) n  2  23 By Lemma 2.1, we know that R„(ri)  satisfies full information equivalence  for all n. Now for all n, both set of inequalities are satisfied if and only if R ( n + 2) = R (n) + 1. s  |  s  So far we have restricted ourselves to characterization of the jury-optimal rule. We now turn our attention to the efficient equilibrium under any voting rule. Let a.; (SJ) denote the probability of voting C for juror rafter receiving the signal Sj. We say that a juror votes informatively in any pure strategy equilibrium if o~i (g) — 1 and a, (i) = 0. Given a jury of size n and the voting rule R, following McLennan [41], we know that there exists an efficient pure strategy equilibrium. Chakraborty and Ghosh [10] have characterized this efficient equilibrium. Generally, for any arbitrary voting rule, not all voters vote informatively in this equilibrium. Only a subset of voters vote informatively. The following proposition characterizes the efficient pure strategy equilibrium. Proposition 2.1.  are n informed  jurors.  in pure  strategies,  of their  signal,  Then,  a number  that  R (ma)  pure  strategies,  their  signals,  such  that R (ma)  s  if R < R (n), s  ma jurors  = R. If R > R (n), s  a number  [10], Persico  [46])  at the most  efficient  n - ma < n of jurors vote  ma jurors  vote  vote  informatively  at the most  n — ma < n of jurors  and the remaining s  and Ghosh  and the remaining  such  Proof.  (Chakraborty  vote  efficient  Assume  there equilibrium  Acquit  regardless  where equilibrium  Convict regardless  informatively  where  ma is in of ma is  + n — ma = R-  See Chakraborty and Ghosh [10].  |  Notice that given any voting rule there exist numerous Bayesian Nash  24 equilibria in the voting game with n jurors. The objective of this exercise is to characterize the optimal voting rule from the designer's perspective when the preference of the designer differs from that of the jury. There is an equilibrium selection problem here. An obvious choice is to select the most efficient equilibrium given any voting rule. We assume that the jurors are sophisticated enough to play the efficient equilibrium . 11  In the efficient equilibrium, not all jurors vote informatively. But those who vote informatively make sure that all the information used in equilibrium is efficiently aggregated: If m# jurors vote informatively in the efficient equilibrium given voting rule R, then the outcome in this efficient equilibrium is equivalent to the outcome of a voting game with jury of size m,R with the voting rule R (m#). Since jury-optimal rule efficiently aggregates s  information, this is outcome equivalent to the decision problem where the signals of the  rfiR  jurors are common knowledge.  The above argument shows that in the efficient equilibrium, the jurors adjust their equilibrium behaviour to offset the effect of a change in voting rule to suit their preference. Hence, from the designer's point of view, manipulating the voting rule amounts to choosing a jury of size m < n, with the effective voting rule R (m). s  By Lemma 2.1, this is equivalent to choos-  ing m number of signals when the decision is taken optimally according to the jury's preference. The designer's problem then boils down to finding a feasible m < n that maximizes her own ex-ante pay-off. Since we assume that the jury plays the most efficient equilibrium given any voting rule, by manipulating the voting rule from the jury-optimal rule, There is a coordination problem here. But we ignore that for the sake of comparison across equilibria of similar nature. 1 1  25 the designer effectively makes less information count towards the ultimate decision. As long as there is a possibility that the potential aggregate pool of information is decision relevant for the designer, this is a net loss. On the other hand, distorting the voting rule to suit her preference can only have a limited success, since the jurors vote strategically to suit their preference in the efficient equilibrium. On balance, the decrease in value resulting from the loss of information outweighs the gain from distortion in the voting rule for a wide range of preferences for the designer. A little discussion regarding the intuition behind Proposition 2.1 may be worthwhile here. If R > R (n), then, in equilibrium, s  satisfies R (m^) + n — s  TTIR  is such that it  = R.. If the voting rule is biased in favour of  A from the jury's point of view, some jurors vote uninformatively for C to rectify it. But this has to be done in a way such that the rest have exact incentives to vote informatively. That is possible if and only if the effective voting rule among the informative voters is the jury-optimal rule. On the other hand, if R < R (n), m,R must satisfy R (mn) = R, since the rest vote s  s  uninformatively in favour of A. Since, in our model, the designer only has R as the instrument to manipulate the decision in her favour, the equilibrium behaviour of the jurors puts bounds on the effective number of informative voters she can choose. We now turn our attention to the designer's payoff. Notice that our discussion so far has shown that by changing the voting rule effectively the designer can choose a smaller jury which votes informatively after strategically adjusting the voting rule to suit its preference. In some cases, the designer can induce completely uninformative voting by the jury in favour  26 of one of the alternatives. In other cases, she cannot induce uninformative voting by all.  We denote by V (m; qo) the designer's ex-ante payoff when a  m—member jury decides the outcome on the basis of voting rule R (m). We s  now  characterize an important property of V (m; q_<) which we need to prove  our  main result.  Lemma 2.3. Suppose V(m  n > 2. For any m < n, V (m; qo) > V (m — 2; qo)  + 2;q ) > V ( m ; q ) . D  Proof.  D  See Appendix A . l .  |  last lemma also implies that V (m + 2; qo) < V (m; qo) => V {m; qo) <  The  V (m — 2; qo).  Now suppose that the designer has to choose the size of the  jury, m, from the set TV — {no,no + l,...,n} with no > 0 where the decision is taken by the jury using the jury-optimal rule. As shown in the above lemma, the designer would effectively choose one of four numbers {no, n + 1, n — 1, n} to maximize her ex-ante pay-off. 0  There are two types of errors that may occur as a result of the jury's decision. One type of error arises because, for any finite jury, there is a positive probability of convicting an innocent defendant.  The other type  of error arises because of the possibility of acquitting a guilty defendant. The  preference parameter q , t = J or D captures the relative weights the t  agents attach to these two types of errors. Let p = ^ I " ^ be the relative t  cost of acquitting a guilty defendant for an agent of type t. This parameter p  t  indicates the effective preference of the agents. Intuitively, if p > 1, the agent t  is relatively more biased in favour of conviction which means he attaches more importance on the error arising from acquitting a guilty defendant. We will  27 state our comparative static results in terms of po and pj. The preference parameter for the jury, pj, determines the smallest size of the jury that will vote informatively. ((^ )  '  £  ) ^  0r s  o  m  e  n  ' *  n e n  a n  If pj falls outside the interval  y J y °^ u r  s l z e  n  o r  ^  e s s w  m  v o  ^  e  u n  ~  informatively for either C or A, depending on which side of the interval pj lies in. This happens because here all n signals taken together do not have any decision relevance for the jury. Hence, given pj, there is a lower bound on the size of an informative jury . 12  We now show that the designer will either prefer a jury which takes the decision completely uninformatively or one which almost fully utilizes the 13  available pool of information. Let m, denote the size of the jury that votes informatively, m = 0 indicates a jury that takes the decision uninformatively. L e m m a 2.4. The designer's  rn — n  —  Proof.  See Appendix A . l .  pay-off  is maximized  either  at m = 0 or at  1 or n. |  Lemma 2.4 provides some important insights towards understanding the nature of the solution for designer's problem. Either the designer wants to tap (almost) the total pool of available information or she does not want to utilize any information at all. This is a direct consequence of Lemma 2.3 which essentially proves that the designer's objective function is convex in T h i s lower bound can be equal to 1. If pj = 1, then even a single individual will have an incentive to vote informatively. Notice that as we have mentioned the designer only has one instrument - the voting rule - to affect the effective size of the jury. Whether she would be able to induce all the jurors to vote uninformatively using this instrument is a different issue that we will address later. 12  13  28  the number of signals. But, in our set up, the designer cannot choose the jury (or the number of signals utilized in the process of decision-making). She has only one instrument - the voting rule - which she can use only to affect the equilibrium behaviour of the jury. For ease of exposition of our main result, we will call any voting rule that is the same as the jury-optimal rule, or one off in either direction, a near  jury-optimal  rule.  In similar vein, we will call a voting rule near  unanimity  rule if it is the unanimity rule or one off from the unanimity rule. We show that the designer's optimal choice of voting rule is either a near jury-optimal rule or a near unanimity rule. We now formally define these two rules. Definition 2.2. Given  R£  any n, a voting  {R (n)-l,R (n),R (n) s  s  s  Definition 2.3. Given  any n, a voting  6  R is a near  jury-optimal  rule  R is a near  unanimity  rule if  + l}.  Conviction if R £ {n — 1, n} . Similarly,  rule for Acquittal if R  rule  a voting  rule  R is a near  rule  for  unanimity  {1,2}.  By varying the voting rule, the designer can affect the number of jurors who vote informatively in the efficient equilibrium. Our next lemma states to what degree the designer can affect this number and how it depends on the jury's preference. L e m m a 2.5. If pj 6 J ^ ^ , YZ^J i there 2  {1,2, ...,n} that  the efficient voting efficient  rule  can induce  equilibrium,.  completely  equilibrium.  not exist  uninformative  For any other  R G { 1 , 2 , ...,n} where  does  value  all the jurors  any voting voting  of pj, there vote  rule  R G  by all jurors exist  uninformatively  in  at least one in the  29  Proof.  For proving the first part of the lemma, we have to check that, at R =  1 and at R = n, at least one individual has incentive to vote informatively. If  PJ  i-p  G  P  v ' i—p  then R (1) = 1. Hence, from Proposition 2.1, at R = 1, s  a single juror has incentive to vote informatively even when all others vote uninformatively for A in the efficient equilibrium. Now consider R = n. Suppose n — 1 jurors vote uninformatively for C. That the other juror has incentive to vote informatively can be seen from R (1) + (n — 1) = n. s  For the second part of the lemma, it can be easily shown that for pj > y ^ ,  R. = n will induce completely uninformative voting by all jurors and for pj < -^p, R = 1 will do the same.  |  We will now state our main result in the next proposition. The proposition characterizes the efficient voting rule for the designer for different values of her preference parameter. P r o p o s i t i o n 2.2. Consider  which  decides  the outcome  under  any voting  a n-member by playing  the designer's  optimal  exists  the efficient  pure  a p(pj) > pj such  voting  PD > P{PJ) the designer's  ((^? )  ' (I^P)  £  strategy  )  equilibrium  rule  optimal  is a near voting  rule  that for po < p{pj)  jury-optimal is a near  rule unanimity  and for rule  Conviction.  2. For all pj < 1, there the designer's  optimal  PD < P{PJ) the designer's  for  with pj G  rule.  1. For all pj > 1, there  for  jury  Acquittal.  exists  a p(pj) < pj such  voting  rule  optimal  is a near voting  rule  that for pu > p{pj)  jury-optimal is a near  rule unanimity  and for rule  30  Proof.  We will prove the first part of the proposition. The proof for the  second part is similar and hence omitted. Since pj > 1, an uninformative decision by jury is C and hence V (0; q_>) = — (1 — 7r) qrj. Notice that if pp < 1 the designer will always prefer an informative decision to an uninformative one. By Lemma 2.4, then the designer would prefer an informative jury of size n or n — 1. Since the designer's relative cost of convicting the innocent defendant is greater than that of the jury, the designer will prefer a relatively higher threshold of conviction than the jury. If R (n — 1) = R (n), the threshold for conviction in an informative s  s  jury is stronger for the size n — 1 than for size n, since the jury of sizes n — 1 and n need the same number of g signals for conviction. Hence the designer will prefer a jury of size n — 1. By similar reason, if R (n — 1) = R (n) — 1, s  s  the designer will prefer a jury of size n. Now consider p_> > 1. We first consider the case where R (n) = R (n — 1). s  s  Notice that for the jury \ n-2R {n)  /  s  P  i-pj  ^  <  P  J <  It can be easily verified that V (n; qo) /  f  f  \  n-2R (n)+2 s  P  U - P  > V (n — 1; qo) if and only if po >  \n-2R (n) 3  in this case. For higher values of po, the designer is relatively  more concerned about convicting the innocent and hence would prefer an informative jury of size n to a jury of size n — 1, since the threshold for conviction is relatively higher in a jury of size n than in a jury of size n — 1 in this case. Now if the designer can induce completely uninformative voting by the jury in favour of conviction, then by Lemma 2.4, the optimal size of  31 /  \n-2R (n) s  informative jury is either n — 1 or 0 if p# < ( jr^ J  (A)  \  and either n or 0  n-2R (n) s  Suppose that the designer can induce completely uninformative voting by choice of voting rule. Lemma 2.5 identifies when this is indeed the case. Then, we can write V(n;q )-V(0;q ) D  D  Rs(n)-\ - 7 r ( l -  t  o  -(l-n)q  ,  Y_  )  UW-P)'  ( _)(;l-prp - + (l-ir)q n  n x  D  D  x=R (n) s  Rs(n)-1  (  ,1  x=0 ii (n)-l  E yp'a-pr^o ) E a o (i-p)v-  s  -7r(i- ) t o  7r(i-  _  /  n M  a  t o  _  , ,  \n-2fl (n) 3  That pi > ( )  can be easily verified by some simple algebra  If the optimal size of the informative jury is n. the voting rule R (n) can s  achieve it by Lemma 2.1. If it is n — 1, then it can be achieved by choosing the voting rule R (n) + 1. To see that this is indeed the case, verify that s  R (n - 1) + n - (n - 1) = R (n) + 1 since R (n - 1) = R (n). If pj > s  s  s  s  then by Lemma 2.5, R = n will induce the'jury to vote uninformatively in favour of C. Hence, p(pj) — pi will ensure that for p < p(pj),  optimal R  from designer's perspective is either R (n) or R (n + 1) and for p > p(pj) , s  s  32 optimal R is n. Now consider the case when pj < y ^ . By Lemma 2.5, there does not exist any voting rule that can induce uninformative voting by all jurors in efficient equilibrium. If po > 1, V (2;qo)  > V (1;<7L>) is ensured from  the fact R (1) = R (2) = 1 and the designer will prefer a relatively eass  s  ier threshold for conviction. Hence, the designer's effective choice of the informative jury is limited to three numbers {2,n— l , n } . Now for any PD,  V{2;q )  > V(0;q )  D  max {V (n; q ), V (n - 1; q )} > V (2; q ) by  D  D  D  D  Lemma 2.4. Hence, for any pp < pi, the optimal size for the informative jury is n or n — 1. For po > pi, the designer would be better off if she can induce uninformative voting by all members in favour of conviction, but the restriction on jury's preference makes sure that she cannot achieve this by manipulating the voting rule;. - Hence, the effective comparison for the designer is between choosing between an informative jury of size' n and that of size 2. Now, V(n  ] q D  )-V(2;q ) D  R (n)-1 a  /  a-*)fc> E  R (n)-1  x  y  s  a-p)v- -*(i-to) E x  [(l-7r)g p -7r(l2  D  > ~  ("Jp^-p)"  )(l-p) ] 2  t o  0 0  c  ^  (  o  n  M  C ) a - p r ^ - p  O P  Eto /  X  (I-P)  2  _  3  f  j  l  -(I-P)  \n-2H,('i)  That p2 > P\ > ( iT^j  c  a  n  be verified easily for any pj. We now  33 choose ,  P{pj)  We  /  = \ (  ifl<Pj<T^  P2(PJ)  Pl  P  if j > ^  ( j)  •  P  P  have already discussed that optimal voting rule for the case pj > y^;. If  PJ < y ^ , then optimal size of informative jury for the designer is n or n — 1 for  p£> < P2 ( j) • Hence, the efficient voting rule from the designer's point P  of view is R (n) or R ( n + 1 ) . s  s  For p  D  > p (/9j), optimally the designer 2  wants two jurors to vote informatively under the constraint that she cannot induce complete uninformative voting. This can be implemented by choosing a voting rule R = n — 1. To see this verify that R (2) + (n — 2) — n — 1 since s  R  s  (2) = 1. The proof for the case when R (n — 1) = R (n) — 1 is similar except s  s  that pi and p are now obtained by equating V (n — l;qo) with 2  V(0;qD)  and V (2; qu) respectively. The reason behind this is now a jury of size n has a relatively stronger threshold for conviction than a jury of size n — 1 and hence for high values of po the designer would prefer the jury of size of n — 1. Moreover, the designer can induce an informative jury of size n — 1 with the voting rule R (n) — 1. From Proposition 2.1, one member then votes s  for  acquittal uninformatively and the rest votes informatively. That this is  the efficient equilibrium can be verified by R (n — 1) = R (n) — 1. s  s  Combining the above two cases, we complete the proof of the proposition. PD > p{pj),  For  the designer's optimal voting rule is a near unanimity rule  and for D < p {pj) , the optimal voting rule is a near jury-optimal rule when P  PJ  >  1.  I  The meaning of the last proposition can be summarized as follows. If the  34 designer's bias is either opposite that of the jury or similar but close, the designer is best off by not distorting the voting rule too much from what the jury itself would prefer. Specifically, she would find it optimal to choose exactly the jury's own optimal rule, or a rule which differs from it by the margin of a single vote. For example, suppose the jury has an acquittal bias (i.e. absent any information, the jury would prefer to acquit). If the designer has a conviction bias, or an acquittal bias of similar magnitude, the best thing for the designer to do is to set a rule that attempts to (nearly) maximize the amount of information being utilized in the jury's decision. This is achieved by choosing the voting rule that the jury most prefers. Our analysis shows that the jury will respond to any distortions in the rule by contracting the amount of information used in the decision in a way that (almost) neutralizes the distortion. The designer, therefore, fails to influence the way the utilized information is aggregated into the decision, but simply induces a loss of available information. She is better off avoiding this pure information loss. The strategic considerations are dramatically different when the designer and the jurors have similar biases (say in favour of acquittal), but the designer's bias is much more extreme than that of the jury. For example, consider a situation where the designer ideally wants a much higher burden of proof to convict a defendant than the jury. In such situations, the designer may prefer to minimize rather than maximize the informativeness of the decision. Since, in the presence of little or no information, the jury leans the same way as the designer, she may want to exploit this feature and avoid a lot of convictions in marginal cases. It is interesting- to observe what kind of  35 rule achieves this. In the case of similar but very disparate biases (say both lean towards acquittal but the designer more strongly so), she can achieve informational shutdown by making acquittal very difficult,  i.e. by choosing a  rule that requires unanimity to acquit! Such a rule makes a single conviction vote too risky, and the jury responds by voting for acquittal, disregarding its information altogether. It is interesting to contrast this result against that of Feddersen and Pesendorfer [22], who pointed out some undesirable properties of the unanimity rule in jury trials. In particular, they demonstrated that the indirect strategic effect of changing the conviction threshold may outweigh the direct effect, to produce counter-intuitive results. In some circumstances, it may be more likely that an innocent person is convicted when conviction requires unanimity rather than simple majority. Feddersen and Pesendorfer [22], however, do not conduct explicit welfare analysis, which is a deficiency since these problems involve a trade-off between two kinds of errors (convicting the innocent and acquitting the guilty) and an increase in one kind of error can be more than compensated in principle by a decrease in the other. This is especially important when the designer and the juror's preferences are in conflict, which may prompt the former to manipulate the rule to suit her own objectives. Our results show that optimal manipulation is either (nearly) zero, i.e choosing the jury optimum rule, or maximal, i.e a near unanimity rule, which leads to the greatest information loss. Hence, unanimity is a salient rule in voting, in the sense that it is the preferred rule whenever  a designer finds it  optimal to manipulate the decision making process through her constitutional powers. A further surprising feature is that this happens in a direction that  36  is diametrically opposite to what first intuition may suggest. Again, consider the example of a legislature which may place a lot of weight on the welfare loss from wrongful convictions, but may be worried about juries being relatively trigger happy, i.e. willing to convict on a lower burden of evidence. Feddersen et al suggested that raising the bar by requiring unanimity for conviction may be counter productive. Our results show that if manipulation is useful at all, the pendulum swings all the way to the other end, i.e. the optimal rule is to make conviction very easy, by requiring (near) unanimity for  acquittal]  Analogously, liberal minded constitutional designers (i.e. those receptive to change) may want to create highly conservative constitutions, requiring strong consensus to vote for change, and vice versa.  2.3  Concluding Remarks  We investigate a model where the decision making is delegated to a group of individuals with disparate information but common preference. The group arrives at a decision using a voting mechanism where the voting rule is chosen by a designer who may have conflict of interest with the group members. The designer faces a trade-off between choosing a rule that leads to efficient information aggregation and a rule that suits her own preference. We show that the designer resolves this trade off by going to one of the extremes. In other words, either she chooses a rule that almost fully aggregates information or a rule that uses almost no information. We provide a full characterization of these two cases based on designer's preferences. We show that if the designer and the group have opposing biases in favour  37 of one of the alternatives, then the best voting rule for the designer is nearly the one that is best for the group. If, on the other hand, the designer has similar, but relatively stronger, bias as the group for one of the alternatives, the optimal rule is one which requires near-unanimity for the favoured alternative. Intuitively, this gives the group greater incentive to vote for the designer's favoured alternative uninformatively (since the group has similar bias, it will vote in favour of the designer's preferred alternative when it is voting uninformatively). We conclude by noting that for a wide range of preferences for the designer, the optimal voting rule is almost independent of the designer's own preference.  38  3. Information Aggregation in Multi-round Elections 3.1  Introduction  Voting is the most common way in which social choice problems are resolved. However, if voters have noisy private information about the possible consequences of various choices, usual (simultaneous) voting procedures fail to aggregate that information efficiently. This is most clearly seen in a model in which voters have identical preferences but different information . The de14  centralized voting outcome is usually not informationally  efficient—welfare  would increase if a central planner could (costlessly) collect everyone's information and implement a decision. Of course, this is only an ideal benchmark. In reality, for a planner to collect accurate information from thousands or millions of people is an exercise fraught with incentive and free-rider problems, to say nothing of administrative costs. A decentralized mechanism is, therefore, more or less a practical necessity. Hence, the search for better (yet practical) decentralized mechanisms is an important one for social choice I t can be argued that generally the voters will have both private information as well as heterogeneity of preference. Nevertheless, the pure common interest case serves as a useful theoretical benchmark. 14  39 problems. A significant number of theoretical and experimental studies, particularly in the context of jury trials, have tried to analyze this issue both in common interest elections and in the presence of some degree of heterogeneity in preferences.  Ladha [33], Miller [43], Feddersen and Pesendorfer [21, 22],  Duggan and Martinelli [20], Wit [51], Ladha, Miller and Oppenheimer [34] represent just a small sample of recent literature. The problem of aggregating information arises because in a simultaneous voting two-alternative election, voters condition their votes on being pivotal given the voting rule. Austen-Smith and Banks[3] show that sincere  voting  15  is not an equilibrium behaviour in general. Although for a binary signal structure, full informational efficiency can be achieved in a Nash equilibrium by properly choosing the voting rule, this is not true for a richer signal space. In a binary signal case, sincere votes can reflect the realized signals of the 16  electorate and, if the voting rule is optimally chosen, one can achieve the central planners outcome. But this is not true when the signal space is rich enough so that voters cannot mimic their signals just by using their votes. The obvious way to resolve this problem is to introduce pre-play communication by allowing players to exchange messages prior to actual voting. With perfectly aligned (or even almost common) interests, all private information will be revealed, and then players will vote unanimously to achieve the informationally best outcome. But communication may not be feasible in all elections. Moreover, to achieve informational efficiency through comSincere voting is the voting behaviour in which each voter chooses the alternative yielding the highest expected payoff' conditional on her private signal. W e consider the case when sincere voting is informative, i.e. each players vote depends on the private signal. -. ~ 15  16  40 munication, the message space has to be sufficiently rich so that players can convey their signals by their messages. Arbitrary communication mechanisms cannot achieve this end. Coughlan [13] examined a straw vote as a means of communication and showed that full informational efficiency can be achieved for any voting rule. But again this result holds only for binary signals and it fails as soon as the signal structure is more complicated.' Doraszelski, Gerardi and Squintani [19] and Gerardi and Yariv [23] study voting behaviour when voters can communicate using a sufficiently rich message space which allows the voters to imitate their signals. But direct pre-play communication is often costly, particularly if the size of the electorate is large enough. Moreover, any mechanism that attempts to resolve a collective choice problem has greater appeal if it is indirect and easily'implemeritable. Full pre-play communication between the players even in a medium size election is often too much to ask for. What happens if direct communication is not feasible before voting? Chakraborty and Ghosh [10] showed that for conditionally independent signals full information equivalence can be achieved for any voting rule that allows divisibility of individual votes. This chapter attempts to provide an alternative mechanism that can improve the voting outcome significantly. At first glance, it seems that instead of simultaneous votes, some kind of sequencing of the voting procedure could lead to better results, by allowing later voters to draw inferences from the votes exercised by those who preceded them, and thereby vote in a more informed way themselves. However, Dekel and Piccione [16] have shown that this intuition is generally not true. Under sequential voting, the set of equilibrium outcomes remains the same  41 as under simultaneous voting. Callander [9] examines a model where voters obtain positive utility from voting for the winning candidate and finds that superiority of the voting procedure depends on the value of the common prior. Morton and Williams [44] compare between simultaneous and sequential voting outcomes empirically. All of these papers, however, consider rules that require the sequence in which the electorate must vote to be exogenous. This undoubtedly has practical relevance, as roll-call voting is often observed in reality, particularly in legislatures. The  equivalence result of Dekel and Piccione, though, crucially depends  on the requirement of exogenous voting sequence. One can easily imagine, and perhaps design, voting procedures which allow voters more flexibility with respect to timing. This allows the possibility of learning the private signals by the later voters. In the context of private investment decision, Chamley and Gale [11] examine how social learning can affect the behaviour of late investors, and thus induces strategic delay for better information. In this chapter, we take a similar approach in a collective decision setting. We consider a multi-round voting procedure in which each voter can exercise her vote in any one of several successive rounds. After each round, voters receive information about the votes that have been cast in previous rounds. We show that if voters have identical preferences, there always exists a perfect Bayesian equilibrium which aggregates all the information into the decision efficiently. Moreover, if the model is symmetric, there is a symmetric  equi-  librium which achieves this end. The basic intuition is that each voter can convey information to others not only through her choice, but also the  timing  of that choice. Those with relatively strong information can vote early, while  42 those with relatively weak information wait to see how things unfold. The following example clarifies how it works. We construct a very simple example that may help in indicating how multi-round voting can improve efficiency of the outcome over simultaneous or Dekel and Piccione type sequential voting with an exogenous sequence. We consider a 3-voter binary election where the choice is between alternative  (A)  and status-quo (Q).  Each voter can get one of the three signals —1,0  or 1. The signal 0 is interpreted as a completely uninformative signal while the signal 1( — 1) is a strong, though imperfect, signal in favour of A(Q).  The  prior on A is such that the efficient outcome is the following: ,  d*(9) = Affi0e{  (1,1,1),(1,1,0),(1,1,-1) (1,1,0),(1,0,-1),(0,0,0)  where 6 is the realized signal vector and d* (8) is the collective decision. A wins if there are at least two votes in favour of A. If voting is simultaneous, the voting strategy of player i is a function  Si : 0; —-> {A,Q}  where 0j = {1,0, —1} is the set of signals that player i  can receive. Now, if in any symmetric equilibrium of the simultaneous voting game d(0,0,0) = A, then for this equilibrium strategy profile d(Q, 0, —1) = A. This outcome is clearly inefficient. Let us consider a sequential voting procedure for the above example when the voting sequence is exogenous. Without loss of generality, we consider voter 1 as the first round voter. The voting strategy of voter 1 is still a function Si : 0 i — • {A,Q} , but for players 2 and 3, voting strategies depend oh the history of the game. For later players who vote in rounds 2  43 and 3, the voting strategy is s| : ff' x 0; —• {A, Q}, where H is the set of l  all possible histories prior to period t. We will consider monotonic strategies. Voter 1 plays one of the following two strategies: A  if 9i = 1 or 0  Q  or  Suppose voter 1 plays s\. If 9\ = 1 is followed by 0 = 0 and # = —1, then 2  3  for the outcome to be efficient at least one among voters 2 and 3 have to vote for A since d*(l, 0, —1) = A. Now suppose 6i — 0 is followed by # = 0 2  and (9 = — 1. Voters 2 and 3 now face the same histories and private signals 3  and therefore vote similarly. Hence, A still wins although d*(0,0, —1) = Q. A similar inefficiency can be shown to exist if voter 1 plays s in equilibrium. 2  In the game with flexible timing, the existence of a symmetric efficient equilibrium is easy to show. Only two rounds of voting are needed. In round 1, each player has three actions to choose from — A,Q and W, where W stands for waiting in round 1. After round 1, the vote tallies in favour of A and Q become public knowledge and round 2 voters condition their vote on the history. Suppose (m^.m^) denote the number of votes in favour of A and Q respectively after round 1. The following strategy now constitutes an  44 efficient symmetric equilibrium: A  s\ = { Q  if 1 if - 1 if 0  and  t  A  if (1 - 1)  A  if ( 1 - 0 )  A  if ;(0 - 0)  Q if ( 0 - 1 ) V where s is the action chosen by player i in round t. These strategies generate 2  :  efficient outcomes for all possible signal realizations. After round 1, the private signals become common knowledge and the later voters vote to ensure the efficient outcome. Since voters have common preferences and information is aggregated efficiently, these strategies constitute an equilibrium. What would happen if the preferences are diverse in a voting game with flexible timing? This will be a more difficult question to answer since even with pre-play communication the voters will have incentive to strategically withhold private information, fn Section 3 of this chapter, we show that the multi-round voting mechanism may work in environments with diverse preferences as well. This mechanism achieves precisely what single round pre-play communication or a straw vote like opinion poll can achieve. But unfortunately we don't have a general relationship between the set of equilibria of the voting game with communication and the set of equilibria of the voting game with flexible timing. We conjecture that there would be a  45 strong connection between the set of equilibria with unrestricted communication and that in the flexible timing game. But proving it is an agenda for further research. When the size of the electorate is very large, the probability of a single player being pivotal is almost negligible and the notion of strategic voting does not have much appeal. Also communication among the electorate is almost impossible. On the other hand, in very small elections, it's hard to believe that players are anonymous and cannot talk prior to voting. This gives players access to unrestricted communication. So our model is mostly applicable in medium-sized elections where communication is costly. Possible examples can be election of faculty council or vote on some agenda by the residents of a medium sized city. We conclude that mechanisms that allow for a more flexible choice of timing could substantially improve the efficiency of collective decisions. A common example of a sequential voting procedure is the roll-call voting often observed in legislative voting. However, in roll-call voting, voting sequence is exogenous. Hence, given the pivotal voter argument, the scope of the later voters to learn some extra information from the actions of the earlier voters is limited. We, on the other hand, allow voters to choose the timing of their votes thus allowing the earlier voters to convey their private information to the later participants. In a different context, the papal election in Vatican proceeds in multiple rounds. In the papal election, there is no restriction in the number of candidates. Each voter from the College of Cardinals votes in the first round. If one candidate gets two-third majority in the first round, then he wins. If  46 nobody gets the required majority in the first round, voting proceeds to the next round and the same procedure is repeated. The election mechanism used in the papal election, while not being the same as what we propose, has a similar flavour. After a round of voting with no clear winner, each voter updates his information using the voting history before the next round of ballot takes place. We essentially ask a normative question in this chapter. We suggest an election mechanism where voters at each stage can update their information from the voting history of the preceding stages. Moreover, by strategically choosing their timing, they can now convey their private information to others if they so desire. We seek to examine the efficiency implications of such a mechanism and it turns out that a multiround voting mechanism does a pretty good job in aggregating disparate private information of the voters. The chapter is organized in the following way. Section 2 describes the model and the results when preferences are aligned. Section 3 discusses an example with diverse preferences and shows the connection between the set of equilibria with communication and that with flexible timing. Section 4 concludes.  3.2  The Model with Common Interest  A group of n voters must choose from among two options—the status quo (Q) and the alternative (A).  The state-of-the-world can also have two values, Q  and A. All voters have common preferences captured by the utility function  u(d,u),  where d G {Q, A} represents the voting outcome and u> is the state-  47 of-the-world. We assume  u(d,u)=<  —q  if d = A, UJ = Q  -(1-q)  iid = Q,uj = A ••  I 0  (3.1)  otherwise.  Voter i receives a private signal Oi G 0j. Let 8 = 9 i x 0 x ... x 0 , with 2  n  9 being a typical element. We assume that the number of elements in 0j is finite. Let  J(9\UJ)  denote the probability of realization of the signal vector 9  if the true state is UJ. The prior on the event UJ = A is ir. The voting rules are as follows. The alternative A is selected if the final vote tally in favour of A is k or more. Otherwise, Q is selected. Voting proceeds in T successive rounds. Each voter has a single, indivisible vote, which she must cast in favour of either Q or A in any one of the T rounds. Thus in rounds 1,2,...,T — 1, a voter who has not previously cast her vote must choose from a set of three alternatives: {Q, A, W}, where W stands for "wait till the next round." In round T, the set of options is simply {Q, A}. Votes, once cast, cannot be changed subsequently. In general, let X\ denote the set of options available to voter i at date t. If i has exercised her vote before, we adopt the convention that X\ = {W}. While each voter's signal is private information, the actions of all voters in each round become common knowledge before the next round . Voter i's 17  Since we are interested in environments in which voters cannot directly communicate with each other; the requirement that they are able to observe the actions of all other voters after each round may seem restrictive. However, in the symmetric case, all that is necessary for our results is that voters be able to observe some relevant summary statistic of other voters' actions, e.g. the aggregate number of votes cast in favour of either alternative after each round. . , . 17  48  history up to round t, denoted by h\, is the sequence of actions taken by i in rounds 1, 2 , t . Let h be a vector of histories of all players, and H the l  l  set of all possible histories up to round t, with H° = <£>. A (pure) strategy Si for player i is then a collection of mappings s\ : H " x Gj - — > X\ for 1  1  * = 1,2,...,T. The above discussion describes a well defined Bayesian game. We focus on perfect Bayesian equilibria (PBE) of this game. Before proceeding with characterizing equilibria, it is useful first to define a. benchmark.  Suppose that all players' signals were common knowledge.  Then, voters will have a common posterior defined by Bayes' rule as follows:  --  :  ^ = "  ~ « w ^ w - m ^ Q )  m  '  (3 2)  Let d*(9) denote the optimal choice, given the entire vector of signals. Clearly d*(9)  — A  7(0) > q  (3.3)  every profile of strategies s in the voting game, and for every realized  For  signal vector 9, we can define d(s, 9) E {Q, A} as the outcome induced by s. D e f i n i t i o n 3.1. A strategy  d(s,9)  - d*(9)  profile  s satisfies  full information equivalence if  for all 9 G 0.  Finally, denote by m„ the number of elements in 0j, and let m = m a x i m j . We are now ready to state the main result of the chapter. i6  T h e o r e m 3.1. Suppose  Bayesian  equilibrium  T > m. Then s" of the voting  there  game  exists which  a pure satisfies  strategy full  perfect information  49 equivalence.  Proof.  To prove this result, it is enough to show that there exists a strategy  profile which achieves full information equivalence.  A useful property of  common interest games is that the profile of strategies which maximizes the common payoff function is immune to individual deviations, i.e. constitutes a P B E . Hence, if full information equivalence is feasible, it is achievable in 1 8  equilibrium. Demonstrating the existence of such a strategy profile is extremely simple. Consider the strategy profile sas follows. Divide the voters into three subsets: T  —  A  {1, 2 , k — 1},  TQ  = {k,n-1}  and T = {n}. Let n (h ) l  A  V  and  UQ^I ) 1  be the number of votes cast in favour of A and Q respectively under history  h.  Also, let Qi = { 1 , 2 , ...,m.J. For i e I  l  A  3  A  a t= e  W  if t < m and t ^ 0  Q  \it = m + l,n {h )  A  \it = m + l , n { h )  Q  if t = m + l,n i(/i ) < k - \,n (h})  Q  otherwise  l  {  t  <k-l,n (h )  < n - k  =k-l,nQ(h )  < n - k  t  A  Q  t  t  A  t  /  See McLennan [41] and Chakraborty and Ghosh [10].  Q  =n- k  (3.4)  50 Similarly, for i 6 TQ Q  if t = 9i  W if /, < m and /. ^ 0* Q  if t = m + l , n ( / i ) < fc - l , n ( / i ) < n - fc  A  if /, = m + 1, n ( ^ ) = A; - 1, n (//, ) < n - k  Q  . if t = m + 1, n ^ / i ' ) < /c - 1, n (/i ) = n - k  Q  otherwise  t  t  /t  Q  (3.5)  f  A  Q  t  Q  Finally for i € T  V  w if t < m A  if t — m + 1, n ^ / i ) = A; - 1, nQ(h})  =n— k  4  and Pr [w = A | s _ h , 6i] > q l  i;  Q  S*(O0  if t =TO+ 1, riAih )  = k - 1, n q ^ )  1  — n - k  (3.6)  and Pr [u> = A|s_i, h', 0,] < g A  if £ =TO+ 1, n ^ h ' ) < k - 1, nQ(/i ) < n - k  A  if f =TO+ 1, n (/i ) = A; - 1, ng(/i ) < n - k  Q  \f t — m + I, n (h )  A  otherwise  f  t  t  i4  l  A  < k - 1, ng(/i') = n - k  Since the first fc — 1 voters vote for /I, and the next n — k voters vote for Q regardless of their signals, the last voter is always pivotal along the equilibrium path of play. Although the first n — 1 votes are independent of the signals, their timing  bears a one-to-one correspondence with the signals.  Hence, voter ri can infer the signal realizations of all preceding voters, by date  t = m+1. Since the last and pivotal voter votes optimally with respect to her  51  equilibrium information, the outcome satisfies full information equivalence. Since the equilibrium payoff is maximum that a voter can get in the above game, these strategies are immune from individual deviations under any set of off-the-equilibrium beliefs. We adopt a particular set of off-the-equilibrium beliefs and strategies, but many other specifications would work as well. In words, it can be described as follows. It is common knowledge that there has been a deviation if one of the non-pivotal voters hasn't voted by date m. Assume that the votes of others will be interpreted as if they have played in accordance with their equilibrium strategies, and the votes of those who have waited will be seen as uninformative. Further, at every date after it becomes clear that a deviation has taken place, everyone must simultaneously vote in favor of Q, unless there is an unanimity required among the remaining voters to adopt Q, in which case they simultaneously and unanimously vote for A. If there is a single voter left, she votes for whichever outcome she sees as optimal, given her beliefs at that point. Since, as long as there are two or more voters left, no voter is pivotal under this construction, every voter plays a best response.  |  Since we are interested in environments in which voters cannot communicate and exchange information directly, the relevance of the above formulation may be called into question for two reasons. First, it requires voters to have individual specific information about each voter's actions in the previous rounds. This may seem' too strong a requirement. It may be more reasonable to assume that voters get information about aggregate vote tallies from the past rounds, not who voted and who abstained. Second, it is  52 clear from the strategy constructed above that the partition of the set of voters, including the identity of the last and pivotal voter, is arbitrary—any permutation would work just as well. In other words, even if voters are ex ante identical, they must play asymmetric strategies based on a pre-specified partition that could be selected in many different ways. This requires solving a complex coordination problem which seems both unrealistic and incompatible with the assumption of lack of communication. Nevertheless, our next result shows that in a symmetric model, subject to a mild condition on the joint distribution over signals being satisfied, it is possible to construct a  symmetric  strategy profile which successfully aggregates all the information.  Henceforth, suppose each.player could receive one among m.signals, so that,©; = { 1 , ' 2 , m } .  The probability distribution f{9\u)  is symmetric  if  the value of the function is the same for any permutation of the components of 9. f(9i, 9-i\u)  is monotonic  if ^ ' ' ^ [ Q ] is monotonic in Oi for all  € 0_j.  Without loss of generality, we assume that ^ " ^ ' [ Q J is increasing in 9 . %  T h e o r e m 3.2. Assume  and monotonic. satisfies  full  Qi = {1, 2 , m } for alii,  IfT > rn, there information  is a symmetric  and f(9\u)  PBE in pure  is strategies  symmetric which  equivalence.  Before proceeding with the proof, a few definitions and preliminary results need to be established. Consider any subset of I voters and a subset 0 ' C 0 of signals. Let 0J denote the product space of signals received by I members, each signal being drawn from the subset 0'. Let 9 denote the highest signal in 0 ' and 9 the lowest. Let ©'(r) denote the subset of 0' such that each member consists of at least r highest (i.e. 9) signals and the remaining arbitrary. Similarly, let 0'(r) denote the subset of 0' such that each member  53 consists of at least r lowest (i.e. 9) signals and the remaining arbitrary. Define %r;l,G')  =  min (6>) 7  (3.7)  7  (3.8)  flee (r) 7(r;i,e') = max ( 0 )  —  eee'(r)  Let  f? /_ € 0{ denote a signal vector that consists of ,s number of 9 signals  and  I — s number of 9 signals. Due to monotonicity, it follows that  S]  s  7(r;f,e') = 2 ( l - r ; l , & )  =  7  (^-r)  further, ( r ; Z, 9 ' ) is increasing in r, while ( r ;  and  7  Proof,  7  6 ' ) is decreasing in r.  (of Theorem) We can now complete the the proof of the theorem.  Consider the first round. Either j(k;n,  O) > q or 7(71 — /c + 1; n, 0) < 9.  Suppose f(k; n, 0) > q. Then, let all the voters who received a signal m vote for A in this round, and the remaining choose W. If the outcome is decided by these votes straight away, that means at least k voters must have received the signal m. In that case, the updated posterior on the state being A, conditioning on the entire vector of signals, is bounded below by  j(k;n,Q)  > q. Then the decision is efficient, regardless of what the other  signals are. On the other hand, if the number of votes cast is less than k, the game proceeds to the next round. If j(k;n,  0) < q, then the strategy is to  vote for Q in the first round if a voter has received the signal 1, and to wait otherwise. Suppose, after application of these first round strategies, the result of the  54 election is still undecided, so that the game proceeds to round 2. Exactlysimilar strategies can now be constructed recursively. Notice that since the number of voters who voted in the previous round, as well as their signals (through knowledge of their strategies) is commonly known, all remaining voters can update their beliefs over the states accordingly. The subgame beginning with round 2 is exactly similar to the initial game, only with a reduced set of players (after eliminating those who have already voted), a reduced set of possible signals for each, an updated prior as well as probability distribution over signals, and a new threshold of votes necessary for each alternative to be chosen. The same exercise as in round 1 can be applied to this subgame to construct round 2 strategies after every possible history. This recursive method can last at most m steps before it yields an outcome, and by construction, the outcome is efficient whenever the process stops. More formally, after any history h , let n(h ) be the number of voters t  t  left, 0 (h ) the reduced set of possible signals, and k((h ) t  t  maining votes needed for A to be chosen. Either j(k(h ); t  j(k{h );n(h ),e(h )) t  if j(k(h );  Now  t  n(h ), t  < q. Let 9 (h ) = max6(/i ) and 9(h )  t  t  the number of re-  t  n(h ), t  Q(h )) t  t  t  Q{h )) t  > q or  = min0(/i ). t  > q, let all the voters who receive signal 9 (h ) t  vote for A, and all the others who didn't cast their votes in any of the previous rounds choose W. If j[k(h )-,n(h ).Q(h )) t  9_(h ) t  t  t  < q, voters who receive  vote for Q and wait otherwise. This strategy ensures that after any  history h , if the outcome is decided, then it is efficient. Since, as a result of t  this strategy profile, the best outcome is reached, this is a perfect Bayesian equilibrium'. The  |  following example clarifies how the process described above works.  55 We consider a simple voting game where n = 3, 0 ; = {1,2, 3} and outcome is decided by majority rule in favour of A, i.e. k — 2. Case I: 7(3,3,1) > q Anyone with signal 3 will vote for A in round 1. If the outcome is decided in the first round then it is efficient independent of the signals of the later voters, since 7(3,3,3) > 7(3,3,2) > 7(3,3,1) > q by monotonicity. Otherwise, there are two possible histories at the end of round one: (i) one vote for A from which the later voters can perfectly infer that there is one 3 signal; (ii) zero vote for A. fn case of (ii), there are now only four possible signal realizations : 19  {2, 2 , 2 } , { 2 , 2 , 1 } , { 2 , 1 , 1 } , { 1 , 1 , 1 } .  If 7(2, 2,1) > q, all with signal 2 vote for A in round 2. Again if the outcome is determined, then it is efficient. If not, then in the last round the remaining voters know the exact realization of the signal vector and vote accordingly. If 7(2, 2,1) < q, all with signal 1 vote for Q. The same argument as above shows that outcome is efficient. In case of (i), there are three possible realizations of signal vector:  {3,2,2},{3,2,1},{3,1,1}.  Now the number of votes required for A to be chosen is one. If 7(3, 2,1) > q, voters with signal 2 vote for A in round 2. If 7(3, 2,1) < q, voters with signal 1 vote for Q in this round. The outcome is efficient by similar reason as in Because of symmetry, the permutations of signals canbe ignored.  19  56  (ii). Case II: 7(3,3,1) < q Anybody with signal 1 votes for Q in round 1. Outcome is efficient if decided in period 1. If it is still undecided, similar strategy as in Case I will generate efficient outcome.  3.3  Diverse Preference  In this section, we will try to explore the effectiveness of our mechanism in a situation where people's preferences may vary. Even when preferences vary, each player has incentive to make the best informed choice-and hence to share their private information. On the other hand, since interests can be conflicting, revealing one's private information completely may prove too costly. These two opposing incentive will lead to some revelation of private information in equilibrium if communication between the players are permitted. Doraszelski, Gerardi and Squintani [19] (henceforth DGS) have studied this situation in a two voter binary signal model. In their model, prior to the voting stage, the players may communicate using a straw vote to send messages to other players. This takes the form of an opinion poll prior to voting. In our case, we do not allow people to communicate among each other. In stead, we use the indirect mechanism of multi-round voting where voters get to choose the timing of their votes. We will show, using the same model as DGS, that the best equilibria in their model with communication can be easily replicated using our mechanism. As we have already shown in the earlier sections of this chapter, when interests are completely aligned,  57  multi-round voting achieves what unrestricted communication can do as an equilibrium outcome. The purpose of this section is to show that the usefulness of our mechanism is not restricted to the special case of common interest. This mechanism can substitute for pre-play communication under more general circumstances. We use the same model as in Section 3.2 except that we now have only two voters and voters may differ in their relative concerns for two types of errors that may occur as a consequence of a wrong decision. A player of type q has the same utility function as in equation [3.1]. Types are private information, but it is common knowledge that each type is an i.i.d draw from a distribution F with domain (0,1). F is continuous and strictly increasing. We assume that players are not extreme types where they completely ignore one types of error. Each player i receives a private signal s» G {0,1} which is related to the state of the world: Pr (SJ = 1|A) = Pr (s; = 0\Q) = p G ( | , l ) . The signals are conditionally independent. Voting proceeds in two rounds . After the 20  first round, voting history is revealed to anyone who decides to vote in round two. Finally, conviction requires unanimity . 21  We begin by discussing the equilibria of the game with communication. Both the players can exchange messages prior to voting. There always exist some equilibria where players ignore the messages completely and the game proceeds just like a pure voting game. These equilibria are called babbling equilibria. We ignore this class of equilibria. We concentrate on the set Since in this section we are restricting ourselves to a binary signal space, we need just two rounds of voting. The restriction to a particular voting rule is to ensure that we are using the same model as DGS. 20  2 1  58 of Perfect Bayesian equilibria in cutoff strategies that do not admit weakly dominated strategies. It can be shown that all the Perfect Bayesian equilibria of the communication game are outcome equivalent to the set of perfect Bayesian equilibria in cut off strategies . 22  Not  all cutoffs are necessarily identified by sequential rationality or weak  dominance. In the case an action by any of the player affects the final decision, the cutoffs are uniquely identified across signals by a family of functions  ™>  { 1  -  p )  2  q  +  p  2  { 1  _  defined on (0,1). Note that k' (q) > 0 and k(q)  q )  < q for all q. The equilibria robust.  which admit cutoff strategies thus related across signals are called  Moreover, in equilibrium, each player conditions her vote on her preference parameter q, the signal she receives s, the message she sends m and the message she receives M. These equilibria are called responsive.  Finally, we  consider only the set of symmetric PBEs. The equilibrium profiles are identified by the cutoffs q and q M s  with  sm  s € {0,1}, m € {0,1}, and M £ {0,1}. This means that a player of type q sends message m = l(m = 0) after observing signal s if q < q (q > q ), and s  s  that a player of type q votes v = A (v = Q) after observing signal s, sending message m, and receiving message M if q < q M  (<? >  P r o p o s i t i o n 3.1. (DGS) There  of responsive  sm  exist  three  classes  qsmM)robust  equilibria: Class 22  0: q < q io < Qsoo < Qsii = QsOi for s £ {0,1}; s  s  See DGS [19] for a detailed discussion.  .  cutoff  59 Class  1: q  < q io < Qs < Qsii < QsOi for s e  {i,g};  Class  2: q  <q  {i,g}.  There  does  not exist  s00  s  s00  sl0  =q <q s  = q oi for s e  sll  s  a responsive  robust  cutoff  equilibrium  in any other  configuration. For cutoff equilibria  any class,  the smallest  cutoff  in s = 1 and the two sets of cutoffs of class  0 are outcome-equivalent  in s = 0 is larger are separated to the equilibria  than  the  largest  by |. Moreover,  the  of class 1.  This proposition is directly taken from DGS [19] with some minor changes to make it compatible with the notations of our model. The proof is omitted and can be found in DGS [19]. It can also be shown that class 0 and class 1 equilibria are ex-ante Pareto superior to class 2 equilibria. We will show that any class 0 equilibrium is outcome equivalent to a Perfect Bayesian equilibrium of the multi-round voting game. We now turn to the equilibria of class 0. Figure 3.1 illustrates the equilibrium behaviour. For each interval, the first column reports the path of play of the type when she has received the signal s = 1 from nature, and the second column, the path after the signal s = 0. The first row identifies the message sent. The second row refers to the vote. When a type conditions her vote on her opponents message, we first present the vote after receiving message M — 1 and second the vote after M = 0. The cutoffs described in the above proposition for class 0 equilibria are defined by the following set of equations [19]:  60  Qo  9ooi <7on  low 9ooo  <7i  gin 9ioi  9no 9ioo  1  1 1  1  1  0  1  0  1  0  0  0  A  A  A  A  A  A Q  A  Q  A  Q  0  0  A Q Q  0  Q  0  Q  Figure 3.1: Equilibrium path of play for class 0 equilibria in DGS and q  s  m  -, , D W F M - % ) ) + ( F ( t ( w ) ) - F [ t h , ) ) ) l  0  ^  ^ - ) 3  1 0  -[(F(q )-F(q ))+R{F{k(q ))-F(k(q )))]  n  sm0  B  am0  s  and, finally,  q s  n , i fl(F(g.mi)-F(g„»o))+(F(fc( , i))-F(fc( ?  1  ^  g  m  gjm0  )))  I 3  1 1  )  -(F(q )-F(q ))+R(F(k(q ))-F(k(q )))  n  smi  5m0  sml  sm0  for s £ {0,1} . ft should be noted that other configurations of equilibrium cutoffs are possible. We select this class of equilibria since this is ex-ante Pareto efficient as shown by DGS. Coming back to the analysis of multi-round game, we will try to find a symmetric Perfect Bayesian Equilibrium in cut-off strategies. Since d = A  61 requires unanimity, any voter who votes for Q can do so in round two. A single voter can decide the outcome in favour of Q. Hence, a Q voter loses nothing by waiting in round one. We consider an equilibrium in the following symmetric cutoff structure. A player with signal s G {0,1} will vote A in round one if q < q . Otherwise, s  the voter waits. A waiting voter can face two possible histories in round two: (i) h° - 0 votes cast in round one and (ii) h) - 1 vote cast in round one. Confronted with history h ,n E {0,1} , a voter with signal s will vote A in n  round two if q < q . sn  For the above cutoff strategies to be an equilibrium, q < q must hold s  s n  for n e {0,1} and s E {0,1} . In round two, voter i will vote A if and only if Pr [A|pit>, h . Si] > qi. Hence, q  = Pr [A|pw>, h ,s] .  n  Lemma 3.1. Given  the  n  sn  any history  h , the cutoffs  are related  n  across  signals  by  function: Qon = k(q ) ln  r^z  =  (1 -Pfqin for n = 0,1. Moreover,  q  0n  — J T :  +P (1 - <7ln) 2  < q\ for n E {0,1} . n  (3.12)  62  Proof.  We can write q  ln  Pv[A\piv,h ,l} Pr  =  n  \piv,h ,l\A}.Pv[A} n  Pr [piv, h , l \ A ] . Pv[A] + Pr [piv, h , 1\Q] . Pr{Q] n  n  1 i  , Pr[pw,/i",l|Q].Pr[Q] Pr[pii;,/i" l|A .Pr A] 1  Pr[l|Q1 Pr[pw,/i"IQ "T" Pr[l|A] PT[piv,h \A' -  n  -i , 1^2 Pr[pw,fe"|Q] p ' Pr[pTO,/i |>l] 1  n  The above holds since signals are conditionally independent and uncorrected to q and also Pr [A] = Pr [Q] = \. This can be simplified to Pr \piv,h  |Q]  n  p  1-qin  l - p  Pr [piv, h \A] n  q  Vn  Similarly, q  0n  Pi[G\piv,h ,0]  =  n  1 -,  ___ Pr[piv,h"-\Q]  l - p ' Pr[pTO,/i"|/l] 2*.  (1 - p ) 9m  - P ) 9 l n +J? (1 - g i n ) 2  k ( g i „ ) < ginfor any q  ln  G (0,1)  2  63  After history h , the waiting player is pivotal with probability one. Hence, 1  Qn  1  i __  Pr\pivM\Q]  p • PrJpwA !^] 1 1  ~  . l-p  1  Pr[/tMC?T  "t" p -Pr^l/l] 1 i I i - p (i-p)F(gi)+pF(^y ^ p •pF(<}i)+(l-p)F(^) 1  1  ~  (3.13)  1  where R. = ^ j < 1. By Lemma 3.1, goi = ^ (<7n) • 2  After history h°, the probability of being pivotal is less than one. An waiting player i can observe history h°, if either the other player's type g > % J  coupled with Sj = 0 or qi > qi coupled with Sj — 1. In case of the first event player i is pivotal under the symmetric cutoff strategies only when g G J  (90i9oo]-  If j = 1, player i is pivotal when g G (<7i,<?io]- We can now s  J  write Pr [piv, h°\A] = p[F (q ) - F (&)] + (1 - p) [F (q ) - F (q )] w  00  0  and Pr [piv, h°\Q] =(1-  p) [F (q ) - F (&)] + p [F (g ) - F (&)] • w  00  64 Therefore,  <?io =  , 1  +  , h-2 p •  Pr[piv,h°\Q] Piipiv,h°\A]  1 , iz2 (l-p)[F(gio)-F(gi)]+p[F(goo)-F(g )] "f" p •p[F(, )-i (9i)]+(l-p)[F(goo)-i (9o)] Q  1  ;,  ;,  10  (3.14)  1 , D iJ[F( - )-F(q )]+[F'(i; o)-F((;o)] - [F(9 )-F(<h)]+/i[F(,joo)-F(9o)] 9 10  1  1  0  n  10  Again by Lemma 3.1, goo = ^(<?io)We still have to determine the round 1 cutoffs.  q  sri  Since in equilibrium  > q for n . = 0,1, the marginal type's choice'is'between'voting A in s  round 1 and waiting to vote A in round 2. Hence, q is determined from the s  following equality:  El)(A  in round l|,s) = EU(A in round 2\s)  Suppose player i decides to vote A in round 1. If the other player plays the symmetric cutoff strategies, then A will be the voting outcome in either of the following two cases: (i) Player j receives an 0 signal and qi < goi- If g < %, then A will be J  decided in first round. If g > qo, player j waits in round 1; but since player J  j will be confronted with h , he will vote A in round 2 if g < goi1  J  (ii) Player j receives 1 and q < q\\. j  65  Hence, for a type q voter,  EU(A  in round l|s) PT(0\s)[F(q )V(A,s,0)-(l-F(q ))V(Q,s,0)}  =  01  Pi(l\s)[F(  +  q i l  01  )V(A,s,l)-(l-F(q ))V{Q,s,l)} n  =  Pr (0|s) {-F(q )(l  - ( s , 0))q - (1 - F(g i)) (s, 0)(1 - 9)]  +  Pr (l|s) [-F(q )(l  ~ 7(s, 1))? - (1 - F ( g ) ) ( s , 1)(1 - q)]  01  7  n  0  7  n  7  where V(d, S j , S j ) is the expected utility from decision d when the signals are Si, Sj and ( S J , Sj) = Pr[G|sj, s^]. Similarly, 7  in round 2|s) =  Pr (0|s) [-F(9oo)(l - 7(s, 0))? - (1 - F($oo)) (s, 0)(1 - q)]  +  Pr (l|s) [-F(q )j(s,  7  l)q - (1 - F(g ))(l - ( s , 1))(1 - <?)] •  10  10  7  Now the cutoff q can be determined from the following equation: s  EU(A  Pr (0|s) (F(qoi)  in round l|s) = EU(A in round 2|s)  ~ F(q ))  [q - 7(5,0)] = Pr (l|s) (F(q )  00  s  - F(q ))  n  [ (s, 1)  w  7  . _ Pr (l[s) ( F ( g ) - F(q )) 7(5,1) + Pr (0|s) (F(g ) - F(g )) ( s , 0) Pr (l|s) (F(q ) - F(q )) + Pr (0|s) (F(g ) - F(g )) w  u  01  00  w  01  00  7  f*  7(1,0) = (0,1) = §, 7(0,0) =  9 s  n  Since PrL4] = Pr[Q]'= | , (1,1) = 7  p2+  7  66  ^ ^ L _  p ( l | l ) = Pr(0|0) = p + ( l - p ) , Pr(0|l) = Pr(l|0) = 2p(l-p). 2  a  n  d  2  r  Hence, simplifying we get  ^  = 1  | p R(F{qn)-F(q. ))+(F(q )-F(q )) ~l~ -(F(gn)-F(qio))+R<.F(g i)-F(q )) 0  A  01  (- ) 3  00  15  rL  0  00  and Qo =  k(qi).  Equations [3.13], [3.14] and [3.15] along with  q  0n  = k(q\ ) n  and  q_ —  k(<7i)  now determine the equilibrium cutoffs. Notice that k(x) < \ for all x > |. Also, assuming that q\, qw and qw exist, it is easy to examine that all are greater than | . Hence, the highest cutoff corresponding to signal 0 is lower than the lowest cutoff corresponding to signal 1 and these two are separated by  I From equation [3.14], we can express q  w  is well-defined over the domain  (<ji,  = <f>(qw,  <7i). The function  <p(.,q_)  1] and continuous in qw. Since <f>(..q_)  > qi  for all gio E (qi, 1], lim^-,^ <p(x, qi) > q\ and l i m ^ i <p(x, q_) < 1. We can now conclude that given any q_ E (0,1), qw exists and greater than q_. We write <7io — ho (q\). Similarly, from 3.13, we can express qw = h\ (q\). Notice that in finding  qw  and  qw,  we have made use of the relation  %  =  k(q\).  We still have to ensure the existence of q\. From equation [3.15], we express  q\ = ip (q~i).  The function  tp(.)  is continuous and l i m ^ o  (•) > 0  and l i m _ i ip (.) < 1. An. application of Brouwer's Fixed Point Theorem now x  ensures the existence of q\.  '  <  The equilibrium path of play for the multi-round voting game is characterized in Figure 3.2. The first column in each interval shows the player's  67  9o  9oi  9oo  9i  9n  9io  0|  I 1  1  1  2  A  A  A  A  1 A  2 A  1 A  2 Q  2 A  2 Q  2 A  2 Q  2 Q  1  2  0  Figure 3.2: Equilibrium path of play in multi-round voting game choice of timing and vote if the signal received is s = 1 and the second column shows the same for s — 1. The first row shows the period at which the voter votes and the second row represents the preferred alternative. We describe the equilibrium in the multi-round game in the following proposition. P r o p o s i t i o n 3.2. The set of Perfect  Bayesian  cutoff' configuration  voting  in the multi-round  equilibrium game  that  admits  has the following  a cutoff  structure: Qs < Qso <  A player the player  with signal waits  Qsi  s votes for A in round  and votes  for A after  observing  1 if her type q < q . If q > q s  history  S7  h iff q < q . n  sn  • We can now easily compare between the set of equilibria in the game  68  with communication and the multi-round voting game. Since the same set of equations determine the relevant cutoffs for both games, the voting cutoffs are same. Hence the set of symmetric cut-off equilibria of the multi-round game is outcome equivalent to the set of efficient responsive robust cutoff equilibria in the game with communication. This example illustrates that efficiency of flexibility of timing of votes in a voting game is not limited to a situation of aligned preferences. Our conjecture is that endogenizing the timing of votes can substitute for direct communication in aggregation of private information in a collective choice problem. Unfortunately, we don't have the general result yet.  The link  •between the set of equilibria in these two types of games is not obvious. In our mechanism, to communicate her private information to others a player has to commit to a particular choice. In case of pre-play communication, a player can send a message and then deviate from her message in the voting stage. That is not feasible in the multi-round voting game.  3.4  Concluding Remarks  We show that in a common interest election, full information aggregation can be achieved if flexibility in timing of votes is allowed. With symmetric and monotonic signals, this can be achieved in a symmetric Perfect Bayesian Equilibrium. Moreover, the result does not depend on the degree and nature of correlation between private signals. The assumption of conditionally independent signals is an almost common feature of the literature of strategic voting, because otherwise the analysis becomes highly complicated. Our  69  result is more general. What would happen if the preferences are diverse in a voting game with flexible timing? This will be a more difficult question to answer since even with communication the voters will have incentive to strategically withhold private information. W i t h diverse preferences, if the preferences are sufficiently close to induce full revelation of private information in voting with communication, the same can be achieved with the endogenous timing of votes, fn the more general case, we conjecture that there would be strong connection between the set of equilibria in the game with communication and that in the flexible timing game. In Section 3 of this chapter, we illustrate that in the two person binary signal example. But proving it in a more general environment is an agenda for future research. How this mechanism can be implemented when the number of voters are large enough to permit anonymity? Many elections are now held online with electronic voting. W i t h advancement of Internet technology, it is now feasible to offer continuous real time updates of voting history. We conclude that if the objective of the election is information aggregation, this mechanism works well.  70  4. Committee Design with Endogenous Information 4.1  Introduction  A prime task of any organization is acquisition and processing of information relevant to important decisions. Informed decisions reduce the chance of errors; guesswork increases inefficiency. Design  of committees within an orga-  nization for the purpose of information processing and collection is therefore very important. The Condorcet Jury Theorem of the first kind (see McLean and Hewitt [40]) states that a majority of a group is more likely than a single individual to choose the better of the two alternatives. With exogenous information, the result is trivially true if perfect information aggregation tools are available. Since a group inherently possesses more information than a single individual, whenever the problem of information aggregation can be overcome the group can do no worse. Even when information must be aggregated through (possibly) imperfect mechanisms such as,voting, the Condorcet result is valid, as illustrated in the literature on strategic voting (see Feddersen and Pessendorfer [21], Miller [43], or McLennan [41] for a sample). Chakraborty and Ghosh  71 [10] have provided a general result to this effect, fn relation to committee design, these results show that with exogenous information a larger committee does better than a smaller committee under fairly general conditions. What happens if information is endogenous? Since information is a public good, with endogenous information collection there could arise a  effect.  free-rider  When several members are entrusted with the task of information  collection, each may have an incentive to save private cost by collecting less information, free riding on the information of others. However, in some cases, there is another effect that shapes the incentive for information collection at the individual level. Since, in some situations, an individual's information may not be valuable in itself, but becomes valuable only in conjunction with information provided by others, individual pieces of information are often complementary to each other. This information  complementarity  effect,  in  some cases, bolsters the incentive to collect information in a larger committee and could therefore lead to better quality information collected by each member. One objective of this chapter is to illustrate the possibility of each of these effects, and show under what kind of parameter conditions (priors, cost and quality of better information, etc.) they arise. Larger committees are unambiguously better when the information complementarity effect applies, both because individual members collect superior information and because there are more sources of information. However, if conditions are such that larger committees are prone to'the free rider effect, the designer, in choosing committee size, may face a trade-off between the quantity and quality of information. Larger committees will base their decisions on several pieces of low grade information', while smaller ones act on the  72 basis of fewer pieces of high quality information. We show that the free-rider effect can be strong enough to make smaller committees informationally superior in some cases. The model characterizes parametric situations where it is optimal to keep committee size smaller than what is feasible. Committee design, because of its obvious importance in the process of decision-making, has attracted much attention. One strand of literature extends the "strategic information transmission" model of Crawford and Sobel [14] to examine how a decision-maker's welfare can be influenced by varying the composition of a committee consisting of members with useful information ("expertise"), whose policy preferences differ from that of the decisionmaker (or the organization). Gilligan and Krehbiel [26], Austeh-Smith [1, 2], Krishna and Morgan [30, 31], Battaglini [5] examine situations where all committee members have the same information but may have different preferences. Wolinsky [52] examines a situation where experts have the same preferences but may receive different signals. Holrnstrom [28], Dessein [17], Li and Suen [37], de Garidel-Thoron and Ottaviani [15] concentrated their focus on the effects of delegation in the same setting. Our focus in this chapter is on the incentive for collecting information by committee members . There are a number of other studies which deal 23  with partly similar issues. But, while we focus on the issue of committee size, most of these studies attempt to see how the incentive for information collection varies with the decision rule in a committee of fixed size. Li, Rosen and Suen [38] and L i [36] examined optimal decision rules in the context of a fixed committee size. L i [35] analyzes the organizational structure that F o r an excellent survey of the existing literature on committee design with endogenous information, see Gerling, Griiner, Kiel and Schulte [25]. 23  73 minimizes information processing costs for a specific task. Dessein [18] also examines a model of organization with conflicting interest to study authoritative coordination vs. consensus in decision making. Sah and Stiglitz [49, 50] investigate similar issues of organizational design, but do not stress incentives to collect information. In their structure, information is exogenous. Blinder and Morgan [7] compare group versus individual decision making in an organization using an experimental study. Haleblian and Finkelstein [27], in an econometric analysis, test how managerial team size affects the organizational decision-making using firm-level data and conclude that in more uncertain environments larger teams tend to do better. In the context of jury trial, Mukhopadhyay [45] identifies the free rider problem in a large jury. There are two ways in which this analysis departs from the existing literature on committee design that addresses incentives to collect costly information. We consider only cheap talk mechanisms. Except for the private cost of collecting information, there is no conflict of interest among committee members or the decision maker in our model, implying that members have no incentive to withhold anything they have learned. We assume the committee is advisory, and the designer cannot commit to ignore any decision relevant information ex-post, which means all the information that has been collected will be efficiently used. The only strategic choice the decision maker faces in our framework is the size of the committee. In contrast, Gerardi and Yariv [24], allow full commitment to any mechanism at the information aggregation stage, including ones which distort the use of available information. Persico [46] analyzes committees that make their decisions through voting, giving the designer the option to choose committee size as well as the voting  74 rule. All these papers assume some commitment power on the part of the designer as to how the information will be used. We think it is natural to assume in many contexts, especially those involving advisory committees, that commitment to distort the use of information once it becomes available is hard to sustain. We also allow for information of different qualities, and members can choose the precision of the information they gather. Specifically, we assume each member has access to a free informative signal, but can obtain a more precise signal if she pays a private cost. This creates a possible trade-off between quantity and quality of information from the committee designer's point of view. This aspect is absent from the other models of committee 24  design that address similar issues (for example, Persico [46] and Gerardi and Yariv [24]), and has a non-trivial effect on the results. In other papers, larger committees are informationally superior to smaller ones in the weak sense, i.e. it is never the case that a smaller committee generates strictly better information than a larger one. Most papers demonstrate an upper bound to informativeness as committee size goes up. In contrast, we find situations where a smaller committee is informationally superior in the strict sense, which implies that when it comes to committee design, too many cooks may spoil the broth. One application that fits well with the model proposed in this essay is the example of a hiring committee in an academic department. Hiring comKaroutkin and Paroush [29] has examined the quantity versus quality dilemma in an exogenous setting. In their set-up, both the quality and quantity of information are exogenous and as the committee size decreases the quality of information for each member rises automatically. In our model, this occurs as an equilibrium phenomenon (for some parametric configurations). 24  75  mittees generally consist of existing faculty members. Once the department agrees on the field of the candidate it is going to hire, the faculty as a whole wants to hire a good candidate. Hence, there is no fundamental conflict of interest among the committee members. The committee members collect information about a potential recruit and then pass on their recommendations to the departmental head or the dean who then takes the final decision based on the recommendations of the committee members. The committee members get a basic idea about a candidate's qualities by attending the interview and looking at a candidate's CV. A committee member may also collect better information regarding the candidate's qualities by putting in extra effort in reading the research papers authored by the candidate or talking to people who have better idea about the candidate from past experiences. Presumably, the extra effort induces higher personal opportunity cost for the committee member. Once too many members are included in a committee, each individual member's incentive to put in that extra effort would reduce. More specifically, an individual committee member may bank upon others to read the candidate's papers and make the correct recommendations. Since all committee members have common interest, if everybody else puts in the higher effort, this course of action saves the higher opportunity cost for an individual committee member without vastly compromising the efficiency of the decision. But if a large number of committee members follow the same, the efficiency of the decision would be significantly reduced. Our model analyzes a scenario almost similar to above. The organization of the chapter is as follows.- In section 2, we set up the basic model. Section 3 analyzes the model and points out the main results.  76 Section 4 concludes.  4.2  The Model  An organization has to form a committee to take a decision. There are n individuals from which the committee has to be formed. The decision problem is to choose from among two options— A (alternative) or Q (statusquo). There are two possible states of nature as well - A and Q. The common preference of each individual is such that with complete information the ^optimal decision is matched exactly with,the state. This is captured by the utility function u(d,u), where d G {A, Q} represents the ultimate decision and u is the state-of-the-world. If the decision is correct, each member of the organization gets utility equal to one. The utility from a wrong decision is 0. The preference is captured by the following utility function:  . u(u,d)=\  f  1  iid = u  (4.1)  I 0 otherwise.  The prior on the event u = A is TT. There are two signal technologies indexed by t G {h, 1} . For each technology, the signal can take one of two possible values from the set Q = {a t  t)  qt}-  A signal of type t has an accuracy p i.e. for a t—type signal, Pr[a |A] = t  t  Pr[g |Q] = p G ( | , 1 ) for t — h,l. We also assume that the signals are t  t  conditionally independent. We assume the /-technology is costless. This means that even if an individual does not invest in acquiring information, she still gets a noisy signal  77  by default. By investing in an effort amounting to cost c, each individual can collect a signal of better quality. The better signal has a precision level ph with p  h  > pi.  For the sake of simplicity, we will restrict ourselves to two possible values of n - 1 or 2. Increasing n to values greater than 2 does not add much insight towards understanding the main points, but complicates the analysis. We model the situation in the following way. The committee designer first chooses the committee size n (1 or 2). The member(s) of the committee then decide simultaneously whether to collect the better signal by incurring the private cost or just depend on the lower quality signal. The members report their signals to the committee designer who takes the decision after utilizing all the available information. One assumption we make here is that the committee designer cannot make any credible commitment regarding not to use any available information at the decision stage. This implies that once the signals are collected, they are utilized optimally. In other words, information is fully aggregated prior to the decision. Everybody shares a common utility function; hence there is no incentive to withhold information under this mechanism after the collection stage. The assumption regarding full information aggregation merits some discussion. We do not take up the optimal mechanism design problem. Notice that if we assume the committee designer can credibly commit to any mechanism, then the smaller committee outcome can always be mimicked with a larger committee in which the designer commits to ignore the messages of some players. But there always remains a question regarding implementability of such mechanisms. Given common interest between the decision maker  78  and the committee members it is hard to imagine that the decision maker can credibly commit to an ex post decision rule that promises to use less information than what is available to him. After all, we do not often see the heads of the departments or the deans of the faculties handing out explicit contracts to hiring committee members which say that not all recommendations would be used in decision making. We, therefore, restrict ourselves to a particular symmetric mechanism namely the ex post efficient mechanism . However, 25  we recognize, as has been pointed out by Gerardi and Yariv [24], for large enough n, the ex post efficient mechanism may not be the optimal mechanism. But that does not contradict our result. Even if we choose the optimal symmetric mechanism instead of the full information aggregation mechanism as the decision rule, a smaller committee can perform strictly better than a larger committee under certain parameter values. The intuitions behind the results remain similar. The problem we take up here is not one of finding the optimal committee size with an infinite number of potential members available. Obviously, the optimal committee size in this case is infinite. Since the default signal is somewhat informative (even if slightly), in a very large committee the probability of making the correct decision is almost equal to one. One way to interpret this model is to consider it as a constrained problem. Given that only a finite number of people are available for inclusion in the committee, we discuss how committees should be formed.' For comparison across committees, we use the common expected value generated by the information collected by the committee exclusive of inT h e ex post efficient mechanism is one where the committee designer uses all the available information at the decision making stage 25  79  formation costs. This we think is the natural welfare function when the preferences are common. If the decision affects a very large group (or an organization), the individual costs are small or negligible relative to the welfare of the people affected. Henceforth, we denote this common value generated by a n-member committee by V  n  (.).  Before proceeding further, we need to impose some restrictions on the parameters of the model. We assume that  VK~VI  > - We need this restriction c  to make the better signals attractive at least in some cases. For the rest of the chapter, we restrict ourselves to values of IT > | . Similar results can be obtained for IT < | because of the symmetric nature of the model. Some discussions regarding the choice of this model are worthwhile here. The standard models of committee design with endogenous information (for example, Persico [46] and Gerardi and Yariv [24]) consider a two level choice of information quality. In these models, the committee members have access to either a high quality signal or no information at all. This dampens the incentive for free riding since the alternative has no informative value. That is why these models cannot generate a strict dominance result for smaller committee size. Our model, though apparently also has a two level choice of signal quality, is actually the first approximation of a model with richer quality choice. Similar qualitative results can be obtained if we introduce a cost (which must be appropriately low) for the lower quality signal. This suggests that the result we obtain here will survive in a more general model with multi-level quality choice.  80  4.3 Let  Committee Design 9 be the vector of signals collected by all players before the decision is  made. Since each individual reports their signals truthfully, 0 is completely known prior to decision-making. Then the common posterior on the state being A, defined by Bayes' Rule, is as follows:  ^  ^  = m  =  r  ^  _  ^  :  ^  _  Q  y  (4.2)  Clearly, under the no commitment mechanism, the optimal decision d*(9) is as follows: d*(9)  =A  7(0) > ~.  (4.3)  We can write the ex-post common utility of this decision as , 1/(7(0))=  ( 0 ) , if ( 0 ) > i  7  7  , • 1 - 7 ( 0 ) , if 7 ( # ) < 1  ^  Let P (0) be the probability of realization of a signal vector 9. Possible realizations of 0 of course depend on the chosen signal technologies. Let T G {h, I}  2  be the vector of chosen signal technologies and QT be the set of all possible signal realizations under T. Then ex-ante common expected value from T can be written as V(T)=  P(0)U( (9)).  Y,  7  (4.5)  eee  T  We are now in a position to discuss the equilibrium outcomes for different committee sizes. We take up that task in the next two subsections.  81  4.3.1  One member committee  We first consider the single person decision problem. Without loss of generality, we concentrate on the range of priors TT G [|, 1]. Because of the symmetry of the structure, exactly similar results can be obtained for rr G [0, | ) . For the rest of the chapter, we assume TT > | . A i-type signal, t G {h,l} formationally decision relevant if and only if TT G [ _,Pt)-  is in-  In case the prior  falls in this range, a signal q pushes the posterior below | and the decision is t  contingent on the realization of the signal. Hence the expected utility from collecting a signal of type t without accounting for cost is given by V\t)  for 7T G [|,Pt)  a n  d t  =  = P(q )(l- (q )) t  1  + P(a ) (a )  t  t  1  t  I, h. For TT > p , the optimal decision is A independent t  Therefore, V (t) — TT for TT > p . Hence, the  of the signal realization.  1  t  marginal benefit from collecting a /i-type signal in the single person decision problem is Ph-Pl 1 ) 1  (TT)  =  { Ph  if 1 < TT < pi  if Pl <  0  TT  < p  h  •  (4.6)  otherwise  Notice that b (TT) is a continuous function of TT. The individual collects h if 1  and only if b (TT) > c. This condition induces an interval of priors over which 1  the /i-type signal is collected by the individual. We summarize the finding in the following lemma. L e m m a 4.1. For any c < Ph — pi, in a one member  signal  will  be collected  if and  only  if it G [_,.Ph ~ c].  committee,  a  h-type  82  Proof.  Since b (IT) is strictly decreasing in IT for all n G [puPh], 1  and reaches 0  at ph, for any c > 0, 6 (IT) > c induces a unique interval for any c < Ph~Pi  =  max b (n) .  I  1  1  The social value function from this individual decision (ignoring the cost) is then given by  26  (4.7)  Since Ph — c > pi, the /-type signal has no decision relevance in the range where the to-type signal is not being collected and hence cannot affect the social value. One observation may be worth mentioning here. Notice that as pi falls,  Ph — Pi rises. As we mentioned earlier, ph — Pi indicates the upper bound on the range of cost parameter for which an individual can be induced to collect a high quality signal. This shows that the presence of a free informative signal may sometimes lower the incentive for providing effort to find a better signal. In other words, free information may be expensive from a social point of view.  4.3.2  Two member committee  Next we move on to our analysis of a two member committee. Let ti'E {to, 1} denote player i's choice of signal technology and V (tj, tj) represent the pay2  off to players when players i and j choose f and tj respectively. For different W e are slightly abusing our notation here. We write the value function assuming that optimal decision d* is taken for all ranges of prior, given the incentive constraint for the individual. We do this throughout the chapter for the sake of comparison across the committees. 26  83  parameter values, three types of pure strategy equilibria may exist in a two member committee: (i) (h, h),  (ii) (h, I) or (I, h) and (iii) (I, I). We next  characterize the necessary and sufficient conditions for existence of these pure strategy equilibria in terms of the value function. 1. V (h, h) — V (h, I) > c is necessary 2  2  and  sufficient  for (h, h) to be an  equilibrium. 2. V (h, h) — V (h, I) < c and 2  2  sufficient 3.  2  for (h, I) and (I, h) to be  V (h, I) — V (1,1) 2  V (h, I) — V (I, I) > c are necessary  2  < c is necessary  2  and  equilibria. and  sufficient  for (1,1)  to be an  equilibrium.  These conditions follow directly from the definition of Bayesian Nash Equilibrium which is the equilibrium concept we use throughout this essay. Since we are in an environment with common preferences where information is a public good, players' ex-ante utilities (net of cost) depend only on the types of signal technologies chosen by them, but not on the exact combination of choices. Hence, the value functions mentioned above are sufficient statistics for characterizing the equilibria in this environment. An immediate corollary of the above conditions is that at least one pure strategy equilibrium exists for all parameter values. The  necessary and sufficient conditions for existence of different pure  strategy equilibria also show that neither (h, h) nor (/, I) can coexist with  (h, I) or (/, h) as equilibria. Moreover, for parameter values such that (h, I) is an equilibrium, (l,h)  is an equilibrium as well. Our next lemma proves  84 that when (1,1) or (h,h)  is the unique pure strategy equilibrium, no mixed  strategy equilibrium can exist. L e m m a 4.2. For parameter  pure  strategy  equilibrium,  values then  such  that  (1,1)  it is the unique  or (h,h) is the  equilibrium  of the two  unique person  game.  Proof.  First consider that (I, I) is the unique pure strategy equilibrium. Then,  V (h, h) - V (h, I) < c and V (h, I) - V (1,1) < c. Now consider any mixed 2  2  2  2  strategy o for player j where o is the probability of playing h. Generically, for a to be part of a mixed strategy equilibrium, we must have the following aV  2  (h, h) + (l-  a) V (h, l ) - c = aV (I, h) + (1 - a) V (I, I) 2  2  2  or, equivalently a [V (h, h) - V (I, h)] +(l-a) 2  2  [V (h, I) - V (I, I)] = c. 2  2  From the two strict inequalities described above, and the fact that V (h, I) = 2  V (l,h),  it follows that, for any o <E [0,1]., the lhs of the above is strictly  2  less than c. Hence, we cannot have a mixed strategy equilibrium in this case. The proof for the case when (h, h) is the unique pure strategy equilibrium is similar. For  i  '  ,  '  1  '  |  any signal vector 9, we define n (9) to be such that for all ir > II (6),  7 (9) > \ where 7 (6) is the common posterior on the state being A given 8. We first consider the case when both players collect h. For any 27  IT , 27  7 (ah, a>h),  Remember that we are restricting ourselves to values of 7r greater than or equal to | .  85  7 ( h, Qh) and 7 (qh, ah) are greater than or equal to ^ and the optimal decision a  corresponding to these signal realizations is A. But 7 (qh, qh) < \ if and only if TT < fl ((j^, qh) and in that case the decision is Q under full information utilization. Hence, in the case where (h, h) are the signal technologies chosen by the players, the signals have decision relevance if and only if rr < n (qh, qh) • The expected utility to each player when both players choose h is the following: V  2  (h, h) P (o-h, h) 7 ( h, h) + P (a-h, Qh) 7 ( h, Qh) a  <  a  a  a  +P (q , a ) 7 (Qh, a ) + P (q , qh) [1 - 7 (qh, Qh)} h  h  TT i f TT <  2  h  h  h  h  Ph + Ph (1 - Ph) TT  .. ^. , if 7T < U ( q , q )  otherwise U(q ,q ) h  h  (4.6)  TT  otherwise  Similarly, when both players choose /, the common expected utility is , vf + 2pi (1 — pi) TT if TT < n (qi, qA V (l,l) = { . (4.9) 7T otherwise 2  1  m  7  V  When the chosen signal technologies are (h,l) or (l,h) , the derivation of the common expected utility is a little more involved. The /-type signal has practical relevance in decision-making if and only if the prior falls in a range such that a I—signal in favour of A coupled with the prior overwhelms a h—signal in favour of Q to clinch the decision in favour of A. For this to happen, TT must belong to the interval [n (a qh), Tl (qi, qh))h  For TT <  86  neither signal matters. Hence the common expected utility can be written as  (  if vr < n (a,, q )  Ph  - •,  h  PhPi + [Ph (1 - Pi) + PJ (1 - Ph)] TT if n (aj, (fo) < TT < II (g,, %) 7T otherwise  (4.10) Let b (TT; t) denote the marginal benefit from collecting an h—type signal 2  when the other player is collecting a t—type signal. Obviously, we can now write  b (TT; h) — V (h, h) — V (h, I)  (4.11)  b (rr;l)  (4.12)  2  2  2  and =V {h,l)-V (lJ).  2  2  2  Since a better signal technology cannot reduce the ex-ante value of information, b (n, t) > 0 for all TT. Both b (TT; h) and b (TT; I) are continuous functions 2  2  2  of TT. The following two lemmas characterize the parameter zones for which incentive constraints for collecting the h—type signal conditional on the other player's strategy are satisfied. L e m m a 4.3. For any  such  c<  that b (TT; I) > c if and 2  Proof.  only  if.ir <  exists  a unique  fti (c) <  U(qi,qh)  ~TTI ( C ) .  :  See Appendix A.2.  |  L e m m a 4.4. Fix Ph,Pi-  exist [A  — pi, there  unique  cutoffs  ( ). A ( ) ] c  c  There  exist  c > 0 such  TTQ (C) and TT\ (c) such  w h e r e  n  o () < c  n  that for all c < en,  0  that b (TT; h) > c if and only 2  ( h Qh) and n (a , q ) a  ;  h  < TT\ ( C ) <U(q , h  there if TT £ q) . h  87  Proof.  See Appendix A.2.  |  As a corollary to Lemma 4:4, we can see that a necessary condition for a  (h, h) equilibrium is c < c . As the cost of the h—type signal increases, the 0  free-rider effect becomes more intense and it is more difficult to satisfy the incentive constraints for both individuals collecting the h—type signals.  4.3.3  Comparison between committees  We are now in a position to make comparisons across committees with respect to effort levels and effect on general welfare. We state our main results in two propositions. The first proposition identifies parameter zones where the domination of the complementarity effect over the free-rider effect (and vice versa) can be clearly seen. The second proposition provides conditions for the strict domination of a smaller committee over a larger committee. We define a set $ = {TT € [puPh]  '• b l ") = b (TT; I)} . The following lemma 1  2  71  characterizes the set $. L e m m a 4.5. $ is non-empty,  closed  and  bounded.  Define g (TT) = b (TT) — b (TT; I). g (TT) is continuous since both b (TT)  Proof.  1  2  1  and b (TT; I) are continuous, b (TT; I) is strictly decreasing over the domain 2  [|, II  (q  2  u  q )\ h  and b (\;l) = p 2  h  But, b (p ) = p - p, and b (p )  p.  1  t  = 0.  l  t  h  h  Hence g (p{) > 0. and g (ph) < 0. An application of Intermediate Value Theorem then ensures that $ is non-empty. The boundedness obviously follows from definition of  To see that $ is closed, assume the contrary. Then there  exists a sequence {7r } n  But  such that g (Tr ) = 0 for all n, but lim _oo g (TT ) ^ 0. n  this contradicts continuity of g (.).  n  n  |  88  Since $ C 9t, the last Lemma ensures that both max, <f> and min, $ exist and are unique. Let us denote these two by n define c\ = b (n ) 1  and ci = b {ir )  l  1  max  and n  l max  respectively. Now  l min  • Since 6 (.) is strictly decreasing in  l  1  miD  this range, C\ < c-i- An inspection of b (.) and b (.; I) reveals that we essen1  2  tially confront two possible scenarios. If II (a;, q^) < II ^Lin  {^-(ai,q )  e  ,U(q qi)).  h  then n  l min  q{), then  On the other hand, if U ( a q )  h  h  = II (q q{) and -n u  l max  h  >  TT  =  L MAX  U(q qi), h  = II (a,, g ) . h  Finally, for any c, define ff = max {n\ (c) , ff/ (c)}, where 7r^ ( C ) and 7f; (c) are as defined in Lemma 4.3 and Lemma 4.4 respectively. Let T* denote the vector of equilibrium signal technologies chosen by a committee of size n. Now,  we can state our first proposition. 1. c < C\ and ix £ (ph — c,ft]are sufficient  Proposition 4 . 1 . and  existence  of a T * € {(h, h), (h, I), (I, h)}. 2  2. c > C2 and TT £ (ffj (c), andT;  Proof.  for T{* = /,  — c] are necessary  and sufficient  for Tj* = / i  = (1,1) .  See Appendix A.2.  |  Proposition 4.1 describes the effect of committee size on incentives. It identifies conditions under which the larger committee is subject to either the free rider effect or the information complementarity effect, and proves neither of these are empty. The first part provides a sufficient condition for information complementarity effect to come into play. Under these conditions, the equilibrium signal quality is I in a one member committee, but in a two member committee, there always exists an equilibrium with at least one h-type signal. The second part of the proposition provides necessary and  89 sufficient conditions for the free-rider effect to apply. It identifies parameter zones where a one member committee collects a /i-type signal in equilibrium, while in a two member committee the only equilibrium is (I, I). The result is quite intuitive. The incentive to free-ride is more intense .when the cost of quality information is high. • On the other hand, signals become complementary towards more extreme priors, since the cumulative signals must be sufficiently strong to have any relevance to the decision. Hence, for the complementarity effect, we need a sufficiently low value of c along with relatively large prior values. Exactly the opposite is true for the free-rider effect. We need a sufficiently high c along with not so extreme priors for this to happen. Some discussion regarding the set of equilibria for different parameter values is worthwhile here. In the following two figures, we illustrate these in the case of a particular set of parameter values, namely when n (q , qi) < t  n (a;, qh) . The other cases can be dealt with similarly. We illustrate the above proposition with the help of a numerical example. For parameter values Vh = 0.8 and Vi = 0.6, the values of ci and c in the 2  above proposition can be easily computed to be 0.0727 and 0.1077 respectively. Figures 4.1 and 4.2 are drawn with parameter values Vh = 0.8 and Pi = 0.6 to show the pure strategy equilibria for different values of prior. In Figure 4.1, we take c = 0.02 < c\. The panel at the top right hand corner of Figure 4.1 identifies the pure strategy equilibria when the prior falls in different zones. For vr close to \ (TT € A = [0.5000,0.5625)), the bigger committee admits (h,l)  and (l,h)  equilibria. For extreme values of  TT (TT G E = (0.9118,1.0000]), neither type of committee puts in an ef-  90  Note: The above figure is drawn with parameter values pi = 0.6,  = 0.8 and c = 0.02.  Figure 4.1: Pure Strategy Equilibria for Different Prior Values: c < Ci. fort to collect a h—type signal. For other values of TT, the bigger committee admits a (h,h) equilibrium. When rr falls in C = (0.7800,0.8214] or D = (0.8214,0.9118], one (h,h) equilibrium exists in a two member committee while a single member committee does not put any effort at all into gathering the better signal . For values of TT G B = [0.5625,0.7800], the 28  bigger committee collects two h—type signals while the single member comT h i s is just for the purpose of illustration. We ca.n have other parameter configurations satisfying the conditions mentioned in Proposition 4.1 such that values of prior exist where a one member committee collects I in equilibrium while a two member committee admits (h,l) or (l,h) as equilibria. 28  91  Note: The above figure is drawn with parameter values pi = 0.6, p^ = 0.8 and c — 0.15.  Figure 4.2: Pure Strategy Equilibria for Different Prior Values: c > c . 2  mittee collects only one in equilibrium. B, C and D are the zones where a clear domination of the complementarity effect over the free-rider effect can be seen as identified in Proposition 1. Figure 4.2 illustrates the set of equilibria for c = 0.15 > c . Given that 2  c > c , for priors very close to \ (TT G A = [0.5000,0.6042]), 7\* - h and 2  T = (h, I) or (/, h). Both these equilibria generate the same social value as 29  2  the single member committee for this particular situation. Then, we have a 0 f course, there exist mixed strategy equilibria for the bigger committee in this range, which may do strictly better than the smaller committee outcome. 2 9  92 range of priors (TT € B = (0.6042,0.6500]) where T* = h and T * = (I, I). This 2  is the parameter zone we identified in part 2 of Proposition 4.1. Towards the extreme prior values belonging to the interval C — (0.6500,1.0000], Tj* = I and T * = 2  (1,1).  Notice that in both cases illustrated above, for values of prior close enough to \, Tj* = h, and T * = (h,l)  or (l,h),  2  that is the smaller and the bigger  committees are informationally equivalent. In other words, both committees generate the same level of decision relevant information and hence social value. This is what Persico [46] and Gerardi and Yariv [24] identified. Their results show that given the parameters, there exists an upper bound on the social value that can be generated by increasing committee size. In their models, in the absence of an exogenous cost of designing a bigger committee, a smaller committee cannot do strictly better. In our next proposition, we provide conditions for the strict dominance result of the smaller committee. In part 2 of Proposition 4.1 we have identified the conditions under which a one member committee collects h in equilibrium, while the unique equilibrium in the two member committee is (1,1).  This is necessary for welfare  dominance of the smaller committee, but may not be sufficient. In our next proposition, we show-that for all values of  and pi, we can find parame-  ter zones where Tj* — h and T * = (1,1) become sufficient for strict welfare 2  dominance of the smaller committee. P r o p o s i t i o n 4.2. For allpi,ph  such  Proof.  that the smaller  committee  See Appendix A.2.  € (\, 1) such  dominates  that  P  h > Pi, there  the larger  committee  exist TT and c welfarewise.  |  93 We illustrate again with numerical examples. We show in the proof of 2  Proposition 4.2 that if p > ^_ y h  p2+  pi  >  2  =  h d F a n  (M)  = 2  a r e  sufficient  for strict welfare dominance of the smaller committee. For parameter values  p  = 0.8 and p = 0.6, p >  h  h  ;  p2+  ^_ pi)2  For these values of p and ft, h  c =;0.1077 and.Tr^ = 0.6923 can be easily computed. Now, at Tt = 0.6923, 2  V (l,l) 2  — 0.6923.' For any c > c , the values of TT for which T * = h and 2  2  T * = (1,1) are strictly less than 0.6923. Since V (l,l)  is increasing in TT,  2  2  hence V (l, I) < V (h) — 0.8 in the relevant zone. 2  l  Next we consider parameter values ph — 0.8 and pi = 0.7. Now, ph is 2  strictly less than  p  2  +  ^ _  p  [  ^  We choose c = 0.05 such that (h,h) is not an  •  equilibrium. In the range of prior given by (0.6190,0.7500), T£ = h and T * = (1,1). To show that this no longer suffices for strict welfare dominance 2  of the smaller committee, we choose TT = 0.74 where V (l,l)  = 0.8008, but  2  V (h) l  = 0.8. But for lower values of TT, in particular for values of TT in the  interval (0.6190,0.7381), V (h) > V (1,1) still holds. 1  2  Notice that so far we have chosen the common value of each individual for welfare comparisons. Suppose instead we choose a utilitarian welfare function that sums up each individual's net welfare to obtain social welfare. As before a necessary condition for welfare dominance of the smaller committee is that the smaller committee chooses to collect a h-type  signal while the larger  committee collects only Z-type signals. As shown in Proposition 4.1 this can happen only if TT € (^i(c)  ,ph~ c] and c > c . Notice that social welfare 2  if information is collected by a smaller committee is now 2V (h) — c, while 1  in case of the larger committee social welfare is 2V (l, 2  I). Suppose we again  take Ph = 0.8 and pi — 0.6. As we have already shown, for these values of  94 Ph  and pi,  C2 —  0.1077 and  7i  l  min  = 0.6923. Suppose we choose c = 0.15.  Then the highest value of n for which T * = h and T * = (I, I) is 0.65. At x  2  = 0.65,2V (U) = 1.344. Since V {l,l) is increasing in n, 2V (l,l) 2  TT  2  in the relevant zone, while 2V (h) l  —c =  2  1.344  <  1.45. Hence, for these parameter  values the smaller committee dominates the bigger committee welfarewise even for utilitarian welfare function. This example illustrates the robustness of our result with respect to the specification of the welfare function. For high enough c, the incentive to free ride dominates the positive incentive towards good quality signals arising out of complementarity between the signals in a larger committee, at least for some values of the prior. In a smaller committee, the lower free riding incentive may induce the individuals to collect a larger number of high quality signals, making the smaller committee better from a social point of view. This indicates the quality quantity trade-off that the committee designer faces in an environment with multiple information qualities. Notice that the last proposition is a strict violation of the Condorcet Jury Theorem of the first kind. Even under the assumption of full information aggregation, a smaller committee strictly dominates a bigger committee. In a two level signal quality choice model with the alternative to the informative signal being a completely uninformative one, this result cannot be obtained. It can be easily seen in this model'by verifying that as pi —> \,-b (TT) —> 1  b (TT; I) for all values of n. 2  95  4.4  Concluding Remarks  This essay doesn't attempt to give a general characterization of the solution to optimal committee design problems. Previous analyzes have provided a weak dominance result for smaller committees in that there is an upper bound on the value of information generated by increasing the committee size. We, on the other hand, argue that not allowing committee members choice over the quality of information they collect misses an important aspect of the problem. We show that in a slightly richer model which allows for this, there are situations when a smaller committee can do strictly better, even under the assumption of perfect information aggregation. We expect this result to be generic and robust to model specifications.  96  Bibliography [1] Austen-Smith, David (1990): "Information Transmission in Debate." American  Journal  of Political  Science  34: 124-52.  [2] Austen-Smith, David (1993): "Interested Experts and Policy Advice: Multiple Referrals under Open Rule." Games  and Economic  Behavior  5: 3-43.  [3] Austen-Smith, David and Jeffrey S. Banks (1996): "Information Aggregation, Rationality and the Condorcet Jury Theorem." American ical Science  Review  Polit-  90: 34-45.  [4] Barro, R. J., and D. Gordon (1983): "Rules, discretion, and reputation in a model of monetary policy." Journal  of Monetary  EconomicsYl:  101 21. [5] Battaglini, Marco (2002): "Multiple Referrals and Multidimensional • 'Cheap Talk." Econometric^70:  1379-401.  [6] Berend, Daniel and Jacob Paroush (1988): "When is Condorcet's Jury Theorem Valid?" Social  Choice  and Welfare!^:  481-88.  97 [7] Blinder, Alan S. and John Morgan (2000): "Are Two Heads Better Than One?: An Experimental Analysis of Group vs. Individual Decisionmaking." NBER  Working  Paper  N o . 7909.  [8] Cai, H. (.2001): "Optimal Committee Design With Heterogeneous Preferences." Mimeo, UCLA. [9] Callander, Steven (2002): "Vote Timing and Information Aggregation." Mimeo, Northwestern University. [10] Chakraborty, Archishman and Parikshit Ghosh (2002): "Efficient Equilibria and Information Aggregation in Common Interest Voting Games." Mimeo, University of British Columbia. [11] Chamley, Christopher and Douglas Gale (1994): "Information Revelation and Strategic Delay in a Model of Investment." Econometrica  62:  1065-85. [12] Condorcet, Marquis de (1785): "Essay on the Application of Mathematics to the Theory of Decision-Making." Reprinted in Keith Michael Baker (ed.): Condorcet:  Selected  Writings,  Indianapolis: Bobbs-Marrill  Co. [13] Coughlan, Peter (2000): "In Defence of Unanimous Jury Verdicts: Mistrials, Communication and Strategic Voting." American ence  Review  Political  Sci-  94: 375-93.  [14] Crawford, Vincent P. and Joel Sobel (1982): "Strategic Information Transmission." Econometrica  50: 1431-51.  98 [15] de Garidel-Thoron, Thomas and Marco Ottaviani (2000): "The Economics of Advice." Mimeo, University College of London. [16] Dekel, Eddie and Michele Piccione (2000): "Sequential Voting Procedures in Symmetric Binary Elections." Journal  of Political  Economy  108: 34-55. [17] Dessein, Wouter (2002a): "Authority and Communication in Organizations." Review  of Economic  Studies  [18] Dessein, Wouter (2002b):  69: 811-38.  "Coordination Through Authority versus  Consensus." Manuscript, University of Chicago. [19] Doraszelski, Ulrich, Dino Gerardi and Francesco Squintani (2003): "Communication and Voting with Double-sided Information." butions  to Theoretical  Economics  Contri-  3: No. 1, Article 6.  [20] Duggan, John and Cesar Martinelli (1999): "A Bayesian Model of Voting in Juries." Games  and Economic  Behavior  37: 259-94.  [21] Feddersen, Timothy and Wolfgang Pesendorfer (1997):  "Voting Be-  haviour and Information Aggregation in Elections with Private Information." Econometrica  65: 1029-58.  [22] Feddersen, Timothy and Wolfgang Pesendorfer (1998): "Convicting the Innocent: the Inferiority of Unanimous Jury Verdicts." American ical Science  Review  92: 23-35.  Polit-  99 [23] Gerardi, Dino and Leeat Yariv (2003): "Putting your Ballot Where Your Mouth Is - Analysis of Collective Choice with Communication." U C L A Working Paper, No. 827. [24] Gerardi, Dino and Leeat Yariv (2004): "Mechanism Design with Information Acquisition." Manuscript, Yale University. [25] Gerling, Kirsten, Hans Peter Griiner, Alexandra Kiel and Elisabeth Schulte (2003): "Information Acquisition and Decision Making in Committees: A Survey." European Central Bank Working Paper, No. 256 [26] Gilligan, Thomas W. and Keith Krehbiel (1989): "Asymmetric Information and Legislative Rules with a Heterogeneous Committee." Journal  of Political  Science  American  33: 459-90.  [27] Haleblian, Jerayr and Sydney Finkelstein (1993): "Top Management Team Size, CEO Dominance, and Firm Performance: The Moderating Roles of Environmental Turbulence and. Discretion." Academy agement  Journal  Man-  36: 844-63.  [28] Holmstrom, B. (1984): "On the Theory of Delegation." In  Models  of  in Economic  Theory,  Bayesian  ed. by Marcel Boyer and Richard  Khilstrom. Elsevier Science Publishers B.V. [29] Karotkin, Drora and Jacob Paroush (2003): "Optimum committee size: Quality-versus-quantity dilemma." Social  Choice  and Welfare  20: 429-  41. [30] Krishna, Vijay and John Morgan (2001a): Qarterly  Journal  of Economics  116: 747-75.  "A Model of Expertise."  100 [31] Krishna; Vijay and John Morgan (2001b): "Assymmetric Information • and Legislative Rules: Some Amendments." American  Review  Political  Science  95: 435-52.  [32] Kydland, F. E., and E. Prescott (1997): "Rules Rather Than Discretion: The Inconsistency of Optimal Plans." Journal 85:  of Political  Economy  47391.  [33] Ladha, Krishna (1992): "The Condorcet Jury Theorem, Free Speech and Correlated Votes." American  Journal  of Political  Science  36: 617-34.  [34] Ladha, Krishna, Gary Miller and Joe Oppenheimer (2000): "Information Aggregation by Majority Rules: Theory and Experiments." Mimeo, University of Maryland. [35] L i , Hao (1999): tions." Review  "Hierarchies and Information-Processing Organiza-  of Economic  Design  4: 101-26.  [36] Li, Hao (2001): "A Theory of Conservatism." Journal  of Political  Econ-  omyl09: 617-36. • [37] L i , Hao and Wing Suen (2001): "Delegating Decisions to Experts." Journal  of Political  conomy,  forthcoming. *  [38] Li, Hao, Sherwin Rosen and Wing Suen (2001): "Conflicts and Common Interests in Committees." American  Economic  Review  91: 1478-97.  [39] Martinelli, Cesar (2002): "Convergence Results for Unanimous Voting." Journal  of Economic  Theory  105: 278-97.  101 [40] McLean, I. and F. Hewitt (1994): Condorcet: Foundations of social choice and political theory. Elgar, Brook.eld, V T [41] McLennan, Andrew (1998): "Consequences of the Condorcet Jury Theo•'  rem for Beneficial Information Aggregation by Rational Agents." ican  Political  Science  Review  Amer-  92: 413-18.  [42] Meirowitz, Adam (2001): "Informative Voting and Condorcet Theorems with a Continuum of Types." Mimeo, Stanford Graduate School of Business. [43] Miller, Nicholas (1986):  "Information, Electorates and Democracy:  Some Extensions and Interpretations of the Condorcet Jury Theorem." In Information  Second  omy, JAI  University  Pooling  and Group  of California,  Decision Irvine,  Making: Conference  Proceedings  of the  on Political  Econ-  ed. by Bernard Grofman and Guillarmo Owen. Greenwich, CT: Press.  [44] Morton, Rebecca B. and Kenneth C. Williams (2000): Learning ing:  Sequential  Choices  in Presidential  Primaries  and Other  Ann  Arbor, Michigan: University of Michigan Press.  by VotElections.  [45] Mukhopadhyaya, Kalyan (1998): "Jury Size and the Free Rider Problem."  Mimeo, Indiana University, Bloomington.  [46] Persico, Nicola (2004): "Committee Design with Endogenous Information." Review  of Economic  Studies,  forthcoming.  102 [47] Radner, Roy and Joseph Stiglitz (1984): "A Nonconcavity in the Value of  Information." In Bayesian  Models  in Economic  Theory,  ed. by  Michael Boyer and Richard Khilstrom. Elsevier Science Publishers  B.V.  [48] Rogoff, K. (1985): "The Optimal Degree of Commmitment to a Monetary Target." Quarterly  Journal  of EconomicslOO:  116989.  [49] Sah, Raaj Kumar and Joseph Stiglitz (1986): "The Architecture of Economic Systems: Hierarchies and Polyarchies." American  view  Economic  Re-  76: 716-27.  [50] Sah, Raaj Kumar and Joseph Stiglitz (1988): "Committees, Hierarchies and Polyarchies." Economic  Journal  98: 451-70.  [51] Wit, Jorgen (1998): "Rational Choice and Condorcet Jury Theorem." Games  and Economic  Behavior  22: 364-76.  [52] Wolinsky, Asher (2002): "Eliciting Information from Multiple Experts." Games  and Economic  Behavior  41: 141-60.  [53] Young, Peyton (1986): "Optimal Voting Rules." Journal  Perspectives  (Winter) 9: 51-64-  •-  ••  of  Economic ' -  [54] Young, Peyton (1988): "Condorcet's Theory of Voting." American litical  Science  Review  82: 1231-44.  Po-  103  A. Appendices A.l  Appendix to Chapter 2  A.1.1  Proof of Lemma 2.3  Proof.  W e first express V (m + 2; q ) — V (m; q ) e x p l i c i t l y i n terms of the D  D  parameters as the following:  V(m. + 2;q )-V(m;q )= D  .  D  .  :  ~  {  _  JP* ^ ~  x  :  2\  x=fi.,(m)+l  x=0  m x=R {m) s  \  ^  X  /  '  \  m  +  * 2  _  x  (  1  _  ( 1  p ) : r (  " 1  TO)  _  y r ) f / / j  104 To prove this lemma we first show that for a generic 1 < R < m,  E  (™y  x=0  ^'  - E {  (i - v) m  x  v  m+  x=0  ' m  +  x  ^  '  pr +2  x  '  ^ {Vl - p )  l  (i -  7  m + l  "  - p {-^-{l-p)\ \m+l R  R  r  (A.2)  and  E  E r V ^ i - p f x=R ^  '  \\)p  x-R+X ^  -  m + 2  a  x  -  P)  X  '  We use the method of induction to prove the above results. For notational convenience we write  * ( ) =E  (TV  R  (! - p )  m _ x  - E  (  \  m+ x  x  (! - p )  m + 2 _ x  and TO  V'(i2)  /  = E( X=H  W  \ m  •  TO+2  )p " ( -p) m  s  1  '.  a  .  .  I  9\  E l  X=R+I \  p x  - a-p) x  x  y  For R = 1, the first equality holds. That both tion [A.2] are equal to p (1 — p ) — (m + 1) p(l — p ) m  m+2  and m + 1  of equa-  can be verified after  some algebraic manipulation. Now suppose that the equality holds for some arbitrary R. We show that then the equality holds for R + 1. We need to  105 show that  '  ( f l + [ )  -  l's+0 - " ~ (1  R  {£TT - <> - <  V + 1  -  A  4  >  But, m-R+l  m+l\  ,  m  +  l-R  {  R  R  by induction hypothesis. After cancelling (1 — p)  m  R  p from equation [A.4] R  and some simplification we are left to prove the following: m  \  ,  fm + l\ ,  s - i ; ' - " - I «J 1  H  ( 1  H)  P _  fm + 2  (\ m  p )  2  +  ('R+1 ) 1  UrU+iJ P ( 1  "  p ( 1  -  p )  P )  which can be shown to be true using the fact that ( ^ ) — (") = { ™i)n  1  x  Next we consider the second equality. That equation [A.3] holds for R =  m can be seen from verifying that both LHS and RHS of [A.3] are equal to p (1 — p) — mp (1 — p ) 2  m  m + 1  . Suppose equation [A.3] holds for some arbitrary  R + l. We will show that then it will hold for R. The induction hypothesis  106 tells us that V (R + 1) = (Rtl)P ~ m  4>(R)  R  {P - S i ) •  (1 -  N o w  >  = ^(i?+i)+(^)p - (i-p) -(^ )p -^ (i-p) m  f i  i i  2  m  1  i ? + 1  1  R+ij  r  +  (  v  jp-«  (1 _  fl  r  r /  p )  «_  ™+i  +  ]  i  ^  (1 - p)  We need to show that  ^  O^^" * { " ^Ti) •  {R)=  After cancelling p  m _  1 (  1  p)  '  P  (A 5)  - (1 — p)^ from both sides of equation [A.5] and some R  simplification we are left to prove  i> (i  UJ - U)^U+i> " (1  -  p)  fl+  p)+  m +l \  (1  p)  / m  2  (fix)-  which can be shown to be true again using the relation ( ^ ) — (") = n  1  Since equations [A.2] and [A.3] hold for a generic R,, we-can now write  V (rri + 2; qjj) — V (m; QD) in the following manner: V(m =  TT  + 2;q ) - V { m ; q ) D  D  (1 - q ) 0 (R (m)) + (1 - TT) q ^ (R (m)) D  s  D  = (* ^ V - pr +i  \R (m)J s  +  m+l-R (m) p^-KW n  s  Mm)  s  P^ { -  [m+l /-• ^ ^ (^m> ) / „p - Rs (m) (1 _- p) (1 m+l H  m  (i - P) } - (i -  (M)  J T T ) q  D  \  (A.6)  107 Suppose that V (m; qo) — V (m — 2; qo) > 0. We first consider the case when  < I < . If ^ g l > l - p , then V (m + 2; ) - V (m; q ) > 0.  ttl  p  Suppose  to  < 1 - p. Then V (m + 2;  (1 _  (  1  _  p  p  m+i-«.M * (  )  p  - H  r  s  (  m  ^  )  s  s  (  m  )  - V (m; q ) > 0 if and only if D  m ) 7 r  (i _ ^ )  _  r  l  7  (  1  _  t  s  o  /?., (m) - 1 ' m- 1  <  _  p  ^ g l  p - ^ g i  )  But, /? (m) 1 m+l~2  D  R (m)  1 m + l ~ 2 s  < _  <  Hence, using R (m — 2) = Z? (m) — 1 from Lemma 2.2 in equation [A.6] and s  s  writing m — 2 in place of m we find V(m;q )  -V(m-2;q )  D  '  U  D  M -1)  >o  m-ii.M  p  {  S  inC  e  1  1  _  p  )  ^  _  p )  5  m-1  1  -  P  r  ~  «.(m)-l  m - R s ( m )  - - ^ p  ( 1  K l  p  M  m  )  >  _  ^  M  m  (  1  _ ^  l  n  {  1  )  _  q  {^  _  1  D  p  _  1  -  ( 1  P )  } ^  ( 1  -  q  ^Mzl  p-M^l  )  when *-<">- < F  -  '  .  ^  m + l  1/ (m; to) - V {m - 2;q ) > 0 D  V {m + 2;q ) - V [m; q ) > 0.  Now consider the other possibility that  D  D  > ^ > 1 - p. If ^ f f i < P,  D  )  108 then V (m + 2; q )-V  (m; to) > 0. Suppose f^  > p. Then V (m + 2; to)-  R  D  V (m; to) > 0 if and only if p  m+l-« (m) s  {I - p )  m + 1  (  -  1  _ R.(m) p)  R s { m )  _ ^  ( 1  ( 1  _  ^M-l  p )  ( 1  r  ^  > i  m+l  > ^tr  2  _  p ^ h (I - q )  (l_p -«.(-)pfl.(m)-l  '  ^ )  _  M  p  )  P  _  ( 1  _  p )  ^ - p  g | ? )  > I Hence,  m+l  m—1  _ ^ 7 r ( 1  _  ( 1  ^ 1  D  pm-^W  But,  ^  2  '  V (m; q ) — V (m — 2; q ) >0 D  W  r  ^ Since oincc ^ -  (1 - p ) * ^ ) - (1 - vr)^ ^  (1 - ) — ^ M  p^M-%  P  (  1 flj(m)  m+l  -  p  )  >  ;>  r  D  - (1 - p )  1  )  - p  <  to  en ^ W > M a i, wnen _j - .> 1  S^-t-* K (m)-i  w h  s  771-1  (1 -  m  m + 1  ^  V (m; <?o) - y (m - 2; to) > 0 =^ K (m + 2; to) - V' (m; to) > 0 in this case as well. This completes the proof of the lemma.  A.1.2 Proof.  Proof of. Lemma 2.4  |  x  We have to deal with two cases separately:  Case 1: pj > 1; The jury puts relatively higher weight on acquitting the guilty. Case 2: pj < 1. The jury puts relatively higher weight on convicting the innocent.  109 • Case 1: pj > 1. The uninformative decision of the jury in this case is C. Hence, V (0; qp) — ir)q .  -(1 -  D  Now suppose n is the smallest positive integer such that ajury of size 0  n votes informatively. Then R (no) = R (no + 1) = 1. For any n < no, the s  0  s  jury votes uninformatively for C. Hence, R (no) = 1. Now R (no + 1) — 1 or s  s  2 by Lemma 2.2. For any n > 1, if R (n + 1) = 2, then again by Lemma s  0  0  2.2, R (no — 1) = 1 contradicting the hypothesis that no is the smallest s  integer such that the jury votes informatively. For no = 1, R (2) = 1 follows s  directly from the fact that pj > 1. We will argue that V (n ; q ) > V (0; q ) D  0  V (n + 2; q ) > V (n ; q )  D  D  0  0  D  and V (n + 1; q ) > V (0; q ) => V (n + 3; q ) > V (n + 1; q ) . Then an 0  D  D  D  0  D  0  application of Lemma 2.3 will be sufficient for the proof in this case. Suppose V(no]qo) that (1 — TT) qoP °  > V(0;qD)-  Then, using R (no) s  — 1, we can show  > TT (1 — qjj) (1 — p) ° follows. As shown in the proof of  n  n  Lemma 2.3, we can write V (n + 2; q^) — V (n ; qo) as 0  0  V (n + 2; q ) - V (n ; q ) Q  D  n +1 1  0  ^ ( l - q  D  D  ) ( l - p ) ^  p  [ ^ - ( l -  )  p  0  + (l-TT)q p °(l-p)  (p-^j D+l  n  D  >  1'^+  1  M i - 9 * ) u - p r ( l - p ) (p  1 n +1  + p  n +1  (l-p)  0  0  > 0 where we made use of the fact (1 — IT)  qoP  710  >  vr (1 —  qo)  (1 — p) ° n  and  110 The subcase for V (no + 1; qo) > V (0; qo) can be treated similarly. Case 2: pj < 1. The uninformative decision of the jury in this case is A. Hence, V (0; qo) = - q) .  -TT(1  D  Again, as in Case 1, suppose no is the smallest positive integer such that a jury of size n votes informatively. Then R (no) — no and R (no + 1) = 0  s  s  no + 1. For any n < no, the jury votes uninformatively for A. Hence, R (no) = s  no. Now R (no + 1) = n + 1 or n by Lemma 2.2. For any n s  0  0  0  > 1, if  Rs ( o + 1) = "-Oi then again by Lemma 2.2, R (no — 1) = no — 1 contradictn  s  ing the hypothesis that no is the smallest integer such that the jury votes informatively. For n-o — 1, R (2) = 2 follows directly from the fact that s  PJ  <  1.  Now we can proceed similarly as in Case 1 to show that V (no; qo) > V(0;q ) => V (n + 2; q ) >,V(n ;q ) D  V(n  Q  0  D  + l;q )>V{n  A.2 A.2.1  D  0  D  and V(n  + 3;q )-  0  D  0  + l;q ) D  > V(0;q ) D  I  Appendix to Chapter 4 Proof of Lemma 4.3  Proof. In writing b (TT; I) explicitly in terms of the parameters, we have to 2  consider two separate cases. Case I: II (a q ) > U (q qi) h  h  u  Ill Using equations [4.10] and [4.9], we can write Ph-p b (n;l) 2  2  -2pi{l-pi)n Ph-v  =<  PhPi ~ [PhPi + (1 -  <Il(q ,qi)  if TT  l  iiU(qi,qi) Ph)  (1 -  Pi)]  TT  <n  if IT (a,, q ) < TT h  0  <U(ai,q ) h  <  fl  (qi,q ) h  otherwise.  Hence, in this case, b (TT; I) is continuous and strictly decreasing in TT for all 2  \ <7T  <U(q q ). h  h  Case II: II (ai,q )  < II  h  Again using equations [4.10] and [4.9], b (TT; I) can be expressed as 2  p b (ir;l) 2  h  - p ] - 2pi (1 -PI)TT  {Ph ~ Pi) [Pi ~ (2pi - 1) TT]  = {  if TT < if II (ai, q )  U(ai,q ) h  < TT < U  h  (q qi) u  PhPi ~ [PhPi + (1 - Ph) (1 - Pi)] TT if II (q , q ) <TT < n (q q ) t  0  .  t  u  h  otherwise.  Here also, b (TT; I) is continuous and strictly decreasing in TT for all \ < TT < 2  fl {qi,qh) •  Hence, irrespective of the parameter configurations, b (TT; I) is mono2  tonically decreasing in TT. Moreover, b (TT; I) = h — Pi > 0 at TT = | and 2  P  b (TT; I) = 0 at TT = n ((ft, g ). Therefore, any 0 < c < ph — Pi will induce 2  h  a unique cutoff fti (c) e (|, n TT < 7f(  (c) .  q )) such that b h  2  (TT;1)  > c if and only if  |  112  A.2.2 Proof.  Proof of Lemma 4.4 We first express b (TT; h) in terms of the parameters of the model using 2  equations [4.8] and [4.10]: p + 2p (l  - p )ir  2  h  b (7f,h)=  - p  h  (Ph - Pi) [Ph (1 -  {  2  h  7r)  + (1 - p ) h  TT]  p (l- r) + (l-p,) 7r 2  (ai,q )  if TT < II  h  2  7  h  if IT (ai, Qh)  <  iiU(qi,q )  < TT <  h  7T  < II (q , q ) t  h  Tl(q ,q ) h  h  otherwise.  0  Notice that b (TT; h) is throughout continuous in TT and has a unique maxima 2  at II (a q ). u  Hence, any c < max b (TT; h) = p^ilpjj+fi^p, = o> induces 2  h  c  x  an interval [TTQ ( C ) , TT\ ( C ) ] such that for TT 6 [TTQ (c) , TT^ ( C ) ] , b (TT; h) > c. 2  Since b (\;h) = b (U (q , q ); h) = 0 and b (Tl (a , q ); h) = c , c < c 2  2  2  h  h  (  Proof.  h  0  0  and TTJ ( C ) G (II (a , q ) , II (g , %)).  implies TT^ ( C ) € (|, II (a ,  A.2.3  L  |  1  (  h  ft  Proof of Proposition 4.1 First  Part:  = I for 7r > p/i — c can be seen from Lemma 4.1.  For any c,  For c < C\,  TTI (c) >. ph — c. Hence from Lemma-4.4, {I, /)-cannot be an equilibrium for 71-1  S  (ph — c, Tti (c)]. Since we already argued that a pure strategy equilibrium  always exists, T * must be (h,l) or (l,h) or (/i,/i) in this zone. Now consider 2  the case where b (TT,h) 2  TT\  (C)  >  Hi  (C)  7r €  (ff(  (c), 7r^ (c)],  b (TT;1) 2  < c, but  > c. Hence, in this zone we have a (1,1) equilibrium, but we also  have (h, h) as an equilibrium. Second  . For  Part:  113  Sufficiency  •'  ,  •  Suppose c > c . Then TT < VH — c is sufficient for T{ = h by Lemma 4.1. 2  For c >  C2,.7f;  (c) < Ph — c. Hence, for  TT. G  (#; (c), ph- — c\, (h, I) or (/, h) cannot  be an equilibrium by Lemma 4.4. We now need to show that (7i, h) cannot be an equilibrium in this zone. We have to consider two separate cases. Case I: U(ai,q )  U(q qi)  >  h  In this case, ir  h  = U(q qi).  l  Hence,  h  mia  c  2  =  6 (n(g,,g0) a  =  Ph~Tl{qi,qi)  >  p -U(ai,q ) h  h  Ph (1 ~ Pi) p (l - pi) + pi (1 - p ) Ph (1 - Ph) (2pi ~ 1) p (l -pi)+pi(l - Ph)'  =  Ph  h  h  h  Since b (TT; h) is strictly increasing in TT for all TT G [|, IT (a , q )}, 2  ;  b (U(qi,qi)  ;h) < c along with Yl(qi,qi)  2  < U(ai,q )  implies that for any  h  2  h  TT < n (r/ , g ) and c > c , 6 (7r; //,) < c. The required condition can be easily 2  (  (  2  verified as follows:  b (H(q 2  h q i  );h)  =  h(l-Ph)(2U(q ,q )-l) Ph(l-p )(2pi-l) P  l  l  h  P? + ( I - W ) <  <  P  c. 2  2  h (1 - Ph) (2p< - 1)  114 Since for any c > c , Ph — c < U (qi,qi),  hence for any TT < Ph — c, (h, h)  2  cannot be an equilibrium. We know that for all parameter configurations a pure strategy equilibrium exists. Hence, (/, I) is the only pure strategy equilibrium which is the unique equilibrium by virtue of Lemma 4.2. Case fl: U(ai,q )  <  h  Here c = b TT  G [U(a q ) h  ( 7 ^ ) .  ,Tr - ]  TT  L MIN  € (II (a q ) , II {q , q )). h  h  t  t  Hence, for any  ,  l  h  where  2  2  Tl(qi,qi)  m m  b (n;l) = ( p - p ) [ p ( l - 7 T ) 2  h  l  l  + (l-p )n] l  and b  2  h) = (p - pi) [p (1 — ?r) + (1 — p )  (TT;  h  h  h  TT] .  Since re > \ in this range, b (n; I) > b (n; h) for all 7r G [ii {a q ) 2  2  u  , 7r^ ] .  h  in  Moreover, since b (IT; I) is strictly decreasing for all 7r and b (TT; h) reaches 2  2  its maximum at n (a , q ), b (TT; I) > b (TT; h) for all TT G [|, ir ] 2  t  TT > 7 t i ( c )  2  h  l  min  • Hence,  implies b (TT;K) < c. Therefore, (h, h) cannot be an" equilibrium 2  outcome. Since we know that for all parameter configurations a.pure'strategy equilibrium exists, T * = (/, I) is the only pure strategy equilibrium for 2  TT G (fi (c) ,ph — c], which is the unique equilibrium by virtue of Lemma 4.2. Necessity  For c > c , TT > ph — c implies Tj* = I and TT < fi (c) implies T * includes 2  2  at least one h by Lemma 4.4. For c < c ,7f/ (c) > Ph — c for all c and hence 2  Tj* = h implies T includes at least one h, again by Lemma 4.4. 2  |  115  A.2.4 Proof.  Proof of Proposition  4.2  It is evident that T{ — h and T * = (/, I) are necessary for the 2  smaller committee to dominate the larger committee. For any c > c , the 2  existence of such situation is guaranteed by Proposition 4.1. In our rel2  evant zone, V (h) > V (l,l) l  that p ^min <  ^min  > l p2+(  h  p  2  +  (  i L  P  i  if and only if TT < 2^(1- )- First consider  2  Pi)2  )  2  < 2Mi-p,)-  ,  Pl  Then it follows that  >  i n  H e n c e  2pi  (1  pi)  2  h  2  Now suppose p < h  Since ft  p ? +  ;_  w ) 2  p +  pi)2  V (l,l). 2  r,2  . This implies that  „2  < pi+ff^a- If  2p°i(\-pi)' then by the same argument as in the preceding paragraph,  T; = / i and T * = (Z,Z) are sufficient for V (h) > V {l,l). l  Now suppose  2  2  mm  .  for  T; = / i and T * = (i,Z) are sufficient for V {h) >  TT'm  p | ) 2  therefore < < " ? . Now, for any c > c , p - c < > parameter values such that p > i fl_ , l  """Lin ^  /_  p p ? + (  >  v  N o t i c e  t h a t  2pi(l-pi)  o 'n ' ^ > o V/ P  V  P  2p,(l-p,)  such that O (TTI(C); /)•= c. Since b (Tr;:l) l i m ^ i b (TT;l) = ph-pi 2  ^ = i  We have defined f,(c) 2  ' w  is continuous, strictly decreasing in 7r,  2  2  1  2p,(l-p,)  and 6 (7rJ ;Z) = c , there exists c € (c ,Ph-pi)  thatTf^e ( i . a ^ y ) .  2  2  2  nin  Now for any  7TG (ff (c), ;  min { ^ ^ y . P / , -  such c}) ,  T* = / i and T* = (Z, Z) and V (h) > V (l, I). This completes the proof of the l  proposition.  2  |  

Cite

Citation Scheme:

        

Citations by CSL (citeproc-js)

Usage Statistics

Share

Embed

Customize your widget with the following options, then copy and paste the code below into the HTML of your page to embed this item in your website.
                        
                            <div id="ubcOpenCollectionsWidgetDisplay">
                            <script id="ubcOpenCollectionsWidget"
                            src="{[{embed.src}]}"
                            data-item="{[{embed.item}]}"
                            data-collection="{[{embed.collection}]}"
                            data-metadata="{[{embed.showMetadata}]}"
                            data-width="{[{embed.width}]}"
                            async >
                            </script>
                            </div>
                        
                    
IIIF logo Our image viewer uses the IIIF 2.0 standard. To load this item in other compatible viewers, use this url:
http://iiif.library.ubc.ca/presentation/dsp.831.1-0092918/manifest

Comment

Related Items