A Note on Preference Uncertainty and Communication in Committees 1

Size: px
Start display at page:

Download "A Note on Preference Uncertainty and Communication in Committees 1"

Transcription

1 A Note on Preference Uncertanty and Communcaton n Commttees 1 Davd Austen-Smth MEDS, Kellogg Graduate School of Management Northwestern Unversty Evanston, IL Tm Feddersen MEDS, Kellogg Graduate School of Management Northwestern Unversty Evanston, IL July We are grateful for the nancal support of the NSF under grant SES

2 Abstract In a recent paper, Austen-Smth and Feddersen (APSR 2006) have argued that truthtellng n commttee delberatons s more lkely under nonunanmous votng rules when ndvduals prvate nterests, or bases, are not common knowledge. The result, however, does not mply that such bas uncertanty s necessarly welfare mprovng n some approprate sense. Ths Note suggests that bas uncertanty s n fact welfare mprovng and, further, argues that even when commttee members prefer that bases be shared, there need not exst any cheap talk equlbra n whch ndvduals can credbly reveal such nformaton.

3 1 Introducton It s well understood that when commttee members vote under ncomplete nformaton, the resultng commttee decson need not re ect the decson that would have been made under fully shared nformaton (eg Austen-Smth and Banks 1996; Feddersen and Pesendorfer 1998). But people n commttees often talk before votng and so have an opportunty to share decson-relevant nformaton. Over the past few years there has been a growng strategc game-theoretc lterature concerned to understand better what mplcatons such communcaton mght have for the character and qualty of collectve decsons under ncomplete nformaton. 1 One ssue here concerns how d erent votng rules for reachng a nal collectve choce n uences the nformaton that mght be shared n any pror debate. Gerard and Yarv (2007) suggest that the votng rule (essentally) s rrelevant, but ther argument hnges on usng domnated (debate-condtonal) votng strateges. Assumng undomnated votng changes the pcture (Austen-Smth and Feddersen 2005). And n ths case, t turns out that whether or not ndvduals full nformaton preferences over avalable collectve choces, more succnctly, ther bases, are common knowledge plays a crtcal role. 2 In ths Note, we explore some normatve consequences of preference uncertanty for the qualty of collectve choces under ncomplete nformaton. It s useful rst, however, to revew bre y the motvatng postve results on the mplcatons of such uncertanty for nformaton sharng n debate. To x deas, consder the canoncal example of a jury that has to vote over whether to convct or acqut a defendant. The gult or nnocence of the defendant s subject to uncertanty. Each juror prvately observes an nformatve but nosy sgnal from a gven set of possble sgnals regardng the nnocence or gult of the defendant. If the defendant s truly gulty, then the probablty of any juror recevng a sgnal suggestng as much s strctly greater than the 1 For example, see: Austen-Smth 1990; Calvert and Johnson 1998; Coughlan 2000; Doraszelsk et al 2003; Gerard and Yarv 2007; Merowtz 2006, 2007; Hafer and Landa 2007; Austen-Smth and Feddersen 2005, 2006; Callaud and Trole An ntuton noted too n Merowtz (2007). 1

4 probablty the juror receves a sgnal suggestng nnocence, although there s some lkelhood of such an nnocent sgnal s receved; and smlarly wth respect to nnocent sgnals condtonal on the defendant beng truly nnocent. Jurors also have possbly d erent atttudes (bases) regardng just how much such nformaton su ces to convnce them of gult. For example, f there are only two possble sgnals, some juror mght requre all commttee members to have receved the "gulty" sgnal before they are wllng to convct, whereas another could be wllng to convct on the bass of only one such sgnal among the jurors. As wth ther sgnals, ndvduals bases are prvate nformaton. The commttee uses some q-rule to make the nal decson, where a q-rule s a votng rule under whch convcton s chosen f and only f t receves at least q votes, where q s at least a majorty of the jury. The jury may or may not delberate pror to votng, where delberaton conssts of jurors makng costless (so-called cheap talk) speeches regardng any decson-relevant nformaton they may have (n partcular, ther prvate sgnals). In a very general settng of the sort descrbed above, Coughlan (2000) demonstrates that full (collectve decson-relevant) nformaton sharng under complete nformaton about commttee members bases s mpossble under any q-rule unless all ndvduals have dentcal full nformaton ordnal preferences over the alternatves. Austen-Smth and Feddersen (2006) go on to show that Coughlan s result s senstve to the full nformaton assumpton on commttee members preferences: so long as the rule s not unanmty rule (.e. q s less than the total number of commttee members) and there s uncertanty about both ndvduals preferences and sgnals, then there always exst some crcumstances under whch full nformaton sharng of sgnals n debate s possble, thus nducng the same decson as would be made were all sgnals revealed smultaneously to all jurors. On the other hand, f the jury or commttee uses a unanmty votng rule then preference uncertanty no longer provdes any possblty for full nformaton sharng n debate; there s always some type of ndvdual wth a strct ncentve to dssemble n debate and, therefore, the veracty of any nformaton conveyed n ndvduals speeches s generally suspect. 2

5 The key ntuton underlyng the results s that bas uncertanty admts the possblty that any speaker belongs to the de facto wnnng coalton under complete nformaton, a possblty that provdes an ncentve for truth-tellng n debate. In contrast, when all ndvduals bases are common knowledge pror to any debate, then those n any losng coalton under full nformaton have no ncentve to share nformaton that mproves the chances of the decson that would be most preferred under full nformaton by a wnnng coalton (see also Merowtz 2004, 2007). By themselves, the precedng results do not mply that unanmty rule s n general nferor to any other q-rule. It s possble that unanmty rule performs better on average than other rules despte the fact that full nformaton sharng n debate s (at least, on grounds of strategc ratonalty) mpossble. More generally, an mportant problem s to dentfy the optmal rule for commttee choce under ncomplete nformaton wth debate. 3 Ths problem s partcularly challengng f we nsst that ndvduals votng strateges are undomnated condtonal on the realzed debate, a requrement that opens up the possblty, as llustrated by results sketched above, that votng rules a ect the ncentves for delberaton. 4 A more lmted welfare queston concerns the extent to whch the de facto commttee decson under a gven votng rule wth ncomplete nformaton and debate re ects the commttee s decson condtonal on all prvate nformaton beng common knowledge at the tme of the vote (e.g. McLennan 1998; Federsen and Pesendorfer 1997). Equvalently, gven the rule, the goal s to maxmze the aggregate expected payo of those n the full nformaton wnnng coalton. And the ntuton suggested by the results above s that, at least for nonunanmous q-rules, bas uncertanty can mprove the welfare of the full nformaton wnnng coalton by facltatng more nformaton sharng n 3 Chwe (2006) derves the optmal votng rule when there s no debate. Interestngly, ths rule turns out to be nonmonotonc n votes and s thus not a q-rule. 4 In a very general framework, Gerard and Yarv (2007) show that all non-unanmous q rules are equvalent n that the sets of sequental equlbrum outcomes nduced by any such rules are dentcal once votng s preceded by delberaton. However, the assumptons supportng ths result do not nsst that votng strateges are undomnated condtonal on the realzed debate. 3

6 debate: as already observed, when ndvduals are not sure ex ante whether they are members of the full nformaton wnnng coalton, then they have an ncentve to reveal prvate nformaton n debate that s absent when they are con dent they are not members of ths coalton. Unfortunately, even restrctng attenton to q-rules, addressng the latter welfare ssue drectly s complcated by havng to descrbe the full equlbrum set to any more or less general ncomplete nformaton (debate and votng) game nduced by the rule (see for example Austen- Smth and Feddersen (2005) or Dorazelsk, Gerard and Squntan (2003) on ths ssue). At ths stage, no such characterzaton s avalable. 5 So rather than attempt a general result here, we nstead explore the welfare mplcatons of bas uncertanty n the context of much smpl ed commttee structure predcated on the observaton that when strategcally ratonal ndvduals are choosng a best response strategy for nformaton sharng n debate, they condton on the event that ther partcular speech s message pvotal; that s, that f they say one thng then the resultant commttee vote leads to one alternatve whereas a d erent speech nduces a commttee decson n favour of the competng alternatve. In e ect, therefore, t s as f the speaker were addressng the (possbly hypothetcal) pvotal member of the commttee whose preferences (bas) and nformaton on the relatve value of the two alternatves s prvate nformaton to that pvot. Thus the smpl caton s to consder the commttee as comprsng two ndvduals, one of whom s an advsor (the speaker) and the other the decson-maker (the pvot for the commttee decson). 2 The model Consder a commttee of two people n whch one xed ndvdual has the rght to make the commttee decson between a xed par of alternatves fx; Y g. Each ndvdual = 1; 2 has prvate nformaton (b ; s ) 2 fx; yg fx; yg, where b s a preference parameter, or bas, and 5 Lkewse, the optmal mechansm here s as yet unavalable n general. Chwe s (2006) result for majorty votng wth ncomplete nformaton suggests such a mechansm wll be complex. 4

7 s s a nosy but nformatve sgnal regardng the alternatves. Let (b; s) = ((b 1 ; b 2 ); (s 1 ; s 2 )) denote a pro le of realzed bases and sgnals. Assume sgnals are uncorrelated wth bases. Let the pror probablty on each sgnal s 2 fx; yg be 1=2 and suppose that, all, for dstnct ; j 2 f1; 2g Pr[s = s j js ] = p 2 (1=2; 1): Assumng p 2 (1=2; 1) nsures sgnals are both nformatve and nosy. For each = 1; 2, suppose that whle the pror probablty that b = x s 1=2, realzed bas types are correlated; that s, for dstnct ; j 2 f1; 2g Pr[b = b j jb ] = 2 [0; 1]: If = 0 they have con ctng preferences wth probablty 1 whereas f = 1 both have dentcal preferences. As suggested earler, the dea here s that the decson-maker s a proxy for the pvotal voter de nng the wnnng coalton under a q-rule n a larger commttee, and the other ndvdual (the advsor) s unsure whether she too s a member of that wnnng coalton. Hereafter, let ndvdual = 1 be the advsor and ndvdual = 2 be the decson-maker. Wrte u(z; b; s) for an ndvdual s payo from the collectve choce Z 2 fx; Y g, gven that ndvdual s bas s b 2 fx; yg and the pro le of sgnals s s 2 fx; yg 2. Assume 8 < 0 f s = (y; y) u(x; x; s) = : 1 otherwse u(y; x; s) = 1 u(x; x; s) 8 < 1 f s = (x; x) u(x; y; s) = : 0 otherwse u(y; y; s) = 1 u(x; y; s) Thus, a bas type b = x (respectvely, b = y) strctly prefers alternatve X (respectvely, Y ) unless both sgnals consttute evdence for Y (respectvely, X). We consder two communcaton protocols. In the rst protocol there s a sngle "debate" stage n whch the advsor makes a cheap talk speech regardng her sgnal, followng whch the 5

8 decson-maker chooses X or Y. Wthout any real loss of generalty, we assume the avalable messages are smply the sgnals, fx; yg. For the second protocol, we add an earler debate stage n whch both players can declare ther bases (agan, through cheap talk speeches) followng whch the advsor sends a message regardng her sgnal as before and, nally, the decson-maker makes a decson. Note that, because an ndvdual s payo s, gven her bas, depend exclusvely on the nal decson and the pro le of realzed sgnals s, there can be no value n sgnalng both bas and sgnal smultaneously or of havng a debate on sgnals pror to makng any statements regardng bases. Thus the role of permttng bas revelaton early n any commttee dscusson s to mprove the possblty of coordnaton between commttee members. Begn wth assumng only a sngle message stage n whch the advsor makes a speech about her sgnal. Strateges are as follows: : fx; yg 2! fx; yg s a debate strategy wth (b; s) beng the probablty that the advsor (ndvdual 1) wth bas b and sgnal s declares "s = x"; and v : fx; yg 3! fx; Y g s the decson-maker s decson (vote) strategy wth v(b; s; n) beng the probablty that the decson-maker (ndvdual 2) wth bas b and sgnal s who hears a message n 2 fx; yg from the advsor chooses X. Let (s; ) fx; yg be the set of messages sent wth strctly postve probablty when sgnal s s observed. De nton 1 A message strategy s fully revealng f (x; ) 6= (y; ). As de ned here, fully revealng message strateges may or may not reveal nformaton about the advsor s bas. Because an ndvdual s preferences depend only on the par of sgnals and on ther own bas, f a message fully reveals the state then addtonal nformaton about the other s bas s decson-rrelevant. Thus the key feature of a fully revealng message strategy s that t provdes full nformaton about the speaker s sgnal. A fully revealng debate equlbrum (FRDE) for the one-stage debate protocol s a Perfect Bayesan Equlbrum (; v) such that s fully revealng and v s a weakly undomnated votng strategy. Hereon, we economze on notaton by wrtng b s for the probablty an advsor wth 6

9 bas type b and sgnal s sends message x; and wrtng vs(n) b for the probablty the decsonmaker wth bas b; sgnal s who hears message n chooses X. Proposton 1 There exsts an FRDE (1 p). If < (1 p) the advsor cannot reveal any nformaton n equlbrum and the decson-maker chooses wth hs sgnal. Proof: Wthout loss of generalty, we can suppose that n a fully revealng equlbrum we have, for all, b x = 1 b y = 1 for every b 2 fx; yg. In ths case the best response strategy for a decson-maker wth bas b who observes sgnal s 0 and hears message s from the advsor s 8 1 f (s; s >< 0 ) = (x; x) 8b vs b 0(s) = 1 f (s; s 0 ) 2 ffx; yg; fy; xgg and b = x >: 0 otherwse The ncentve compatblty condtons for a FRDE are obvously sats ed for the decsonmaker snce he s correctly choosng as f he were fully nformed. So, we only need to check the IC constrants for the advsor. Wthout loss of generalty, assume the advsor has bas b 1 = x. Then t s trvally the case (mod nversons of natural language) that she surely reveals a sgnal s 1 = x. So suppose she has observed s 1 = y. There are only two pvotal events n whch the advsor s message a ects the outcome here: ether the decson-maker shares the advsor s bas (x) and has observed a sgnal s 2 = y; or the the decson-maker has the opposte bas (y) and has observed a sgnal s 2 = x. In the former event, the advsor s best response s to tell the truth and reveal s 1 = y; n the latter event, the advsor s best response s to le and clam s 1 = x. The condtonal probablty of these two events s, respectvely, p and (1 )(1 p). Therefore the sender s wllng to tell the truth when she has sgnal y p (1 )(1 p); that s, (1 p). If < (1 p), then clearly the advsor has a strct best response to announce \s = b rrespectve of her sgnal and no nformaton s credbly conveyed n debate 7

10 (the decson-maker can always reveal hs sgnal n debate, but ths s of no consequence for the nal outcome). Hence the decson-maker must choose on the bass of hs own nformaton. Suppose, wthout loss of generalty, that b 2 = x. Then player 2 has a domnant strategy to choose X condtonal on s 2 = x. If s 2 = y, however, hs payo from choosng X s (1 p)=2 whereas that from choosng Y s p=2. Snce p > 1=2, the best response s to choose Y. It s worth emphassng that a FRDE can exst here for very small values of, dependng on just how nformatve s the sgnal, p: the more nformaton that any gven sgnal provdes, the less concern the advsor exhbts about the probablty of not beng a member of the de facto wnnng coalton. 6 Ths result s a drect analogue of the condtons de nng exstence of a FRDE for the case of q-rules n a commttee of more than two ndvduals (Austen-Smth and Feddersen, 2005, 2006), dscussed nformally n the Introducton, and shares the same fundamental ntuton (see also the Appendx to ths paper). In partcular, as made explct n the argument for the result, when decdng on her best message the sender condtons on beng message pvotal and there are (n ths model) two such events: n one the decson-maker shares the advsor s bas and sgnal; n the other the decson-maker has the opposte bas and sgnal. Although the dstrbutons of bas and sgnal are qute ndependent, the realzaton of bases and sgnals are lnked for the advsor through the event of beng message pvotal. And although whch event s relatvely more lkely depends symmetrcally here on both the nformatveness of the sgnal, p, and the lkelhood of bases beng the same,, n general, f s not too extreme the fact that a sgnal s nformatve shfts weght to the event n whch the advsor has an ncentve to tell the truth. The analytcal advantage of the two-person model studed here, however, s that, at least up to the mxed equlbrum for the nongenerc event = (1 p), the proposton completely descrbes the equlbrum set. Thus unlke commttees wth more than two persons and a q-rule, the welfare mplcatons of bas uncertanty n ths 6 We note too that even though there s no reason for the decson-maker to reveal hs sgnal n debate, there s also no reason here for hm not to do so credbly, a fact that motvates our equlbrum termnology. 8

11 nstance are easy to dentfy. Proposton 2 Assume the most nformatve equlbrum s played for every parameterzaton (p; ). (a) If > (1 p) then, ex ante, the decson-maker (respectvely, advsor) strctly prefers bases to reman secret (respectvely, revealed) before the game s played. (b) If < (1 p) then, ex ante, both players strctly prefer bases to be revealed pror to the game beng played. Proof: Suppose that both players bases are made common knowledge pror to the game beng played. Then ether they share the same bas, n whch case the most nformatve equlbrum s a FRDE, or they have opposng bases n whch case (as s easy to con rm) no nformaton s revealed by the advsor, player 1. The payo s to the two players are therefore: EU rev 1 = EU rev 2 = + (1 ) 1 + p To see ths, rst note that f bases are the same, all nformaton s revealed by player 1 and both players are assured a payo of one. Next, suppose the bases are revealed to be dstnct. Then no nformaton s revealed and the decson-maker can do no better than choose accordng to hs sgnal; that s, choose X s 2 = x. In ths case the sender (player 1) receves one ether s 1 = s 2, whch occurs wth probablty p, or her bas s x (respectvely, y) and s 2 = x (respectvely, y), whch occurs wth probablty (1 2 : p)=2. These facts yeld the expresson for EU rev 1. Smlarly, gven the bases are dstnct, the decson-maker obtans a payo equal to one ether s 1 = s 2 or her bas s x (respectvely, y) and s 2 = x (respectvely, y). Ths just es EU rev 2. Now suppose both players bases reman secret. If > (1 p) then there exsts a FRDE and the decson-maker obtans a payo EU pvt 2 = 1 surely. The advsor, however, receves payo one surely only f the bases are the same; f bases are d erent, then the advsor reveals her sgnal and receves payo one s 1 = s 2. Thus EU pvt 1 = +(1 )p. On the other hand, f < (1 p) then the only equlbrum nvolves no nformaton revelaton and the decson-maker 9

12 chooses accordng to hs sgnal. Hence, followng the reasonng for the case n whch bases are revealed, we obtan EU pvt 1 = EU pvt 2 = 1 + p 2 : Therefore, f > (1 p) the decson-maker gans (1 )(1 + p)=2 when bases are secret but the advsor loses (1 )(1 p)=2. And when < (1 p), both players strctly prefer bases to be revealed. If the lkelhood that the advsor s n fact a member of the wnnng coalton, n that she shares a common bas wth the decson-maker, s su cently large then the presence of bas uncertanty strctly mproves the welfare of that coalton (.e. the decson-maker) snce all decson-relevant nformaton can be shared n equlbrum. Because the two players agree about the desrablty of bas-revelaton when s su cently low relatve to p, however, t s nterestng to ask whether provdng an opportunty to coordnate drectly by revealng bases pror to debatng sgnals can mprove commttee performance. As remarked earler, the de nton of a fully revealng message strategy says nothng about whether or not the speaker reveals her bas b n debate; all that matters s that the speaker s collectve decson-relevant datum, her sgnal s, s unequvocally revealed. It s apparent, however, that f bases are revealed they have no e ect on any lstener s decson gven all sgnals are shared. The only reason for beng concerned about a speaker s bas s that such knowledge, or lack thereof, n uences a lstener s belefs about whether or not he or she s n the full nformaton wnnng coalton: f a commttee member knows that they are a member of the majorty n a commttee before any dscusson of sgnals, then that ndvdual s assessment of the lkely message pvotal events s surely a ected and, therefore, so s her wllngness to share collectve decson-relevant nformaton pror to votng. Thus f revealng nformaton regardng personal bas s relevant to the collectve decson, then t must be that bases are revealed pror to the dscusson of sgnals. So we suppose there are two cheap-talk debate stages pror to votng: n the rst, ndvduals send a message regardng ther bases, followng 10

13 whch there the second debate stage nvolves ndvduals sendng cheap-talk messages about ther sgnals. Strateges for the two-stage debate protocol are as follows. Let b;s 2 [0; 1] denote the probablty that ndvdual wth bas b and sgnal s announces her bas s x; gven bas-stage messages (m; m 0 ) 2 fx; yg 2 ; let b s(m; m 0 ) 2 [0; 1] s the probablty ndvdual 1, the advsor, wth bas b and sgnal s who has announced her bas s m and heard a message that the other player s bas s m 0, announces that her sgnal s x; and let v b s((m; m 0 ); (n; n 0 )) be the probablty the decson-maker wth bas b and sgnal s who announces bas m and sgnal n, hears the advsor s bas message m 0 and sgnal message n 0, chooses outcome X. Proposton 3 Assume each player has observed hs or her partcular bas and sgnal. If and only f 1=2, there exsts an equlbrum n whch each player truthfully reveals ther bas n the rst message round and (1) f the bases are the same, players truthfully reveal ther sgnal n the second round and the recever chooses on the bass of full nformaton; (2) f the bases are d erent, players smply announce ther true bas ndependently of ther sgnal and the decson-maker chooses wth hs sgnal. Proof: Consder the followng strateges (spec ed only for an x-based ndvdual; those for a y-based ndvdual are symmetrc): x;x = x;y = 1; = 1; 2 x x(m; m 0 ) = 1; 8(m; m 0 ) x y(m; x) = 1 x y(m; y) = 0 v x x( m; m 0 ; n; n 0 ) = 1; 8( m; m 0 ; n; n 0 ) v x y ((m; m) ; (; x)) = v x y ((x; y) ; (x; x)) = 1; 8m v x y ( m; m 0 ; n; n 0 ) = 0 otherwse 11

14 To con rm that ths strategy pro le consttutes an equlbrum f 1=2, we calculate where E[U b;s E[U x;x j x;x = 1; ] = E[U x;x E[U x;y j x;y (1 + p) = 1; ] = + (1 ) 2 E[U x;y j x;y (1 + p) = 0; ] = + (1 ) 2 j b;s j x;x (1 + p) = 0; ] = + (1 ) 2 ; ] denotes the equlbrum expected payo for ndvdual wth bas b and sgnal s from adoptng bas-debate strategy b;s. Hence tellng the truth at the bas revelaton stage s ncentve compatble E[U x;y j x;y = 1; ] E[U x;y j x;y = 0; ], whch obtans f 1=2. And gven bases are revealed truthfully, the subsequent debate and decson strateges are easly checked to be best responses. Thus allowng an opportunty to coordnate through sharng bas nformaton before revealng anythng about decson-relevant sgnals, cannot mprove the welfare propertes for the decsonmaker when < 1 p. 7 It s worth observng here that there s no comparable equlbrum n an extenson of the model to a three or more person commttee wth majorty rule. That s, as demonstrated n the Appendx, the possblty of bas revelaton n ths settng seems pecular to the advsor/decson-maker commttee structure. Equlbrum bas revelaton followed by (not necessarly fully) nformatve sgnal sharng s generally mpossble when a commttee uses a two-stage debate protocol followed by majorty rule votng to determne the commttee choce. Note that, so long as 1=2 n the dent ed equlbrum (say, the bas revelaton equlbrum), both ndvduals reveal ther bases n the rst round of talk; f ther bases are the same then all nformaton s revealed n the second round whereas, f bases are d erent, no further decson-relevant nformaton sharng takes place. It s mmedate, therefore, that the expected payo to any (b; s)-type ndvdual from playng the bas revelaton equlbrum dent ed n 7 Of course, full bas revelaton n debate s possble f all subsequent messages regardng ndvduals sgnals are gnored. But ths case s clearly equvalent to the stuaton wth no debate at all. 12

15 Proposton 3 equals the expected payo they acheve f bases could be revealed ex ante by some external agent. Spec cally, for all ; b; s, E[U b;s j bases revealed] = + (1 ) (1 + p) : 2 Furthermore, because p > 1=2, Propostons 1 and 3 together mply there s also a FRDE wth a bas debate stage when 1 p: both ndvduals babble durng the rst round of talk and, subsequently, all decson-relevant nformaton s revealed durng the second round of communcaton exactly as descrbed n Proposton 1; that s, for all ; b; s, b;s = 1=2 and b x = 1 b y = 1. Hence we have the same welfare comparsons as descrbed n Proposton 2, wth the further observaton that, when 1=2 > 1 p, the advsor strctly prefers to play the bas revelaton equlbrum to playng the FRDE wth no bas revelaton (of course, the decson-maker has the opposte preferences). In sum, bas uncertanty can mprove the welfare of the de facto full nformaton wnnng coalton. And even n those crcumstances n whch bas revelaton s avalable n equlbrum, there exsts a superor (from the decson-maker s perspectve) equlbrum n whch bases reman prvate nformaton. 3 Concluson There s clearly a great deal left to be learned regardng communcaton n commttees. In partcular, dentfyng the optmal votng rule n the presence of debate, and comparng ths rule wth the optmal rule wthout communcaton, are mportant and open questons. However, they have as yet proved largely ntractable f we nsst that votng be undomnated condtonal on the realzed messages n debate. On the other hand, the dscusson here provdes further support for the ntuton that full knowledge of commttee members underlyng preferences, or bases, comng nto a decson-makng process s a deterrent to credble and useful sharng of nformaton germane to the collectve decson. Moreover, the expected the qualty of any 13

16 commttee choce, at least as re ected by the lkelhood that any such decson concdes wth the decson that would be made under fully shared nformaton, s greater wth bas uncertanty than otherwse. 4 Appendx In ths Appendx we present a varaton of the two-person commttee model of the text, nvolvng a three-person commttee, = 1; 2; 3, usng majorty rule, q = 2, to make nal decsons. 8 We rst provde condtons for a FRDE and then argue that, unlke the two-person case, there exsts no equlbrum n whch all ndvduals can share ther bases credbly n debate to facltate coordnaton and subsequently dscuss ndvduals s sgnals regardng the state, s = (s 1 ; s 2 ; s 3 ). The commttee conssts of three people, = 1; 2; 3, that has to choose between a xed par of alternatves fx; Y g. Exactly as for the two-person case, each ndvdual has prvate nformaton regardng ther bas and a sgnal about the true state, (b ; s ) 2 fx; yg fx; yg; let (b; s) = ((b 1 ; b 2 ; b 3 ); (s 1 ; s 2 ; s 3 )) denote a pro le of realzed bases and sgnals. As before, assume sgnals are uncorrelated wth bases and suppose fa 1 ; A 2 g are states such that, for all, Pr[s = xja 1 ] = Pr[s = yja 2 ] = p 2 (1=2; 1) wth the common pror probablty on A 1 beng 1=2; and, for all, assume Pr[b = x] = r 2 (0; 1). Naturally extendng the two-person model, an ndvdual s payo from the collectve choce Z 2 fx; Y g, gven that her bas s b 2 fx; yg and the pro le of sgnals s s 2 fx; yg 3, s gven 8 The basc example to follow was ntroduced n Austen-Smth and Feddersen (2006) where the condtons for a FRDE were dent ed. For completeness, we summarze ths ndng here. 14

17 by: u(x; x; s) = 8 < : 0 f s = (y; y; y) 1 otherwse u(y; x; s) = 1 u(x; x; s) 8 < 1 f s = (x; x; x)g u(x; y; s) = : 0 otherwse u(y; y; s) = 1 u(x; y; s) The commttee s choce s determned by a majorty vote. As observed n the text, there s no equlbrum n whch all ndvduals vote nformatvely wthout any pre-vote communcaton. To see there can be a FRDE for some envronments, assume all ndvduals truthfully reveal ther sgnals; that s, usng the notaton of the text extended n the obvous manner to the three-person settng, (b; x) = 1 (b; y) = 1 for all and bases b. Then there s fully shared nformaton at the votng stage and the unque undomnated votng equlbrum condtonal on these messages s for each ndvdual to vote sncerely for ther most preferred alternatve as de ned by (b ; (s 1 ; s 2 ; s 3 )). Clearly, any x-based ndvdual wth an x sgnal, or y-based ndvdual wth y sgnal, has a domnant strategy to reveal ther sgnal truthfully. So, wthout loss of generalty, consder an x-based ndvdual wth a y sgnal: (b ; s ) = (x; y). Then there are essentally two events n whch s message pvotal: (1) both of the other commttee members are x-based and both have observed a y sgnal, whch occurs wth (condtonal) probablty 1 2 r2 p 3 + (1 p) 3 ; (2) both of the other commttee members are y-based and both have observed an x sgnal, whch occurs wth (condtonal) probablty 1 2 (1 r)2 (1 p) 2 p + (1 p)p 2 = 1 2 (1 r)2 p(1 p): 15

18 In event (1), ndvdual strctly prefers to tell the truth whle, n event (2), strctly prefers to dssemble. Makng the requste calculatons, tellng the truth n debate condtonal on all others fully revealng ther sgnals s ncentve compatble for an x-based ndvdual wth a y sgnal f and only f r 2 1 r p(1 p) (1 p) 3 + p 3 : Smlarly, ncentve compatblty of truthtellng for a y-based ndvdual wth an x sgnal s nsured f 1 r 2 r p(1 p) (1 p) 3 + p 3 : For every r 2 (0; 1), therefore, there exsts some p < 1 for whch there exsts an equlbrum n whch all ndvduals reveal ther sgnals truthfully n debate and subsequently vote under full nformaton to yeld the ex post rst best de facto majorty preferred outcome. Although certanly more complcated than the formula of Proposton 1 n the text, the ntuton and comparatve statcs of ths result are dentcal. Proposton 3 n the text showed that sharng nformaton about bases pror to an n uental debate regardng sgnals s possble n equlbrum f the two ndvduals of the commttee are su cently lkely to share the same bas;.e. the advsor s su cently lkely to be a member of the wnnng coalton, de ned by the decson-maker (pvot). Ths turns out not to be a general result wth respect to commttee sze and decson rule. As before, suppose there are two cheap-talk debate stages pror to votng: n the rst, ndvduals send a message regardng ther bases, followng whch there the second debate stage nvolves ndvduals sendng cheap-talk messages about ther sgnals. Although the notaton s perhaps unnecessary to establsh the result of nterest here, to avod ambguty n dscusson, t seems sensble to specfy formal strateges for the protocol. Spec cally: b;s 2 [0; 1] s the probablty that ndvdual wth bas b and sgnal s announces her bas s x; gven bas-stage messages m = (m 1 ; m 2 ; m s ) 2 fx; yg 3 ; let b;s (m; m ) 2 [0; 1] s the probablty ndvdual wth bas b and sgnal s who has announced her bas s m and heard messages m regardng the 16

19 other players bases, announces that her sgnal s x; and smlarly, let v b;s ((m; m ); (n; n )) be the probablty ths ndvdual chooses outcome X gven the hstory of speeches n debate. Proposton 4 Assume each player has observed hs or her partcular bas and sgnal. There exsts no equlbrum n whch each player truthfully reveals ther bas n the rst message round and all members of the revealed majorty subsequently reveal ther sgnals pror to votng. Proof: Suppose, to the contrary, that all ndvduals reveal ther bases durng the rst debate stage and, n the second debate stage, those commttee members sharng the majorty bas reveal ther sgnals whle those n the mnorty o er no further credble nformaton; all ndvduals then vote for ther most preferred alternatve condtonal on ther nformaton sets at the tme. In partcular, members of the revealed majorty vote dentcally but, assumng some heterogenety n bases across the commttee, not under complete nformaton; the mnorty ndvdual on the other hand, should she exst, votes under complete nformaton. (It s easy to check that, condtonal on full bas revelaton at the rst stage, these subsequent stage message and vote strateges consttute equlbrum play.) Formally, the strateges (spec ed only for an x-based ndvdual; those for a y-based ndvdual are symmetrc) are descrbed by: x;x = x;y = 1; = 1; 2; 3 x;x (m) = 1; 8m x;y (m ; x; x) = 1 x;y (m ; y; y) = 0 v x;x (m; n) = 1; 8(m; n) [9j 6= : m = m j & n j = x] =) v x;y (m; (n ; n )) = 1 v x;y ((x; (y; y)) ; (x; x; x)) = 1 v x;y (m; n) = 0 otherwse. 17

20 We argue that ths pro le cannot be an equlbrum. To ths end, suppose the spec ed strategy pro le consttutes an equlbrum and consder an x-based ndvdual, say = 1, wth a y sgnal; now suppose that devates from the prescrbed strategy and les about her bas. There are three cases, dependng on the revealed (truthfully, by supposton) bases of the other ndvduals, 2; 3. Case 1: both of the others credbly reveal they are y-based. Gven the declared bas pro le and the spec ed contnuaton strateges, = 1 s messagepvotal at the second debate stage when both have x sgnals: s 2 = s 3 = x. In ths case, ndvdual 1 has a best response to le regardng her sgnal, else Y s chosen surely at the votng stage. Gven s revealed bas s y, her second stage debate message s credble to the (true) majorty of f2; 3g who therefore have a best votng decson n favour of X. However, snce both 2; 3 declare ther x-sgnals n the second stage and sgnals are nformatve, ths coalton would have unanmously chosen X had ndvdual 1 truthfully declared her bas to be x n the rst stage, revealed herself as the mnorty and subsequently played the spec ed strategy n the second debate stage. Thus, n ths case, ndvdual 1 gans no advantage by lyng about her bas n the rst debate stage. Case 2: both of the others credbly reveal they are x-based. In ths case, s message-pvotal when both 2 and 3 have y-sgnals. Hence, = 1 s undomnated best response s to tell the truth about her sgnal, s 1 = y, snce the only crcumstance n whch she strctly prefers the Y decson s when all three sgnals are y. But havng led about her bas n the rst stage and declared a y bas, any message n favour of Y at the second stage s gnored by the majorty as not credble. However, even so, the majorty votes together for Y because, gven the two credble messages that at least two (nformatve) y sgnals have been observed, votng for Y s a best response. As for Case 1, therefore, = 1 cannot pro t from devatng n the rst debate stage and lyng about her bas. Case 3: the others credbly reveal they have opposng bases. 18

21 Gven that = 1 has led about her bas, the apparent majorty n the commttee s y- based: wthout loss of generalty, assume m 2 = b 2 = x and m 3 = b 3 = y. Consequently, at the second debate stage, the (apparent) mnorty ndvdual 2 speaks n favour of X rrespectve of hs sgnal, and the (apparent) majorty coalton member 3 both reveals her sgnal credbly. Moreover, all three ndvduals beleve the second stage debate messages from ndvduals 1 and 3 and subsequently vote usng ths nformaton. Therefore, 1 s best response message at the second stage s to reveal her sgnal n 1 = s 1 = y truthfully and subsequently vote for X rrespectve of the y-based ndvdual 3 s message. Followng such a second stage debate, ndvdual 3 has (gven b 3 = y and 1 s revealed y sgnal) a best response decson to vote for Y. In turn, ths makes ndvdual 2, the apparent mnorty member of the commttee, vote pvotal n whch case hs best response s to vote for Y f and only f s 2 = s 3 = y. Hence, gven the others follow the prescrbed strateges, the devaton from full truthtellng regardng her bas s strctly pro table ndvdual = 1 n ths case. In sum, because Cases 1, 2 and 3 are exhaustve, an x-based ndvdual wth a y sgnal can never be made worse o by devatng to reveal a y bas n the rst debate stage, and can be make strctly better o n one case. Thus the supposton that the spec ed strategy pro le consttutes and an equlbrum n undomnated strateges s false. 19

22 References Austen-Smth, Davd. 1990a. Informaton transmsson n debate. Amercan Journal of Poltcal Scence 34 (February): Austen-Smth, Davd and Je rey S. Banks Informaton aggregaton, ratonalty, and the Condorcet Jury Theorem. Amercan Poltcal Scence Revew 90 (March): Austen-Smth, Davd and Tmothy J. Feddersen Delberaton and votng rules. In Socal Choce and Strategc Decsons: Essays n Honor of Je rey S. Banks, eds. Davd Austen-Smth and John Duggan. Hedelberg:Sprnger. Austen-Smth, Davd and Tmothy J. Feddersen Delberaton, preference uncertanty and votng rules. Amercan Poltcal Scence Revew 100 (May): Callaud, Bernard and Jean Trole "Consensus buldng: how to persuade a group" CNRS Workng Paper. Calvert, Randall L. and James Johnson Ratonal argument, poltcal argument and democratc delberaton. Presented at the Annual Meetng of the Amercan Poltcal Scence Assocaton. Chwe, Mchael "A robust and optmal anonymous procedure for Condorcet s model." UCLA, Workng Paper. Coughlan, Peter J In defense of unanmous jury verdcts: mstrals, communcaton and strategc votng. Amercan Poltcal Scence Revew 94 (June): Doraszelsk, Ulrch, Dno Gerard and Francesco Squntan Communcaton and votng wth double-sded nformaton. Contrbutons to Theoretcal Economcs 3(1), Artcle 6. Feddersen, Tmothy J. and Wolfgang Pesendorfer Votng behavor and nformaton aggregaton n large electons wth prvate nformaton. Econometrca 65(5):

23 Feddersen, Tmothy J. and Wolfgang Pesendorfer Convctng the nnoncent: the nferorty of unanmous jury verdcts. Amercan Poltcal Scence Revew 92 (March): Gerard, Dno and Leeat Yarv Delberatve Commttees. Journal of Economc Theory 134(1): Glazer, Jacob and Arel Rubnsten Debates and decsons: on a ratonale of argumentaton rules. Games and Economc Behavor 36(2): Hafer, Catherne and Dmtr Landa Delberaton as self-dscovery and the nsttutons for poltcal speech. forthcomng n Journal of Theoretcal Poltcs. McLennan, Andrew Consequences of the Condorcet Jury Theorem for bene cal nformaton aggregaton by ratonal players. Amercan Poltcal Scence Revew. 92(2): Merowtz, Adam In defense of exclusonary delberaton: communcaton and votng wth prvate belefs and values forthcomng n Journal of Theoretcal Poltcs. Merowtz, Adam Delberatve democracy or market democracy: desgnng nsttutons to aggregate preferences and nformaton. Quarterly Journal of Poltcal Scence 1(4): Ottavan, Marco and Peter Sorensen Informaton aggregaton n debate: who should speak rst? Journal of Publc Economcs 81(3):

A Note on Preference Uncertainty and Communication in Committees 1

A Note on Preference Uncertainty and Communication in Committees 1 A Note on Preference Uncertanty and Communcaton n Commttees 1 Davd Austen-Smth MEDS, Kellogg Graduate School of Management Northwestern Unversty Evanston, IL 60208 Tm Feddersen MEDS, Kellogg Graduate School

More information

Notes on Bias Uncertainty and Communication in Committees 1

Notes on Bias Uncertainty and Communication in Committees 1 Notes on Bas Uncertanty and Communcaton n Commttees 1 Davd Austen-Smth MEDS, Kellogg Graduate School of Management Northwestern Unversty Evanston, IL 60208 Tm Feddersen MEDS, Kellogg Graduate School of

More information

Endogenous timing in a mixed oligopoly consisting of a single public firm and foreign competitors. Abstract

Endogenous timing in a mixed oligopoly consisting of a single public firm and foreign competitors. Abstract Endogenous tmng n a mxed olgopoly consstng o a sngle publc rm and oregn compettors Yuanzhu Lu Chna Economcs and Management Academy, Central Unversty o Fnance and Economcs Abstract We nvestgate endogenous

More information

CS286r Assign One. Answer Key

CS286r Assign One. Answer Key CS286r Assgn One Answer Key 1 Game theory 1.1 1.1.1 Let off-equlbrum strateges also be that people contnue to play n Nash equlbrum. Devatng from any Nash equlbrum s a weakly domnated strategy. That s,

More information

Implementation and Detection

Implementation and Detection 1 December 18 2014 Implementaton and Detecton Htosh Matsushma Department of Economcs Unversty of Tokyo 2 Ths paper consders mplementaton of scf: Mechansm Desgn wth Unqueness CP attempts to mplement scf

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

Internet Appendix for "Nonbinding Voting for Shareholder Proposals"

Internet Appendix for Nonbinding Voting for Shareholder Proposals Internet Appendx for "Nonbndng Votng for Shareholder Proposals" DORON LEVIT and NADYA MALENKO The Internet Appendx contans the omtted proofs from the man appendx (Secton I) and the analyss correspondng

More information

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate

More information

Correlated Equilibrium in Games with Incomplete Information

Correlated Equilibrium in Games with Incomplete Information Correlated Equlbrum n Games wth Incomplete Informaton Drk Bergemann y Stephen Morrs z Frst Verson: October Current Verson: May 4, Abstract We de ne a noton of correlated equlbrum for games wth ncomplete

More information

The basic point with mechanism design is that it allows a distinction between the underlying

The basic point with mechanism design is that it allows a distinction between the underlying 14 Mechansm Desgn The basc pont wth mechansm desgn s that t allows a dstncton between the underlyng economc envronment and the rules of the game. We wll take as gven some set of possble outcomes (alternatves,

More information

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017

More information

ON THE EQUIVALENCE OF ORDINAL BAYESIAN INCENTIVE COMPATIBILITY AND DOMINANT STRATEGY INCENTIVE COMPATIBILITY FOR RANDOM RULES

ON THE EQUIVALENCE OF ORDINAL BAYESIAN INCENTIVE COMPATIBILITY AND DOMINANT STRATEGY INCENTIVE COMPATIBILITY FOR RANDOM RULES ON THE EQUIVALENCE OF ORDINAL BAYESIAN INCENTIVE COMPATIBILITY AND DOMINANT STRATEGY INCENTIVE COMPATIBILITY FOR RANDOM RULES Madhuparna Karmokar 1 and Souvk Roy 1 1 Economc Research Unt, Indan Statstcal

More information

and problem sheet 2

and problem sheet 2 -8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,

More information

Robust Implementation: The Role of Large Type Spaces

Robust Implementation: The Role of Large Type Spaces Robust Implementaton: The Role of Large Type Spaces Drk Bergemann y Stephen Morrs z Frst Verson: March 2003 Ths Verson: Aprl 2004 Abstract We analyze the problem of fully mplementng a socal choce functon

More information

The Mixed Strategy Nash Equilibrium of the Television News Scheduling Game

The Mixed Strategy Nash Equilibrium of the Television News Scheduling Game The Mxed Strategy Nash Equlbrum of the Televson News Schedulng Game Jean Gabszewcz Dder Laussel Mchel Le Breton July 007 Abstract We characterze the unque mxed-strategy equlbrum of an extenson of the "televson

More information

Communication and Cooperation in Repeated Games

Communication and Cooperation in Repeated Games Communcaton and Cooperaton n Repeated Games Yu Awaya y and Vjay Krshna z May 4, 07 Abstract We study the role of communcaton n repeated games wth prvate montorng. We rst show that wthout communcaton, the

More information

Subjective Uncertainty Over Behavior Strategies: A Correction

Subjective Uncertainty Over Behavior Strategies: A Correction Subjectve Uncertanty Over Behavor Strateges: A Correcton The Harvard communty has made ths artcle openly avalable. Please share how ths access benefts you. Your story matters. Ctaton Publshed Verson Accessed

More information

A resurrection of the Condorcet Jury Theorem

A resurrection of the Condorcet Jury Theorem Theoretcal Economcs 4 (2009), 227 252 1555-7561/20090227 A resurrecton of the Condorcet Jury Theorem YUKIO KORIYAMA Département d Économe, École Polytechnque, Palaseau BALÁZS SZENTES Department of Economcs,

More information

Edge Isoperimetric Inequalities

Edge Isoperimetric Inequalities November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary

More information

Module 17: Mechanism Design & Optimal Auctions

Module 17: Mechanism Design & Optimal Auctions Module 7: Mechansm Desgn & Optmal Auctons Informaton Economcs (Ec 55) George Georgads Examples: Auctons Blateral trade Producton and dstrbuton n socety General Setup N agents Each agent has prvate nformaton

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

Robust Implementation: The Role of Large Type Spaces

Robust Implementation: The Role of Large Type Spaces Robust Implementaton: The Role of Large Type Spaces Drk Bergemann y Stephen Morrs z Frst Verson: March 23 Ths Verson: June 25 Abstract A socal choce functon s robustly mplemented f every equlbrum on every

More information

Information Acquisition in Global Games of Regime Change

Information Acquisition in Global Games of Regime Change Informaton Acquston n Global Games of Regme Change Mchal Szkup and Isabel Trevno y Abstract We study costly nformaton acquston n global games of regme change (that s, coordnaton games where payo s are

More information

A Resurrection of the Condorcet Jury Theorem

A Resurrection of the Condorcet Jury Theorem A Resurrecton of the Condorcet Jury Theorem Yuo Koryama and Balázs Szentes yz Septemer 19, 2008 Astract hal-00391197, verson 1-3 Jun 2009 Ths paper analyzes the optmal sze of a deleratng commttee where,

More information

COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY

COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY ROBUST MECHANISM DESIGN By Drk Bergemann and Stephen Morrs Aprl 2004 COWLES FOUNDATION DISCUSSION PAPER NO. 1421R COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY Box 208281 New Haven, Connectcut

More information

Communication and Cooperation in Repeated Games

Communication and Cooperation in Repeated Games Communcaton and Cooperaton n Repeated Games Yu Awaya y and Vjay Krshna z October, 08 Abstract We study the role of communcaton n repeated games wth prvate montorng. We rst show that wthout communcaton,

More information

(1 ) (1 ) 0 (1 ) (1 ) 0

(1 ) (1 ) 0 (1 ) (1 ) 0 Appendx A Appendx A contans proofs for resubmsson "Contractng Informaton Securty n the Presence of Double oral Hazard" Proof of Lemma 1: Assume that, to the contrary, BS efforts are achevable under a blateral

More information

DIFFERENTIAL SCHEMES

DIFFERENTIAL SCHEMES DIFFERENTIAL SCHEMES RAYMOND T. HOOBLER Dedcated to the memory o Jerry Kovacc 1. schemes All rngs contan Q and are commutatve. We x a d erental rng A throughout ths secton. 1.1. The topologcal space. Let

More information

A Resurrection of the Condorcet Jury Theorem

A Resurrection of the Condorcet Jury Theorem A Resurrecton of the Condorcet Jury Theorem Yuo Koryama Balázs Szentes Department of Economcs, Unversty of Chcago June 13, 2007 Abstract Ths paper analyzes the optmal sze of a delberatng commttee where,

More information

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India February 2008

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India February 2008 Game Theory Lecture Notes By Y. Narahar Department of Computer Scence and Automaton Indan Insttute of Scence Bangalore, Inda February 2008 Chapter 10: Two Person Zero Sum Games Note: Ths s a only a draft

More information

Implementation in Mixed Nash Equilibrium

Implementation in Mixed Nash Equilibrium Department of Economcs Workng Paper Seres Implementaton n Mxed Nash Equlbrum Claudo Mezzett & Ludovc Renou May 2012 Research Paper Number 1146 ISSN: 0819-2642 ISBN: 978 0 7340 4496 9 Department of Economcs

More information

Market structure and Innovation

Market structure and Innovation Market structure and Innovaton Ths presentaton s based on the paper Market structure and Innovaton authored by Glenn C. Loury, publshed n The Quarterly Journal of Economcs, Vol. 93, No.3 ( Aug 1979) I.

More information

Pricing Network Services by Jun Shu, Pravin Varaiya

Pricing Network Services by Jun Shu, Pravin Varaiya Prcng Network Servces by Jun Shu, Pravn Varaya Presented by Hayden So September 25, 2003 Introducton: Two Network Problems Engneerng: A game theoretcal sound congeston control mechansm that s ncentve compatble

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

Microeconomics: Auctions

Microeconomics: Auctions Mcroeconomcs: Auctons Frédérc Robert-coud ovember 8, Abstract We rst characterze the PBE n a smple rst prce and second prce sealed bd aucton wth prvate values. The key result s that the expected revenue

More information

Folk Theorem in Stotchastic Games with Private State and Private Monitoring Preliminary: Please do not circulate without permission

Folk Theorem in Stotchastic Games with Private State and Private Monitoring Preliminary: Please do not circulate without permission Folk Theorem n Stotchastc Games wth Prvate State and Prvate Montorng Prelmnary: Please do not crculate wthout permsson Takuo Sugaya Stanford Graduate School of Busness December 9, 202 Abstract We show

More information

RATIONALIZABLE IMPLEMENTATION. Dirk Bergemann and Stephen Morris. May 2009 COWLES FOUNDATION DISCUSSION PAPER NO. 1697

RATIONALIZABLE IMPLEMENTATION. Dirk Bergemann and Stephen Morris. May 2009 COWLES FOUNDATION DISCUSSION PAPER NO. 1697 RATIONALIZABLE IMPLEMENTATION By Drk Bergemann and Stephen Morrs May 2009 COWLES FOUNDATION DISCUSSION PAPER NO. 1697 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY Box 208281 New Haven, Connectcut

More information

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium? APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare

More information

Economics 101. Lecture 4 - Equilibrium and Efficiency

Economics 101. Lecture 4 - Equilibrium and Efficiency Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced, FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then

More information

Cowles Foundation for Research in Economics at Yale University

Cowles Foundation for Research in Economics at Yale University Cowles Foundaton for Research n Economcs at Yale Unversty Cowles Foundaton Dscusson Paper No. 666 ROBUST IMPLEMENTATION IN GENERAL MECHANISMS Drk Bergemann and Stephen Morrs Month 28 An author ndex to

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Optimal Allocation with Costly Verification 1

Optimal Allocation with Costly Verification 1 Optmal Allocaton wth Costly Verfcaton 1 Elchanan Ben-Porath 2 Edde Dekel 3 Barton L. Lpman 4 Frst Draft August 2012 1 We thank Rcky Vohra and numerous semnar audences for helpful comments. We also thank

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

Basically, if you have a dummy dependent variable you will be estimating a probability.

Basically, if you have a dummy dependent variable you will be estimating a probability. ECON 497: Lecture Notes 13 Page 1 of 1 Metropoltan State Unversty ECON 497: Research and Forecastng Lecture Notes 13 Dummy Dependent Varable Technques Studenmund Chapter 13 Bascally, f you have a dummy

More information

A note on the one-deviation property in extensive form games

A note on the one-deviation property in extensive form games Games and Economc Behavor 40 (2002) 322 338 www.academcpress.com Note A note on the one-devaton property n extensve form games Andrés Perea Departamento de Economía, Unversdad Carlos III de Madrd, Calle

More information

CS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016

CS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016 CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng

More information

Introduction. 1. The Model

Introduction. 1. The Model H23, Q5 Introducton In the feld of polluton regulaton the problems stemmng from the asymmetry of nformaton between the regulator and the pollutng frms have been thoroughly studed. The semnal works by Wetzman

More information

Constant Best-Response Functions: Interpreting Cournot

Constant Best-Response Functions: Interpreting Cournot Internatonal Journal of Busness and Economcs, 009, Vol. 8, No., -6 Constant Best-Response Functons: Interpretng Cournot Zvan Forshner Department of Economcs, Unversty of Hafa, Israel Oz Shy * Research

More information

Tit-For-Tat Equilibria in Discounted Repeated Games with. Private Monitoring

Tit-For-Tat Equilibria in Discounted Repeated Games with. Private Monitoring 1 Tt-For-Tat Equlbra n Dscounted Repeated Games wth Prvate Montorng Htosh Matsushma 1 Department of Economcs, Unversty of Tokyo 2 Aprl 24, 2007 Abstract We nvestgate nfntely repeated games wth mperfect

More information

Vickrey Auction VCG Combinatorial Auctions. Mechanism Design. Algorithms and Data Structures. Winter 2016

Vickrey Auction VCG Combinatorial Auctions. Mechanism Design. Algorithms and Data Structures. Winter 2016 Mechansm Desgn Algorthms and Data Structures Wnter 2016 1 / 39 Vckrey Aucton Vckrey-Clarke-Groves Mechansms Sngle-Mnded Combnatoral Auctons 2 / 39 Mechansm Desgn (wth Money) Set A of outcomes to choose

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Uniqueness of Nash Equilibrium in Private Provision of Public Goods: Extension. Nobuo Akai *

Uniqueness of Nash Equilibrium in Private Provision of Public Goods: Extension. Nobuo Akai * Unqueness of Nash Equlbrum n Prvate Provson of Publc Goods: Extenson Nobuo Aka * nsttute of Economc Research Kobe Unversty of Commerce Abstract Ths note proves unqueness of Nash equlbrum n prvate provson

More information

Hila Etzion. Min-Seok Pang

Hila Etzion. Min-Seok Pang RESERCH RTICLE COPLEENTRY ONLINE SERVICES IN COPETITIVE RKETS: INTINING PROFITILITY IN THE PRESENCE OF NETWORK EFFECTS Hla Etzon Department of Technology and Operatons, Stephen. Ross School of usness,

More information

Mechanisms with Evidence: Commitment and Robustness 1

Mechanisms with Evidence: Commitment and Robustness 1 Mechansms wth Evdence: Commtment and Robustness 1 Elchanan Ben-Porath 2 Edde Dekel 3 Barton L. Lpman 4 Frst Draft January 2017 1 We thank the Natonal Scence Foundaton, grant SES 0820333 (Dekel), and the

More information

Voting Games with Positive Weights and. Dummy Players: Facts and Theory

Voting Games with Positive Weights and. Dummy Players: Facts and Theory Appled Mathematcal Scences, Vol 10, 2016, no 53, 2637-2646 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/ams201667209 Votng Games wth Postve Weghts and Dummy Players: Facts and Theory Zdravko Dmtrov

More information

EPR Paradox and the Physical Meaning of an Experiment in Quantum Mechanics. Vesselin C. Noninski

EPR Paradox and the Physical Meaning of an Experiment in Quantum Mechanics. Vesselin C. Noninski EPR Paradox and the Physcal Meanng of an Experment n Quantum Mechancs Vesseln C Nonnsk vesselnnonnsk@verzonnet Abstract It s shown that there s one purely determnstc outcome when measurement s made on

More information

Understanding Reasoning Using Utility Proportional Beliefs

Understanding Reasoning Using Utility Proportional Beliefs Understandng Reasonng Usng Utlty Proportonal Belefs Chrstan Nauerz EpCenter, Maastrcht Unversty c.nauerz@maastrchtunversty.nl Abstract. Tradtonally very lttle attenton has been pad to the reasonng process

More information

a b a In case b 0, a being divisible by b is the same as to say that

a b a In case b 0, a being divisible by b is the same as to say that Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :

More information

An Introduction to Mechanism Design

An Introduction to Mechanism Design An Introducton to Mechansm Desgn Felx Munoz-Garca School of Economc Scences Washngton State Unversty 1 1 Introducton In ths chapter, we consder stuatons n whch some central authorty wshes to mplement a

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

Online Appendix: Reciprocity with Many Goods

Online Appendix: Reciprocity with Many Goods T D T A : O A Kyle Bagwell Stanford Unversty and NBER Robert W. Stager Dartmouth College and NBER March 2016 Abstract Ths onlne Appendx extends to a many-good settng the man features of recprocty emphaszed

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

Bayesian epistemology II: Arguments for Probabilism

Bayesian epistemology II: Arguments for Probabilism Bayesan epstemology II: Arguments for Probablsm Rchard Pettgrew May 9, 2012 1 The model Represent an agent s credal state at a gven tme t by a credence functon c t : F [0, 1]. where F s the algebra of

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

Mechanisms with Evidence: Commitment and Robustness 1

Mechanisms with Evidence: Commitment and Robustness 1 Mechansms wth Evdence: Commtment and Robustness 1 Elchanan Ben-Porath 2 Edde Dekel 3 Barton L. Lpman 4 Frst Draft January 2017 Current Draft July 2018 1 We thank numerous semnar audences and Joel Sobel

More information

Role of Honesty in Full Implementation +

Role of Honesty in Full Implementation + 1 Role of Honesty n Full Implementaton + Htosh Matsushma * Faculty of Economcs Unversty of Tokyo June 4 2007 (Frst Verson: March 4 2002) + Ths paper s a revsed verson of the manuscrpt enttled Non-Consequental

More information

EFFICIENT DYNAMIC AUCTIONS. Dirk Bergemann and Juuso Välimäki. October 2006 COWLES FOUNDATION DISCUSSION PAPER NO. 1584

EFFICIENT DYNAMIC AUCTIONS. Dirk Bergemann and Juuso Välimäki. October 2006 COWLES FOUNDATION DISCUSSION PAPER NO. 1584 EFFICIENT DYNAMIC AUCTIONS By Drk Bergemann and Juuso Välmäk October 2006 COWLES FOUNDATION DISCUSSION PAPER NO. 1584 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY Box 208281 New Haven, Connectcut

More information

Commitment and Robustness in Mechanisms with Evidence 1

Commitment and Robustness in Mechanisms with Evidence 1 Commtment and Robustness n Mechansms wth Evdence 1 Elchanan Ben-Porath 2 Edde Dekel 3 Barton L. Lpman 4 Frst Draft June 2016 1 We thank the Natonal Scence Foundaton, grant SES 0820333 (Dekel), and the

More information

The Folk Theorem for Games with Private Almost-Perfect Monitoring

The Folk Theorem for Games with Private Almost-Perfect Monitoring The Folk Theorem for Games wth Prvate Almost-Perfect Montorng Johannes Hörner y Wojcech Olszewsk z October 2005 Abstract We prove the folk theorem for dscounted repeated games under prvate, almost-perfect

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

Bayesian predictive Configural Frequency Analysis

Bayesian predictive Configural Frequency Analysis Psychologcal Test and Assessment Modelng, Volume 54, 2012 (3), 285-292 Bayesan predctve Confgural Frequency Analyss Eduardo Gutérrez-Peña 1 Abstract Confgural Frequency Analyss s a method for cell-wse

More information

Graph Reconstruction by Permutations

Graph Reconstruction by Permutations Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer

More information

Interim Correlated Rationalizability 1

Interim Correlated Rationalizability 1 Interm Correlated Ratonalzablty Edde Dekel Northwestern Unversty and Tel Avv Unversty Drew Fudenberg Harvard Unversty Stephen Morrs Prnceton Unversty Frst Draft: May 2003. Ths Draft: November 2006 Ths

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Optimal Allocation with Costly Verification 1

Optimal Allocation with Costly Verification 1 Optmal Allocaton wth Costly Verfcaton 1 Elchanan Ben-Porath 2 Edde Dekel 3 Barton L. Lpman 4 Prelmnary Draft January 2012 1 We thank Rcky Vohra and numerous semnar audences for helpful comments. We also

More information

Lecture 4. Instructor: Haipeng Luo

Lecture 4. Instructor: Haipeng Luo Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Common agency contracting with endogenous information gathering

Common agency contracting with endogenous information gathering Common agency contractng wth endogenous nformaton gatherng Félx Muñoz-García y School of Economc Scences Washngton State Unversty Pullman, WA 9964 Aprl, 5 2008 Abstract Ths paper examnes a common agency

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

Weighted Voting Systems

Weighted Voting Systems Weghted Votng Systems Elssa Brown Chrssy Donovan Charles Noneman June 5, 2009 Votng systems can be deceptve. For nstance, a votng system mght consst of four people, n whch three of the people have 2 votes,

More information

Stat260: Bayesian Modeling and Inference Lecture Date: February 22, Reference Priors

Stat260: Bayesian Modeling and Inference Lecture Date: February 22, Reference Priors Stat60: Bayesan Modelng and Inference Lecture Date: February, 00 Reference Prors Lecturer: Mchael I. Jordan Scrbe: Steven Troxler and Wayne Lee In ths lecture, we assume that θ R; n hgher-dmensons, reference

More information

Game Theory Course: Jackson, Leyton-Brown & Shoham. Vickrey-Clarke-Groves Mechanisms: Definitions

Game Theory Course: Jackson, Leyton-Brown & Shoham. Vickrey-Clarke-Groves Mechanisms: Definitions Vckrey-Clarke-Groves Mechansms: Defntons Game Theory Course: Jackson, Leyton-Brown & Shoham A postve result Recall that n the quaslnear utlty settng, a drect mechansm conssts of a choce rule and a payment

More information

/ n ) are compared. The logic is: if the two

/ n ) are compared. The logic is: if the two STAT C141, Sprng 2005 Lecture 13 Two sample tests One sample tests: examples of goodness of ft tests, where we are testng whether our data supports predctons. Two sample tests: called as tests of ndependence

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

The Folk Theorem in Dynastic Repeated Games

The Folk Theorem in Dynastic Repeated Games The Folk Theorem n Dynastc Repeated Games Luca Anderln (Georgetown Unversty) Dno Gerard (Yale Unversty) Roger Lagunoff (Georgetown Unversty) October 2004 Abstract. A canoncal nterpretaton of an nfntely

More information

Andreas C. Drichoutis Agriculural University of Athens. Abstract

Andreas C. Drichoutis Agriculural University of Athens. Abstract Heteroskedastcty, the sngle crossng property and ordered response models Andreas C. Drchouts Agrculural Unversty of Athens Panagots Lazards Agrculural Unversty of Athens Rodolfo M. Nayga, Jr. Texas AMUnversty

More information

Investment Secrecy and Competitive R&D

Investment Secrecy and Competitive R&D BE J. Econ. nal. Polcy 2016; aop Letter dt Sengupta* Investment Secrecy and Compettve R&D DOI 10.1515/beeap-2016-0047 bstract: Secrecy about nvestment n research and development (R&D) can promote greater

More information

} Often, when learning, we deal with uncertainty:

} Often, when learning, we deal with uncertainty: Uncertanty and Learnng } Often, when learnng, we deal wth uncertanty: } Incomplete data sets, wth mssng nformaton } Nosy data sets, wth unrelable nformaton } Stochastcty: causes and effects related non-determnstcally

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

RECEIVED. Negative Transverse Impedance

RECEIVED. Negative Transverse Impedance RECEVED SEP 2 3 996 OSTt > LS- 4 O C a f L W. Chou March 2, 989 (Rev. June 2, 9S9) Negatve Transverse mpedance ntroducton n Ref. ( we report an observaton that the horzontal and the vertcal loss factors

More information

Utility Dependence in Correct and Fair Rational Secret Sharing

Utility Dependence in Correct and Fair Rational Secret Sharing Utlty Dependence n Correct and Far Ratonal Secret Sharng Glad Asharov and Yehuda Lndell Department of Computer Scence Bar-Ilan Unversty, Israel glad asharov@yahoo.com, lndell@cs.bu.ac.l Abstract. The problem

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

Credit Card Pricing and Impact of Adverse Selection

Credit Card Pricing and Impact of Adverse Selection Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n

More information

Explaining the Stein Paradox

Explaining the Stein Paradox Explanng the Sten Paradox Kwong Hu Yung 1999/06/10 Abstract Ths report offers several ratonale for the Sten paradox. Sectons 1 and defnes the multvarate normal mean estmaton problem and ntroduces Sten

More information

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1 Problem Set 4 Suggested Solutons Problem (A) The market demand functon s the soluton to the followng utlty-maxmzaton roblem (UMP): The Lagrangean: ( x, x, x ) = + max U x, x, x x x x st.. x + x + x y x,

More information

Dynamic Efcient Auctions

Dynamic Efcient Auctions Dynamc fcent Auctons Drk Bergemann y and Juuso Valmak z ABSTRACT (xtended Abstract) We consder the truthful mplementaton of the socally e cent allocaton n a dynamc prvate value envronment n whch agents

More information