Pivots Versus Signals in Elections

Size: px
Start display at page:

Download "Pivots Versus Signals in Elections"

Transcription

1 Pivots Versus Signals in Elections Ada Meirowitz y and Kenneth W. Shotts z Septeber 9, 007 Abstract Incentives in voting odels typically hinge on the event that a voter is pivotal. But voting can also in uence the behavior of elites in subsequent periods. In this paper, we consider a odel in which voters have private inforation about their policy preferences and an election is held in each of two periods. In this setting, a vote in the rst period can have two types of consequences; it ay be pivotal in deciding who wins the rst election and it provides a signal that infors the beliefs that candidates running in the second election use when selecting equilibriu platfors. Pivot events are exceedingly unliely, but when they occur the e ect of a single vote is enorous, since it deterines the electoral outcoe. In contrast, vote totals always have soe signaling e ect on future policies, but the e ect of a single vote is always very sall. We investigate whether the forer, pivot, e ect or the latter, signaling, e ect drives equilibriu voting behavior in large electorates. Prepared for the Annual Conference on Political Econoy at the University of Rochester s Wallis Institutue, October 007. For helpful coents, we than Patric Huel and seinar participants at Bereley, the Hoover Institution, the 006 MPSA annual eeting, and the 007 APSA annual eeting. Marc Meredith provided excellent research assistance on nuerical siulations early in the project. We are indebted to Keith Krehbiel and Nolan McCarty for profound observations on how this wor ts into the larger literature in political science. y Associate Professor of Politics, Princeton University. Princeton, NJ Eail: aeirowi@princeton.edu. z Associate Professor, Stanford Graduate School of Business. 58 Meorial Way, Stanford CA Eail: shotts@stanford.edu.

2 Introduction In nearly all odels of voting the payo fro casting a particular ballot hinges exclusively on pivot events. These are events in which the election is tied or nearly tied, so that a single vote can deterine the outcoe. In decision-theoretic odels a voter decides whether and how to vote based on exogenous probabilities of ties between candidates. Gae theoretic odels endogenize the equilibriu probability that a vote is pivotal. And several recent in uential papers focus on inforation that a voter can infer fro the fact that he is pivotal, and analyze electoral equilibria when voters condition on being pivotal. The pivot-based literature on elections is vast, but the odels have two features in coon: (i) when a voter is pivotal, the action she taes has a large ipact on her payo, but (ii) pivot events are very unliely. The large ipact is due to the fact that in a pivot event, a single vote can deterine the outcoe of the election. The low probability arises fro the fact that in a large election it is exceedingly unliely that two candidates will receive the sae nuber of votes or di er by exactly one vote. Although pivot based odels doinate the gae-theoretic literature on elections, the infrequency of pivot events in all but the sallest elections raises a natural question: is electoral behavior driven by ore than just concerns about being pivotal? If pivot events do not actually drive the calculus of voters then a large and growing literature on voting theory ay be focused on second-order concerns. Why would voters care about anything other than a pivot event? Consider, for exaple, the buildup to the 006 idter election in the United State. Pundits speculated that voters dissatisfaction with President Bush s handing of the war in Iraq would cost the Republican party its ajority in Congress. While Republicans electoral losses ay in fact have been a direct result of voters desire to change the coposition of the legislature, another explanation is that voters cast ballots for Deocrats in order to send Bush a essage, and encourage hi to change policy. An eerging literature, based on the intuition that vote totals atter in elections that don t end in a tie, o ers an alternative perspective to the doinant pivot-based theories of elections. Theorists Decision theoretic odels include the wor of Downs (957), Tulloc (967), Rier and Ordeshoo (968), and Myerson and Weber (993). Exaples of gae theoretic odels include Palfrey and Rosenthal (983), Myerson (998, 000), Capbell (999), and Borgers (004). Models involving inforation aggregation include Feddersen and Pesendorfer (996, 997, 999), Austen-Sith and Bans (996), Deel and Piccione (000), and Battaglini (005).

3 of elections have explored several di erent ways that vote totals could a ect downstrea electoral or policy outcoes. One odelling approach is a coon values setup, in which voters use their votes to convey inforation about the state of the world. Pietty (000) develops a two period odel of referendu voting in which voters counicate policy inforation to each other as they vote. Razin (003) analyzes a odel of andates in which vote totals convey inforation to the winner of an election and thus a ect the policies she enacts. In this odel, the functional for of the election winner s response to signals is a priitive of the gae. Razin investigates liiting behavior for large electorates and characterizes two types of equilibria. In one type of equilibriu voters behavior is conventional in the sense that a voter whose private signal indicates that liberal policies are good tends to vote for a liberal candidate: In any liit of these conventional equilibria, the behavior of voters converges to coin ipping. The other equilibria are unconventional since voters respond perversely to their private signals: upon observing inforation that favors liberal policies, a voter becoes ore liely to vote for the conservative candidate. The equilibria of the Pietty and Razin odels suggest that a desire to in uence the decisiveness of victory, and not just the identity of the winner, can reain in large elections. However, in both odels all voters have identical preferences and the e ects that their votes can have on future policy outcoes are deterined directly by odelling assuptions, rather than being deterined by strategic choices ade by copeting political elites who observe election outcoes. Another odelling approach is a private values setup, in which voters can use their votes to a ect future candidates positions, and thus policy outcoes. Each election thus serves two purposes: to select a winner and to act as a poll about voters preferences. In this vein, Meirowitz and Tucer (007) analyze a odel of alternating priary and presidential elections, in which voters use their votes to signal dissatisfaction with an incubent and thereby induce hi to exert costly e ort to ae hiself ore appealing in a subsequent election. Castanheira (003) adapts Pietty s odel to a private values setting, and uses it to analyze voting for losers in an election with four candidates. In his odel, there are four possible distributions of This result is Razin s Proposition 4, part (i).

4 voters in the electorate, and voters ay choose to vote for a candidate who is alost certain to lose in the rst election since their vote ay deterine which of four positions candidates will adopt in a second period election. In Castanheira s odel, as in Pietty s odel, the signaling e ect of rst period electoral behavior is based on the very low probability event that a vote is inforationally pivotal, i.e., although there is signaling in these odels, the signaling is fundaentally based on pivot events, which are extreely unliely to occur. In contrast, Shotts (006) develops a private values odel of repeated elections in which each voter s actions, by conveying inforation about his preferences, always have soe sall e ect on future policy outcoes. Sall agnitude, high probability signaling e ects wor quite di erently fro large agnitude low probability pivot e ects. However, in large elections, a single vote has a vanishingly sall e ect on politicians beliefs about voter preferences, and Shotts does not address the question of whether signaling otivations are actually relevant in large elections. Moreover, a voter ay nd herself cross-pressured when a vote for the candidate she prefers sends the wrong essage to politicians, i.e., she ay wish to vote for one candidate for signaling reasons and a di erent one for pivot reasons. Because both the lielihood that she is pivotal and the e ect of a single vote on candidates vote shares are sall it is not clear how tradeo s between pivot and signaling e ects balance out in equilibria for large elections. Thus, although recent papers have oved beyond pivot-based theories of voting, they do not shed light on the question of whether equilibriu behavior in large repeated elections with private values is driven by pivot or signaling considerations. In this paper, we analyze a private values odel of repeated elections with both pivot and signaling otivations and show that the latter doinates with a large electorate. While our paper is related to that of Meirowitz (005), which focuses on signaling otivations in public opinion, it is, however, closest to that of Shotts (006). Shotts analyzes elections with a xed population and focuses on equilibria in which oderates abstain, to signal that they are oderate. In contrast, we analyze a odel without the possibility of abstention and focus on liiting behavior for large electorates. It turns out that the assuption that voters cannot abstain is not crucial for our results. Huel (007) builds on the present paper and Shotts (006) to study liiting behavior when voters can choose to abstain. Huel shows that although the type of equilibriu with abstention characterized 3

5 by Shotts exists for any nite population, in the liit abstention vanishes and voter behavior converges to the behavior we characterize here. Huel also derives a useful lower bound for the agnitude of signaling e ects in large elections. Having discussed the relevant literature, we now suarize our contribution. The ey eleents of our odel are as follows. Each voter in our odel has private inforation about his own policy preferences, and in each of two elections he casts a ballot for one of two available alternatives. Following the rst election, two o ce-otivated candidates copete for a second o ce, by staing policy positions, and the second election is held. Candidates in the second period base their policy positions on beliefs about the distribution of preferences in the electorate. In equilibriu these beliefs are infored by the vote totals in the rst election, and each voter s vote in the rst period thus has a sall signaling e ect on second period policy. Our ain result is that as the electorate gets large the equilibriu converges to the equilibriu of a slightly di erent gae in which the rst period outcoe is payo irrelevant, as in the case of a rst period poll. In other words, in large elections behavior is driven by the signaling otivation and not the pivot otivation. This result has potentially iportant iplications for the literature on pivot-based odels of elections, since ost of the interesting equilibria in such odels rely heavily on the fact that a voter only cares about events in which his vote is pivotal. In our odel, in contrast, the e ect of pivot events on equilibriu voter behavior is relatively uniportant copared to the e ect of signaling concerns. At the very least, future research needs to tae seriously the possibility that pivot events are not of rst-order iportance when rational voters tae into account the future e ects of their votes. The paper proceeds as follows. Section introduces the odel and in Section 3 we present two concrete exaples of how signaling and pivot e ects wor. Section 4 proves equilibriu existence. Section 5 describes the intuition behind our ain result, which is proved in Section 6. Section 7 discusses the result. 4

6 The Model Consider an electorate with an odd nuber of voters n 3: It will be convenient to use the fact that n = + for soe integer : Let the set of voters be N, and let each voter i N have an ideal point, v i [0; ]: We assue that the ideal points are iid draws fro a distribution function, F (); which is strictly increasing and continuously di erentiable, and has a continuous density f() on the support [0; ]. Each voter s utility over policy, x; in a given period is u i (x) = (jx v i j) where : [0; ]! R + is strictly increasing, convex and di erentiable. Since expected utility is de ned only up to positive a ne transforations we ae the innocuous but convenient assuption that 0 () = : The voter s total utility is siply the su of his policy utility in the two periods. In the rst period election, two xed alternatives are available. We denote the locations of the alternatives by L; R [0; ] (with L R): If voters care only about the rst period, or are yopic, eliination of wealy doinated strategies yields a unique equilibriu, in which all voters to the left of x p = L+R vote L and all voters to the right of x p vote R: We call this the pivot cutpoint. We, however, are interested in the dependencies across elections, and thus consider a odel with two periods, building on Shotts (006). In the second period, two o ce otivated candidates select policy platfors and then the electorate votes. The candidates are assued to now only the distribution F () fro which the n ideal points are drawn, the size of the electorate, n, and the voters rst period actions. Fro Calvert (985), we now that for a gae in which two o ce otivated candidates believe that F () is the distribution of the voter s ideal point, in any Nash equilibriu with wealy undoinated voting the candidates will both locate at F ( ):3 In the two-period signaling gae that we study, in any Perfect Bayesian equilibriu, the distribution of the depends on the rst-period votes via Bayes Rule. At any history in which F () is a distribution consistent with Bayes Rule following the observed rst period voting, the second period candidates both locate at the point F ( ): While Shotts (006) focuses on equilibria with abstention in the rst period, we restrict the set of actions available to voters so that they ust vote either L or R; this enables us to focus on a particularly siple class of equilibria, 3 One such equilibriu has each voter ipping a fair coin when indi erent. Given strategies for the rst period, the second period behavior is standard, and well understood (Calvert 985, Shotts 006). 5

7 involving only a single cutpoint. In particular, we focus on a class of equilibria in which all voters use the sae type speci c onotone voting strategy. In such an equilibriu, rst-period voting strategies are characterized by a cutpoint x c with voters to the left ( v i < x c ) voting L and voters to the right (v i > x c ) voting R. If voting satis es this cutpoint, i.e. it is onotone, then the nuber of votes for R, denoted #R; captures all of the publicly available inforation about voter ideal points, and is a su cient statistic for the second-period candidates proble of inferring the distribution of the voter s ideal point fro rst-period behavior. We denote such a posterior distribution as F ( j #R; x c ): Before proceeding we provide a few coents about this function. Given that #R of n voters have ideal points to the right of (greater than) x c ; the is less than x c if and only if #R = n. Siilarly the is greater than x c if and only if #R +. In the forer case, the is the ( + ) th lowest ideal point of the n #R voters with ideal points less than x c, i.e., the ideal point is the ( + ) th order statistic fro n #R draws fro the distribution H (x; x c ) = F (x) F (x c) with support [0; x c ]. Siilarly in the latter case, the is the ( + (n #R)) th order statistic fro #R draws fro the distribution H + (x; x c ) = F (x) F (xc) F (x c) with support [x c ; ]: As previously entioned, Calvert s result shows that given x c, #R, and a belief apping F (j#r; x c ) sequential rationality of the candidates and wealy undoinated voting by the voters iplies that the second period policy is F ( j #R; x c): In characterizing a cutpoint perfect Bayesian equilibriu with wealy undoinated second period voting strategies it is su cient to characterize a rst period cutpoint x c [0; ] such that if every voter other than i is using the strategy with cutpoint x c it is optial for voter i to do so as well. Checing this condition hinges on the fact that in an equilibriu of this for second period candidates both locate at the point F ( j #R; x c): The equilibriu cutpoint balances two e ects that in uence rst period voting. The pivot e ect captures the incentive to vote for L if jl v i j < jr v i j and R if the opposite is true. The signaling otivation captures the incentive to vote for R if, given i s expectations about the actions of the other voters, increasing #R is liely to ove the second period policy F ( j #R; x c) towards v i, and to vote for L if increasing #R is liely to ove the second period policy away fro v i. The pivot e ect is the product of the probability that i is pivotal and the payo di erence between the policy L and R: 6

8 In contrast to the pivot e ect, which captures a low probability event with a non trivial payo in that event, the signaling otivation taes into account the fact that i s vote will always have an e ect on the second period policy. However, the signaling e ect is sall for each of the possible realizations of the votes cast by Nnfig. For soe realizations of the votes by Nnfig increasing #R will be attractive to i, while for other realizations of the these votes increasing #R will be unattractive to i. The goal of this paper is to copare high ipact, low probability pivot events versus low ipact, high probability signaling e ects and deterine which type of e ect doinates in large elections. In particular we investigate the liiting behavior of the cutpoint x c as n tends to in nity. We nd that the liiting cutpoint corresponds to the equilibriu cutpoint in a di erent gae in which the rst period is irrelevant (or, equivalently, L = R) so that, in the liit, the cutpoint for voter behavior is identical to what it would be if voters were otivated purely by signaling concerns. Thus, we nd that while equilibriu voting involves a balancing of these two otivations, in a very strong sense, equilibriu voting in large elections is driven by voters desire to in uence the inferences of observers and not by their desire to in uence the election at hand. 3 Two Exaples Before analyzing the odel, we illustrate it with two siple exaples. Exaple. We start with what is essentially a decision-theoretic version of the odel, in which there is just one voter, with ideal point v i and a linear loss function (jx v i j) = jx v i j. Suppose the exogenously- xed rst period candidate locations are L = and R = : The second period candidates believe that the single voter s ideal point is drawn fro a unifor distribution on [0; ]. Thus, if the voter s strategy is onotone, with cutpoint x c ; the second period policy will be xc if i votes for L and +x c if i votes for R. For i to be indi erent between voting L and R when her ideal point is v i = x c, the following equality ust hold: jx c Lj x c x c = jr x c j x c + x c : For L = and R = this equality is solved at x c = 3 : Exaple. To illustrate how pivot and signaling e ects wor in the odel, we now consider the 7

9 siplest variant where a vote has a probabilistic e ect on both rst and second period outcoes. While this exaple cannot resolve the horse race between the signaling and pivot e ects as the nuber of voters gets large, all of the relevant incentives and quantities of interest are present. Consider n = 3 and assue that voters i f; ; 3g have ideal points that are i:i:d: draws fro a unifor distribution on [0; ]. Assue that each voter has a linear loss function (jx v i j) = jx v i j : The rst-period election is between two candidates, with exogenously- xed policy positions L = and R = : We rst consider two benchar cases: a pure pivot odel and a pure signaling odel. In a pure pivot odel there is a unique voting equilibriu in wealy undoinated strategies: a voter votes for the closer candidate, i.e., she votes for L if her ideal point is to the left of L+R = 0:75 and votes R if her ideal point is to the right of 0:75: So x p = 0:75 is the pivot cutpoint. For a pure signaling odel, all that atters is how a vote a ects F ( j #R; x c) through #R: If voters only care about the outcoe of the second period election then in the three voter exaple there is a unique equilibriu, speci ed by the signaling cutpoint, x s = =: To chec that this cutpoint is an equilibriu in the gae in which only the second period outcoe a ects voter payo s, we con r that a voter with v i = = is indi erent between voting L and R; given the other actors strategies: Focusing on voter i = ; assue that the other voters are using this cutpoint strategy. The signaling e ect of i 0 s rst-period vote thus depends on the other voters rst-period actions: With probability F (x s )F (x s ) = = 0:5 the other two voters vote L. In this case the secondperiod policy outcoe will be 0:5, if i votes L. This is true because the second-period candidates posterior belief given #R = 0 and x s = = is that all three voters ideal points are unifor draws fro [0; 0:5]: If i votes R the second-period policy outcoe will be F j; = = 0:35, since there is a 50% chance that both of the L voters, and hence the, will be to the left of 0:35: Thus, the signaling e ect of voting R if both other voters vote L is to ove the second-period policy outcoe fro 0:5 to 0:35: With probability F (x s ) ( F (x s )) + ( F (x s )) F (x s ) = = 0:5 the other two voters split their votes. In this case if i votes L the second-period policy outcoe will be 0:35 and if she votes R the policy outcoe will be 0:65: 8

10 With probability ( F (x s )) ( F (x s )) = = 0:5 the other two voters vote R. In this case if i votes L the second-period policy outcoe will be 0:65 and if i votes R the policy outcoe will be 0:75: Thus, if a voter with ideal point v i votes L her expected second-period utility is 0:5 jv i 0:5j 0:5 jv i 0:35j 0:5 jv i 0:65j : If she votes R her expected utility is 0:5 jv i 0:35j 0:5 jv i 0:65j 0:5 jv i 0:75j : A voter at v i = x s = = is indi erent between voting L and voting R: It is straightforward to con r that any voter left of = strictly prefers to vote L and a voter to the right prefers to vote R: It is worth noting three features of signaling e ects that will show up in our later analysis of large elections. First, which action, L or R; better prootes the voter s policy interests in the second period depends on the other voters actions, as well as the cutpoint x s : For a voter with v i = =; if the other two voters vote L then voting R is optial, whereas if the others vote R then voting L is optial, and if the others split their votes then the voter is indi erent. Second, the di erent signaling e ects are not equally liely to occur, but rather occur with di erent probabilities. Third, since the other voters actions are siply draws fro a binoial, in a large election, the ost liely realized vote totals are those where L receives a share close to F (x s ) of the votes and R receives a share close to F (x s ) of the votes. All three of these properties of signaling e ects hold regardless of the cutpoint for voter behavior in the rst period. In a odel with both pivot and signaling e ects, equilibriu behavior hinges on the cobined cutpoint x c : As shown in Figure, in the three-voter exaple, x c 0:65: 4 For this x c the pivot probability is 0:65 ( 0:65) = 0:455: For a voter with v i = x c the utility di erence between the two possible rst-period policy outcoes, L and R; is jv i Lj + jv i Rj = 0:65 + j0:65 j = 0:: So i receives, in expectation, 0: 0:455 0:09 ore rst-period utility by voting L than by voting R: [Insert Figure about here] The second-period signaling e ect is a bit ore coplicated to copute: 4 It is just coincidence that this value for x c is the sae, to two decial places, as the second period policy outcoe under one of the action pro les in the pure signaling odel. For the general odel, they need not be the sae. 9

11 With probability F (x c ) F (x c ) = 0:65 0:65 = 0:45 the other two voters vote L. In this case the second-period policy outcoe will be 0:35 if i votes L: If i votes R the second-period policy outcoe will be 0:463. With probability F (x c ) ( F (x c )) + ( F (x c )) F (x c ) = 0:65 ( 0:65) = 0:455 the other two voters split their votes. In this case if i votes L the second-period policy outcoe will be 0:463 and if i votes R the policy outcoe will be 0:756: With probability ( F (x c )) ( F (x c )) = ( 0:65) ( 0:65) = 0:5 the other two voters vote R. In this case if i votes L the second-period policy outcoe will be 0:756 and if i votes R the policy outcoe will be 0:85: Thus, if a voter with ideal point v i votes L his expected second-period utility is 0:45jv i 0:35j 0:455jv i 0:463j 0:5jv i 0:756j ; which equals 0:4 for v i = 0:65: And if i votes R his expected utility is 0:45jv i 0:463j 0:455jv i 0:756j 0:5jv i 0:85j ; which equals 0:5 for v i = 0:65: The di erence is equal to 0:09; and for v i = x c it exactly counteracts the rst-period utility gain that the voter receives by voting L rather than R: Thus at x c the pivot and signaling e ects cancel each other out and the voter is indi erent. This exaple illustrates the basic tension between pivot and signaling e ects in our odel. In this three voter exaple, the equilibriu cutpoint is x c 0:65; which lies between the signaling cutpoint, x p = 0:5; and the pivot cutpoint, x s = 0:75: The question is how a sequence of equilibriu cutpoints fx g will behave in the liit as the population size n = + gets large. The di culty in answering this question is that in large elections both the pivot e ect and the signaling e ect becoe sall; the probability of a pivot event goes to zero and the distance that second-period candidates ove in response to a single vote also goes to zero. The question is which converges faster. 4 Preliinary Results In this section we establish two leas that are useful in establishing existence of a particular type of equilibriu for any n as well as in proving the ain result about the liiting behavior of this type 0

12 of equilibriu. We then present the existence result. Our analysis focuses on a particular class of equilibria. De nition (Syetric Cutpoint Strategy) Voters use a syetric cutpoint strategy if there exists a point x c [0; ] such that for all i N () if x c = 0 then i votes L if v i = 0; and i votes R if v i > 0 () if x c (0; ]; then i votes L if v i < x C ; and votes R if v i x c : Given that all other voters use a syetric cutpoint strategy with cutpoint x c ; optial behavior for a voter with ideal point v i depends on the di erence in her expected utility between voting R and voting L in the rst period. Using a i fl; Rg to denote voter i0 s rst period action, we can express this di erence as u dif (v i ) u(a i = Rjv i ) u(a i = Ljv i ) = u dif (v i ) + u dif (v i ) () where u dif (v i ) F (x c ) ( F (x c )) ((jl v i j) (jr v i j)) () and u dif (v i ) X =0 (F (x c )) ( F (x c )) 0 ( F ( j; x c) v i ) ( F ( j + ; x c) v i) C A : (3) Thus u dif (v i ) captures the rst period e ect of voting: the pivot probability is (F (xc )) ( F (x c )) and the utility di erence between the two candidates is (jl v i j) (jr v i j) for a voter with ideal point v i. Liewise, u dif (v i ) captures the second period e ect: the probability that other voters vote R is (F (xc )) ( F (x c )) and the utility di erence between voting R versus L in this event is ( F ( j ; x c) v i ) ( F ( j + ; x c) v i ): Rear : Deriving F (yj#r; x c ) for x c (0; ) To understand u dif (v i ) it is iportant to see how F (yj#r; x c ) depends on #R and x c. This function can be characterized in ters of order statistics. We note that for xed x c (0; ); the distribution of the is constructed as follows. Given that there are n #R draws with values strictly less than x c and #R draws with values greater than or

13 equal to x c we now that the is less than x c if #R is strictly less than + and it is greater than x c otherwise. If #R < +; the is the + largest of n #R draws fro the conditional (on y < x c ) distribution H if #R < + ; F (yj#r; x c ) = H +;n (y; x c ) = axf0; inf; F (y) F (x c) gg: Accordingly #R (y; x c ), which is the distribution of the ( + ) th order statistic fro n #R draws fro the distribution function H (; x c ): Siilarly if #R +, the is the (+ (n #R)) th order statistic fro #R draws fro the conditional (on y > x c ) distribution H + (y; x c ) = axf0; inf; F (y) F (xc) F (x c) gg. So if #R + then F (yj#r; x c ) = H + (n #R);#R (y; x c), which is the distribution of the ( + (n #R)) th order statistic fro #R draws fro the distribution function H + (; x c ). Rear : Deriving F (yj#r; x c ) for x c f0; g Now consider extreal cutpoints, x c f0; g: If x c = 0 then according to De nition, all voters with ideal points in (0; ] vote R and voters with ideal point v i = 0 vote L: Accordingly, if #R < + then the voter s ideal point is 0 with probability and F (yj#r; 0) is constant at for all y [0; ]: In this case, we de ne F ( j #R; 0) = 0 and it is clear that equilibriu second period candidate locations are at 0. If #R + then the is the ( + (n #R)) th order statistic fro #R draws fro F (). This distribution corresponds to H + (y; x c ) = F (y) F (0) F (0) with support [0; ]: If x c = then according to De nition, all voters with ideal point vote R and all voters with ideal points v i [0; ) vote L: Accordingly, if #R + then the voter s ideal point is at with probability and F (yj#r; ) is constant at 0 for all y [0; ) and equal to at y = : In this case we de ne F ( j #R; ) =. If #R < + then the is the ( + ) th order statistic fro n #R draws fro F (): This distribution corresponds to H (y; x c ) = F (y) F () on [0; x c]: One way to see how the distribution function F (j; ) behaves as the arguents #R and x c change is to consider the case of the unifor, F (y) = y on [0; ]: Figure plots the function H (y; x c ) for x c f0; 0:65; g. Figure 3 plots H +;n #R (y; x c ) for n = ; = 5 and #R f; 3g : This gure shows how increasing #R shifts the second period candidates beliefs about the location of the

14 to the right, thereby causing F ( j #R; x c) to increase. [Insert Figures and 3 about here] Cobining Rears and, we can express the second period policy location as a function of x c and #R when voters use a syetric cutpoint strategy. 8 0 if x c = 0 and #R < + >< (x c ; #R) = >: if x c = and #R + fy : H +;n #R (y; x c ) = g if x c (0; ] and #R < + fy : H + + (n #R);#R (y; x c) = g if x c [0; ) and #R + : The rst lea builds on this derivation to establish properties of the distribution of the and the above apping Lea (Properties of Second Period Policy Outcoes) If voters use a syetric cutpoint strategy with cutpoint x c then () For each #R < + and y [0; ]; F (yj#r; x c ) is wealy decreasing in x c for x c [0; y) and strictly decreasing for x c [y; ] and for each #R + and y (0; ); F (yj#r; x c ) is wealy decreasing in x c for x c (y; ] and strictly decreasing in x c [0; y] : () If #R < #R (both in 0; ; ; :::; n) then for each x c (0; ), for soe set A xc [0; ] with positive lebesgue easure F (yj#r ; x c ) > F (yj#r ; x c ) if y A xc and F (yj#r ; x c ) F (yj#r ; x c ) for all y [0; ]: For x c f0; g ; F (yj#r ; x c ) F (yj#r ; x c ) for all y [0; ]: (3) For any #R f0; ; ; :::; n g and x c [0; ]; F ( j #R; x c) F ( j #R + ; x c): (4) F (yj#r; x c ) is continuous in x c on (0; ) for each #R f0; :::; ng and y [0; ] as well as continuous in y on [0; ] for each #R f0; :::; ng and x c (0; ): x c. (5) The apping (x c ; #R) is a function fro [0; ] f; ::::; ng into [0; ] and it is continuous in Proof: () Assue #R < + : Fro our derivation of F (yj#r; x c ) in Rear this distribution taes on the value if y x c and H +;n #R (y; x c ) otherwise. Thus the conclusion that it is wealy 3

15 decreasing for x c [y; ] is iediate. Consider x c < x 0 c: Since F (y) F (x 0 c) < F (y) F (x c ) H (y; x 0 c) < H (y; x c ) for all x < x c and thus the forer rst order stochastically doinates the latter on [0; x c ]. This ordering of H (y; x 0 c) and H (y; x c ) iplies that the distributions of order statistics, H +;n #R (y; x 0 c) and H +;n #R (y; x c ) are also ordered by rst order stochastic doinance (see for exaple Theore 4.4. of David and Nagaraja, p. 75). An analogous arguent holds in the case of #R +, establishing that H + + (n #R);#R (y; x0 c) and H + + (n #R);#R (y; x c) are ordered by rst order doinance. () To establish strict onotonicity in #R, consider two integers, #R and #R, with 0 #R < #R n. If #R < + #R then the support of F (j#r ; x c ) is [0; x c ] and the support of F (j#r ; x c ) is [x c ; ]: Since the distribution F () is strictly increasing on [0; ]; F (yj#r ; x c ) > 0 for all y (0; x c ) while F (yj#r ; x c ) = for all y x c. Siilarly, F (yj#r ; x c ) = 0 for all y x c and F (yj#r ; x c ) < for y (x c ; ) : Thus, F (yj#r ; x c ) F (yj#r ; x c ); with a strict inequality for any y = f0; g : Suppose instead that #R < #R < +: The relevant coparison is now between H +;n #R (y; x c ) and H +;n #R (y; x c ): To see that these two distributions are ordered by rst order stochastic doinance, we can partition n #R draws fro F () into two sets: rst n #R draws are taen and then another #R #R are taen. Because F () is strictly increasing on [0; ]; the probability that one of the #R #R draws is less than the + highest draw of the rst #R #R draws is strictly positive, and thus H +;n #R (y; x c ) < H +;n #R (y; x c ) for y on [0; x c ]. This iplies that F (yj#r ; x c ) F (yj#r ; x c ) with a strict inequality if y A xc = [0; x c ) if #R < #R < + : A siilar arguent holds for A xc = (x c ; ] and + #R < #R : The result for x c f0; g follows fro Rear. (3) Follows iediately fro (). (4) Continuity of F (yj#r; x c ) in x c on (0; ) for each #R f0; :::; ng and y [0; ] as well as continuity in y on [0; ] for each #R f0; :::; ng and x c (0; ) follows fro the assuption that F () is strictly increasing and continuously di erentiable and the fact that the distribution of an order statistic fro a di erentiable distribution function has a density. In particular, for #R < + the distribu- 4

16 h tion F (yj#r; x c ) has density h +;n #R (y; x c i F (y) F (y) a F (x c) F (x c) ( F (y) F (x c) )b for integers ; a; b: For #R + ; the distribution F (yj#r; x c ) has density h + + (n #R);#R (y; x c) = h i a 0 F (y) F (y) ( F (y) ) b0 for soe 0 ; a 0 ; b 0 : Since we have assued F (xc) F (x c) F (xc) F (x c) F (xc) F (x c) F () has a continuous density, for xed #R; as long as x c (0; ) the above densities are well de ned and thus the distribution functions are continuous. (5) To show that (x c ; #R) is de ned on its doain we ust show that fy : H +;n #R (y; x c ) = g is non-epty if x c (0; ] and #R < + and that fy : H + + (n #R);#R (y; x c) = g is non-epty if x c [0; ) and #R +: In the rst case, consider x c (0; ] and #R < +: Fro the proof of part 4 of this lea we see that H +;n #R (y; x c ) has a continuous density function that is strictly positive as long as y < x c : So the function H +;n #R (y; x c ) is continuous and strictly increasing in y on [0; x c ] with 0 = H +;n #R (0; x c ) < < H +;n #R (x c; x c ) = : This eans that the set S (x c ; #R) = fy [0; ] : H +;n #R (y; x c ) (0; )g is non-epty for x c (0; ] and #R < + : Moreover, by the interediate value theore this eans that the set fy : H +;n #R (y; x c ) = g is non-epty if x c (0; ] and #R < +: An analogous arguent establishes that fy : H + + (n #R);#R (y; x c) = g is non-epty if x c [0; ) and #R + : To show that (x c ; #R) is a function it is su cient to note that F (j#r; x c ) has the property that for each value of x c and #R there are nubers, a ; a [0; ] such that F (j#r; x c ) is constant at 0 on [0; a ]; F (j#r; x c ) is strictly increasing on [a ; a ] and F (j#r; x c ) is constant at on [a ; ]: This eans that the equation F (j#r; x c ) = has at ost one solution (and it is in [a ; a ]). To establish continuity we consider two cases. First assue that #R < + : By part 4 of this lea, for a xed y, H +;n #R (y; x c ) is continuous in x c on (0; ) and thus this and the fact that it is strictly increasing (and has a density) in y on a neighborhood of the point fy : H +;n #R (y; x c ) = g iplies by way of the iplicit function theore that the solution (x c ; #R) is continuous in x c if x c (0; ) and #R < + : Continuity at x c = 0 follows fro the fact (x c ; #R) x c if #R < + and thus li xc!0 (x c ; #R) = 0 and (0; #R) = 0. Continuity at x c = follows fro the fact that H +;n #R (y; ) is de ned and for each y; H +;n #R (y; x c ) is continuous in x c at : An analogous arguent about H + + (n #R);#R (y; x c) establishes continuity in the case of #R + : 5

17 The next result establishes soe properties of the utility di erence function in Equation. Since this result siply uses conclusions fro Lea in standard ways the proof is in the appendix. Lea (Properties of Utility Di erence Function) If voters use a syetric cutpoint strategy with cutpoint x c then () u dif (v i ) is continuous and wealy increasing in v i : () (Lipschitz property) 8~v i ; ^v i [0; ], ju dif (~v i ) u dif (^v i )j 4 j~v i ^v i j : (3) u dif (0) 0 and u dif () 0: We can now state our rst ain result. The proof, which applies a standard xed point arguent to the function u dif (), is in the appendix. Proposition There exists an equilibriu in which voters use a syetric cutpoint strategy in the rst period. 5 Intuition for the Convergence Result Having established existence, we now turn to the question of equilibriu behavior in large electorates, i.e., as!. We suppress the c subscript and let x denote the cutpoint in a syetric cutpoint strategy equilibriu with n = + voters. Our interest is then in li! x (if it exists). We show that this liit is equal to the point F ( ): Since this liit does not depend on the rst period candidate locations L and R, it is also the liit of cutpoints for equilibria in the pure signaling gae. The proof proceeds by contradiction. We show that if a sequence of cutpoints does not converge to F ( ) then these cutpoints cannot be equilibriu cutpoints for in nitely any values of because voters at the cutpoint x ; who ust be indi erent in equilibriu, will strictly prefer to vote for one candidate over the other. To be ore precise, we show that if any subsequence of equilibriu cutpoints converges to a point other than F ( ) then for su ciently large a voter with ideal point x will strictly prefer to vote for one candidate over the other. Once it is established that no subsequence converges to a point other than F ( ) it follows that every subsequence, and thus the actual sequence, converges to F ( ): This brief section serves as a roadap for the proof, presenting an inforal version of the arguent. The next section contains a proof of the ain result. 6

18 Suppose that in a large electorate voters behave according to a cutpoint x which is converging to a nuber Z > F ( ): We show that for large values of a voter at x will strictly prefer to vote R. There are three types of e ects that the voter ust consider. The rst consideration is a pivot e ect, which we label P V: Since the election is not expected to be a tie, i.e., x 6= F ( ), and the population size is large, the probability of this pivot event is exceedingly sall in a large electorate. The second consideration involves bad signaling e ects fro voting R; whenever ore than half of the other voters vote R, the second period policy will be to the right of x, so if a voter with v i = x c votes R this will ove second period policy to the right, i.e., away fro his ideal point, as established in part 3 of Lea. However, because x > F ( ); ore than half of the votes are expected to go to L; and thus in a large electorate bad signaling e ects are extreely unliely to occur. We nd an upper bound on the probability-weighted su of these bad signaling e ects, and label it U BBS (upper bound for bad signaling ). The third consideration involves good signaling e ects fro voting R; whenever ore than half of the other voters vote L, the second period policy will be to the left of x, so if a voter with v i = x votes R this will ove second period policy to the right, i.e., towards his ideal point. Since x > F ( ); ore than half of the votes are expected to go to L; and thus in a large electorate it is extreely liely that the signaling e ect of voting R will be good. We nd a lower bound on the probability-weighted su of these good signaling e ects, and label it LBGS (lower bound for good signaling ). We consider the ratio of bad signaling plus pivot e ects to good signaling e ects, and show that this ratio P V + UBBS LBGS can be expressed as a liit of the for li! P tie + ( + ) P tie : (4) cp In this expression, P tie = F (x ) ( F (x )) is the probability of an exact tie aong the other voters given the cutpoint x. In the denoinator, P is the probability of a certain type of good signaling e ect, and P goes to zero uch ore slowly than P tie : The c in the denoinator is a constant that does not depend on. At the end of the proof we show that Equation 4 is bounded by an 7

19 expression of the for ( + ) q ( c ) with constants q (0; ), and c (0; =) : Thus the liit of Equation 4 is 0, which eans that for a voter with ideal point x (and voters with ideal points close enough to x ) it will be optial to deviate and vote R: 6 The Convergence Result Our ain result is Proposition li! x = F ( ): Proof: Assue by way of a contradiction that the cutpoints do not converge to the point M F ( ): Because x [0; ], 8; the Bolzano-Weierstrass Theore iplies that there exists soe nuber Z [0; ] with Z 6= M such that a subsequence fx 0g! Z: We focus on such a subsequence, ignoring the residual portion of the original sequence. Thus the assuption that Proposition is false equates to the clai that fx g! Z. Either Z < M or Z > M and in the reainder of the proof we focus on the latter case; the arguent for the forer case is virtually identical and is thus oitted. Our goal is to show that there exists a such that if > then a voter with ideal point x has a strict preference to vote for R: Once this clai is established, the continuity of the utility functions established in Lea iplies that for > there exists a > 0 such that if v i (x ; x + ) a voter with ideal point v i prefers to vote for R when everyone else uses the cutpoint x : Thus for soe voters to the left of x voting L is not a best response, contradicting the hypothesis that x is an equilibriu cutpoint when the population size is + : This contradiction eans that we cannot have a subsequence of cutpoints converging to any Z 6= M and thus the sequence of cutpoints converges to M: For each, consider a voter, i, with ideal point x. Given that voters to the left of x vote L and voters to the right of x vote R, the probability of any individual voting R is p F (x ): Since x > F (=) we now that p < : We start by analyzing the utility function of a voter with ideal point x : If exactly voters other than i vote R then the election is tied, and i s vote is pivotal in deterining the rst period policy. 8

20 However, in ters of rst period otivations, which depend on the candidate locations L and R; it is not clear whether i prefers to vote L or vote R in the event that he is pivotal. In ters of second period otivations, which depend on candidate locations given #R; it is also unclear whether i prefers to vote L or vote R in the event that he is pivotal. In contrast, the voter s preferences are clear for events in which he is not pivotal. If or fewer of the other voters vote for R the second period policy will be to the left of x regardless of i s vote and if at least + of the other voters vote for R then the second period policy will be to the right of x regardless of i s vote (as established in Rear ). These facts and the onotonicity of the second period policy in #R (part 3 of Lea ) iply that if or fewer of the other voters vote for R then a vote for R oves the second period policy closer to i s ideal point. On the other hand, if at least + of the other voters vote for R; then a vote for R oves the second period away fro i s ideal point. Note that in either of these cases; i s vote cannot ove policy far enough to leapfrog her ideal point, x (see Rear ). Following Equations,, and 3, given the conjectured equilibriu for population size n = + ; the utility di erence between voting R versus voting L for a voter with ideal point v i = x in the equilibriu with population size + is u dif (x ) u dif (x ) + u dif (x ) which we re-write as u dif (x ) = ( p ) p ((jl x j) (jr x j)) (5) X + =0 + + X =+ ( p ) p ( p ) p ( p ) p ( F j; x x ) ( F j + ; x ( F j; x x ) ( F j + ; x ( F j; x x ) ( F x ) j + ; x The rst line of Equation 5 is the pivot e ect. The second line represents good signaling e ects of x ) x ) : voting R when or fewer other voters vote R. The third line represents the indeterinate signaling e ect when the other voters split their votes equally between L and R. The fourth line represents bad signaling e ects, when + or ore other voters vote R: 9

21 Our ultiate goal is to show that there exists an such that for > ; u dif (x ) > 0: To siplify the expression in Equation 5, we rst siplify each coponent of the utility function, by nding bounds that liit how severe the bad e ects of voting R can be, along with a lower bound on good e ects of voting R: Pivot e ect. The pivot e ect can be either positive or negative, depending on the positions of the two rst-period candidates. A bound based on the fact that L; R, and x are all in the interval [0; ]; will be su cient: ( p ) p ((jl x j) (jr x j)) > ( p ) p 0 () = ( p ) p : (6) Recall that we have noralized utility so that 0 () = and we have assued that this function is convex, allowing us to treat the axial possible utility di erence between L and R as. Bad and indeterinate signaling e ects. For any f; ::; n g, F j; x (0; ) and F j + ; x (0; ), so X ( p ) p ( F =+ + ( p ) p ( F X > = j; x j; x x ) ( F j + ; x x ) ( F j + ; x X ( p ) p ( p ) p 0 () = = x ) We will use repeatedly the fact that the binoial expansion is onotonic. In particular, since p < =; x ) for any f + ; :::; g ; ( p ) p < ( p ) p : As a consequence of this fact, the total of the bad and indeterinate signaling e ects ust be strictly greater than ( + ) ( p ) p : (7) Good signaling e ects. We now develop a lower bound on good signaling e ects. Fix any points A and B in the unit interval such that M < A < B < Z: For any ; let A represent the largest nuber less than A such that for soe integer a < + it is the case that A = F ja ; x : Liewise, let B represent the largest nuber less than B such that for soe integer b < + it is the case that B = F jb ; x : For the b identi ed in the de nition of B let C = F jb + ; x : 0

22 For su ciently large it turns out that M < A < B < B C < Z, and since we are interested in the liit as! we henceforth focus on values of that are large enough for this inequality to hold. Since A B < B < Z are true by construction, establishing that these inequalities eventually hold requires only that we show that (i) M < A, (ii) B C < Z and (iii) A < B for large enough. Each of these results follows fro the fact that for any q (0; ) the sequence F j( + )q + ; x F j( + )q; x converges to 0. To see this note that in the rst instance this fact allows us to conclude that if A < M in nitely often then it is not the case that for every ; A < F ja + ; x ; which contradicts the de nition of A (and a ). In the second instance, if Z < C in nitely often then this fact eans that we ust have B < B for in nitely any values of (contradicting the de nition of B ) and if C < B in nitely often then this fact eans that for in nitely any values of ; B < C < B; contradicting the de nition of B : In the third instance the fact that A < B iplies that if A = B then A > A or F jb + ; x < B for in nitely any (contradicting the de nition of A or B ). For xed the set of pro les for other voters that, given i 0 s vote, can result in a policy between A and C consists of pro les for which the nuber of other voters that vote R is in the set fa ; a + ; ::::; b ; b g: Although we cannot analytically solve for the policy distance between F j; x and F j + ; x for particular values of ; we do now that b X =a F j + ; x F j; x = C A > B A: Since we have A < B < B C the last inequality above is due to the fact that A < A < B: We re-write the good signaling e ects ter fro Equation 5 as X =0 ( p ) p ( F j; x x ) ( F j + ; x x ) = ax =0 + + b X =a ( p ) p X =b + ( F ( p ) p ( F ( p ) p ( F j; x j; x j; x x ) ( F x ) ( F x ) ( F j + ; x j + ; x j + ; x x ) x ) x ) :

23 Because B < Z and () is convex the slope of the utility di erence to i with v i > Z+B for points in [0; B] is at least := 0 ( Z B ): Since () is strictly increasing 0 ( Z B ) > 0: Because x is assued to converge to Z; for su ciently large v i > Z+B : Thus, the good signaling e ects ter is eventually greater than b X =a ( p ) p F j; x x F j + ; x x : Since M < A < C and p < =; we now fro onotonicity of the binoial expansion that the event in which b others vote for R is the least liely of the set of pro les of the other voters in which i s vote can result in a policy in the interval [A ; C ]. Thus the above expression is greater than ( p ) b p b b b X =a F j; x Note that because 8 fa ; a + ; :::; b g ; F b X =a F j; x x F j + ; x j; x < F j + ; x < x ; x F j + ; x x x : (8) = F jb + ; x F ja ; x = C A > B A: Thus, we can rewrite Equation 8 to get the following lower bound for good signaling e ects: (B A) ( p ) b p b : (9) b Having derived bounds on pivot e ects, bad signaling e ects, and good signaling e ects (Equations 6, 7, and 9, respectively) we now substitute these bounds into the utility di erence expression in Equation 5 to get u dif (x ) > ( p ) p ( + ) ( p ) p + (B A) b ( p ) b p b : To show that there exists an, such that for > ; u dif (x ) > 0, it is su cient to show that li! ( p ) p + ( + ) ( p ) p (B A) b ( p ) b p b = 0:

Information Aggregation in Large Elections

Information Aggregation in Large Elections Information Aggregation in Large Elections David Austen-Smith Northwestern University June 10 2009 I Large Elections One dimensional spatial model with two given alternatives: 1 < B < A < 1 Voters: n nite,

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem 36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined

More information

Voluntary Voting: Costs and Bene ts

Voluntary Voting: Costs and Bene ts Voluntary Voting: Costs and Bene ts Vijay Krishna y and John Morgan z December 30, 200 Abstract We compare voluntary and compulsory voting in a Condorcet-type model in which voters have identical preferences

More information

Málaga Economic Theory Research Center Working Papers

Málaga Economic Theory Research Center Working Papers Málaga Econoic Theory Research Center Working Papers Unequivocal Majority and Maskin-Monotonicity Pablo Aorós WP 2008-3 March 2008 Departaento de Teoría e Historia Econóica Facultad de Ciencias Econóicas

More information

On the Bene ts of Costly Voting

On the Bene ts of Costly Voting On the Bene ts of Costly Voting Vijay Krishna y and John Morgan z May 24, 2008 bstract We study strategic voting in a Condorcet type model in which voters have identical preferences but di erential information.

More information

On the Existence of Pure Nash Equilibria in Weighted Congestion Games

On the Existence of Pure Nash Equilibria in Weighted Congestion Games MATHEMATICS OF OPERATIONS RESEARCH Vol. 37, No. 3, August 2012, pp. 419 436 ISSN 0364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/10.1287/oor.1120.0543 2012 INFORMS On the Existence of Pure

More information

Monetary Policy E ectiveness in a Dynamic AS/AD Model with Sticky Wages

Monetary Policy E ectiveness in a Dynamic AS/AD Model with Sticky Wages Monetary Policy E ectiveness in a Dynaic AS/AD Model with Sticky Wages Henrik Jensen Departent of Econoics University of Copenhagen y Version.0, April 2, 202 Teaching note for M.Sc. course on "Monetary

More information

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,

More information

ma x = -bv x + F rod.

ma x = -bv x + F rod. Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous

More information

Bootstrapping Dependent Data

Bootstrapping Dependent Data Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly

More information

On Constant Power Water-filling

On Constant Power Water-filling On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives

More information

arxiv: v1 [math.nt] 14 Sep 2014

arxiv: v1 [math.nt] 14 Sep 2014 ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October

More information

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest

More information

3.8 Three Types of Convergence

3.8 Three Types of Convergence 3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to

More information

MULTIPLAYER ROCK-PAPER-SCISSORS

MULTIPLAYER ROCK-PAPER-SCISSORS MULTIPLAYER ROCK-PAPER-SCISSORS CHARLOTTE ATEN Contents 1. Introduction 1 2. RPS Magas 3 3. Ites as a Function of Players and Vice Versa 5 4. Algebraic Properties of RPS Magas 6 References 6 1. Introduction

More information

Information Overload in a Network of Targeted Communication: Supplementary Notes

Information Overload in a Network of Targeted Communication: Supplementary Notes Inforation Overload in a Network of Targeted Counication: Suppleentary Notes Tiothy Van Zandt INSEAD 10 June 2003 Abstract These are suppleentary notes for Van Zandt 2003). They include certain extensions.

More information

Lecture Notes on Game Theory

Lecture Notes on Game Theory Lecture Notes on Game Theory Levent Koçkesen 1 Bayesian Games So far we have assumed that all players had perfect information regarding the elements of a game. These are called games with complete information.

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I Contents 1. Preliinaries 2. The ain result 3. The Rieann integral 4. The integral of a nonnegative

More information

PREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL

PREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL PREPRINT 2006:7 Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL Departent of Matheatical Sciences Division of Matheatics CHALMERS UNIVERSITY OF TECHNOLOGY GÖTEBORG UNIVERSITY

More information

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries 1. Introduction In this paper we reconsider the problem of axiomatizing scoring rules. Early results on this problem are due to Smith (1973) and Young (1975). They characterized social welfare and social

More information

Solutions of some selected problems of Homework 4

Solutions of some selected problems of Homework 4 Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

Contractual Frictions and Global Sourcing

Contractual Frictions and Global Sourcing Contractual Frictions and Global ourcing Pol Antràs and Elhanan Helpan Departent of Econoics, Harvard University May 6, 27 Abstract We generalize the Antràs and Helpan (24) odel of the international organization

More information

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES

More information

Uncoupled automata and pure Nash equilibria

Uncoupled automata and pure Nash equilibria Int J Gae Theory (200) 39:483 502 DOI 0.007/s0082-00-0227-9 ORIGINAL PAPER Uncoupled autoata and pure Nash equilibria Yakov Babichenko Accepted: 2 February 200 / Published online: 20 March 200 Springer-Verlag

More information

Approximation in Stochastic Scheduling: The Power of LP-Based Priority Policies

Approximation in Stochastic Scheduling: The Power of LP-Based Priority Policies Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

More information

arxiv: v1 [cs.ds] 3 Feb 2014

arxiv: v1 [cs.ds] 3 Feb 2014 arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/

More information

In this chapter, we consider several graph-theoretic and probabilistic models

In this chapter, we consider several graph-theoretic and probabilistic models THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography Tight Bounds for axial Identifiability of Failure Nodes in Boolean Network Toography Nicola Galesi Sapienza Università di Roa nicola.galesi@uniroa1.it Fariba Ranjbar Sapienza Università di Roa fariba.ranjbar@uniroa1.it

More information

Sampling How Big a Sample?

Sampling How Big a Sample? C. G. G. Aitken, 1 Ph.D. Sapling How Big a Saple? REFERENCE: Aitken CGG. Sapling how big a saple? J Forensic Sci 1999;44(4):750 760. ABSTRACT: It is thought that, in a consignent of discrete units, a certain

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

Now multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get:

Now multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get: Equal Area Criterion.0 Developent of equal area criterion As in previous notes, all powers are in per-unit. I want to show you the equal area criterion a little differently than the book does it. Let s

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

Linguistic majorities with difference in support

Linguistic majorities with difference in support Linguistic ajorities with difference in support Patrizia Pérez-Asurendi a, Francisco Chiclana b,c, a PRESAD Research Group, SEED Research Group, IMUVA, Universidad de Valladolid, Valladolid, Spain b Centre

More information

Chapter 6: Economic Inequality

Chapter 6: Economic Inequality Chapter 6: Econoic Inequality We are interested in inequality ainly for two reasons: First, there are philosophical and ethical grounds for aversion to inequality per se. Second, even if we are not interested

More information

1 Generalization bounds based on Rademacher complexity

1 Generalization bounds based on Rademacher complexity COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges

More information

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany. New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a ournal published by Elsevier. The attached copy is furnished to the author for internal non-coercial research and education use, including for instruction at the authors institution

More information

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co

More information

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory Revealed Preference and Stochastic Deand Correspondence: A Unified Theory Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk

More information

New Slack-Monotonic Schedulability Analysis of Real-Time Tasks on Multiprocessors

New Slack-Monotonic Schedulability Analysis of Real-Time Tasks on Multiprocessors New Slack-Monotonic Schedulability Analysis of Real-Tie Tasks on Multiprocessors Risat Mahud Pathan and Jan Jonsson Chalers University of Technology SE-41 96, Göteborg, Sweden {risat, janjo}@chalers.se

More information

On Process Complexity

On Process Complexity On Process Coplexity Ada R. Day School of Matheatics, Statistics and Coputer Science, Victoria University of Wellington, PO Box 600, Wellington 6140, New Zealand, Eail: ada.day@cs.vuw.ac.nz Abstract Process

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Fairness via priority scheduling

Fairness via priority scheduling Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation

More information

Cosine similarity and the Borda rule

Cosine similarity and the Borda rule Cosine siilarity and the Borda rule Yoko Kawada Abstract Cosine siilarity is a coonly used siilarity easure in coputer science. We propose a voting rule based on cosine siilarity, naely, the cosine siilarity

More information

The proofs of Theorem 1-3 are along the lines of Wied and Galeano (2013).

The proofs of Theorem 1-3 are along the lines of Wied and Galeano (2013). A Appendix: Proofs The proofs of Theore 1-3 are along the lines of Wied and Galeano (2013) Proof of Theore 1 Let D[d 1, d 2 ] be the space of càdlàg functions on the interval [d 1, d 2 ] equipped with

More information

The Causal Inference Problem and the Rubin Causal Model

The Causal Inference Problem and the Rubin Causal Model The Causal Inference Problem and the Rubin Causal Model Lecture 2 Rebecca B. Morton NYU Exp Class Lectures R B Morton (NYU) EPS Lecture 2 Exp Class Lectures 1 / 23 Variables in Modeling the E ects of a

More information

Physically Based Modeling CS Notes Spring 1997 Particle Collision and Contact

Physically Based Modeling CS Notes Spring 1997 Particle Collision and Contact Physically Based Modeling CS 15-863 Notes Spring 1997 Particle Collision and Contact 1 Collisions with Springs Suppose we wanted to ipleent a particle siulator with a floor : a solid horizontal plane which

More information

Learnability and Stability in the General Learning Setting

Learnability and Stability in the General Learning Setting Learnability and Stability in the General Learning Setting Shai Shalev-Shwartz TTI-Chicago shai@tti-c.org Ohad Shair The Hebrew University ohadsh@cs.huji.ac.il Nathan Srebro TTI-Chicago nati@uchicago.edu

More information

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,

More information

Mixed Strategy Equilibrium and Deep Covering in Multidimensional Electoral Competition

Mixed Strategy Equilibrium and Deep Covering in Multidimensional Electoral Competition Mixed Strategy Equilibrium and Deep Covering in Multidimensional Electoral Competition John Duggan Matthew O. Jackson y Preliminary: January 13, 2004 This Draft: December 12, 2005 Abstract We prove existence

More information

1 Proof of learning bounds

1 Proof of learning bounds COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a

More information

On Conditions for Linearity of Optimal Estimation

On Conditions for Linearity of Optimal Estimation On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at

More information

Equilibria on the Day-Ahead Electricity Market

Equilibria on the Day-Ahead Electricity Market Equilibria on the Day-Ahead Electricity Market Margarida Carvalho INESC Porto, Portugal Faculdade de Ciências, Universidade do Porto, Portugal argarida.carvalho@dcc.fc.up.pt João Pedro Pedroso INESC Porto,

More information

Physics 215 Winter The Density Matrix

Physics 215 Winter The Density Matrix Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it

More information

arxiv: v2 [math.co] 3 Dec 2008

arxiv: v2 [math.co] 3 Dec 2008 arxiv:0805.2814v2 [ath.co] 3 Dec 2008 Connectivity of the Unifor Rando Intersection Graph Sion R. Blacburn and Stefanie Gere Departent of Matheatics Royal Holloway, University of London Egha, Surrey TW20

More information

Distributed Subgradient Methods for Multi-agent Optimization

Distributed Subgradient Methods for Multi-agent Optimization 1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions

More information

Analyzing Simulation Results

Analyzing Simulation Results Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient

More information

Probability Distributions

Probability Distributions Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples

More information

Computational and Statistical Learning Theory

Computational and Statistical Learning Theory Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher

More information

Optical Properties of Plasmas of High-Z Elements

Optical Properties of Plasmas of High-Z Elements Forschungszentru Karlsruhe Techni und Uwelt Wissenschaftlishe Berichte FZK Optical Properties of Plasas of High-Z Eleents V.Tolach 1, G.Miloshevsy 1, H.Würz Project Kernfusion 1 Heat and Mass Transfer

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

A Markov Framework for the Simple Genetic Algorithm

A Markov Framework for the Simple Genetic Algorithm A arkov Fraework for the Siple Genetic Algorith Thoas E. Davis*, Jose C. Principe Electrical Engineering Departent University of Florida, Gainesville, FL 326 *WL/NGS Eglin AFB, FL32542 Abstract This paper

More information

Exit Polls and Voter Turnout

Exit Polls and Voter Turnout Exit Polls and Voter Turnout Asger Lau Andersen and Thomas Jensen Department of Economics, University of Copenhagen September 14, 2010 Abstract We set up a model of elections or referendums with two alternatives

More information

a a a a a a a m a b a b

a a a a a a a m a b a b Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket. Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,

More information

Endowment Structure, Industrialization and Post-industrialization: A Three-Sector Model of Structural Change. Abstract

Endowment Structure, Industrialization and Post-industrialization: A Three-Sector Model of Structural Change. Abstract Endowent Structure, Industrialization Post-industrialization: A Three-Sector Model of Structural Change Justin Lin Zhaoyang Xu China Center for Econoic Research Peing University Deceber 006 (Preliinary

More information

CSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13

CSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13 CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture

More information

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition

More information

Testing for a Break in the Memory Parameter

Testing for a Break in the Memory Parameter Testing for a Break in the Meory Paraeter Fabrizio Iacone Econoics Departent London School of Econoics Houghton Street London WCA AE April 5, 005 Abstract It is often of interest in the applied analysis

More information

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer

More information

Interactive Markov Models of Evolutionary Algorithms

Interactive Markov Models of Evolutionary Algorithms Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary

More information

STOPPING SIMULATED PATHS EARLY

STOPPING SIMULATED PATHS EARLY Proceedings of the 2 Winter Siulation Conference B.A.Peters,J.S.Sith,D.J.Medeiros,andM.W.Rohrer,eds. STOPPING SIMULATED PATHS EARLY Paul Glasseran Graduate School of Business Colubia University New Yor,

More information

3.3 Variational Characterization of Singular Values

3.3 Variational Characterization of Singular Values 3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and

More information

Order Recursion Introduction Order versus Time Updates Matrix Inversion by Partitioning Lemma Levinson Algorithm Interpretations Examples

Order Recursion Introduction Order versus Time Updates Matrix Inversion by Partitioning Lemma Levinson Algorithm Interpretations Examples Order Recursion Introduction Order versus Tie Updates Matrix Inversion by Partitioning Lea Levinson Algorith Interpretations Exaples Introduction Rc d There are any ways to solve the noral equations Solutions

More information

Overcoming Ideological Bias in Elections

Overcoming Ideological Bias in Elections Overcoming Ideological ias in Elections Vijay Krishna Penn State University John Morgan UC erkeley July 5, 200 bstract We study a model in which voters choose between two candidates on the basis of both

More information

Understanding Machine Learning Solution Manual

Understanding Machine Learning Solution Manual Understanding Machine Learning Solution Manual Written by Alon Gonen Edited by Dana Rubinstein Noveber 17, 2014 2 Gentle Start 1. Given S = ((x i, y i )), define the ultivariate polynoial p S (x) = i []:y

More information

Lecture 21. Interior Point Methods Setup and Algorithm

Lecture 21. Interior Point Methods Setup and Algorithm Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and

More information

Monetary Policy Effectiveness in a Dynamic AS/AD Model with Sticky Wages

Monetary Policy Effectiveness in a Dynamic AS/AD Model with Sticky Wages Monetary Policy Effectiveness in a Dynaic AS/AD Model with Sticky Wages H J Departent of Econoics University of Copenhagen Version 1.0, April 12, 2012 Teaching note for M.Sc. course on "Monetary Econoics:

More information

The Optimal Allocation of Prizes in Contests

The Optimal Allocation of Prizes in Contests The Optial Allocation of Prizes in Contests Benny Moldovanu and Aner Sela July 4, 999 Abstract Westudyacontestwithultiple(notnecessarilyequal)prizes. Contestants have private inforation about an ability

More information

Biostatistics Department Technical Report

Biostatistics Department Technical Report Biostatistics Departent Technical Report BST006-00 Estiation of Prevalence by Pool Screening With Equal Sized Pools and a egative Binoial Sapling Model Charles R. Katholi, Ph.D. Eeritus Professor Departent

More information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub

More information

Revealed Preference with Stochastic Demand Correspondence

Revealed Preference with Stochastic Demand Correspondence Revealed Preference with Stochastic Deand Correspondence Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk Prasanta K. Pattanaik

More information

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint. 59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far

More information

Handout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.

Handout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1. Notes on Coplexity Theory Last updated: October, 2005 Jonathan Katz Handout 7 1 More on Randoized Coplexity Classes Reinder: so far we have seen RP,coRP, and BPP. We introduce two ore tie-bounded randoized

More information

Positive Political Theory II David Austen-Smith & Je rey S. Banks

Positive Political Theory II David Austen-Smith & Je rey S. Banks Positive Political Theory II David Austen-Smith & Je rey S. Banks Egregious Errata Positive Political Theory II (University of Michigan Press, 2005) regrettably contains a variety of obscurities and errors,

More information

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

Analysis of Polynomial & Rational Functions ( summary )

Analysis of Polynomial & Rational Functions ( summary ) Analysis of Polynoial & Rational Functions ( suary ) The standard for of a polynoial function is ( ) where each of the nubers are called the coefficients. The polynoial of is said to have degree n, where

More information

Lecture October 23. Scribes: Ruixin Qiang and Alana Shine

Lecture October 23. Scribes: Ruixin Qiang and Alana Shine CSCI699: Topics in Learning and Gae Theory Lecture October 23 Lecturer: Ilias Scribes: Ruixin Qiang and Alana Shine Today s topic is auction with saples. 1 Introduction to auctions Definition 1. In a single

More information

On the level of public good provision in games of redistributive politics

On the level of public good provision in games of redistributive politics On the level of public good provision in games of redistributive politics Benoit S Y Crutzen and Nicolas Sahuguet y September 20 Abstract This paper studies an electoral competition game between two candidates,

More information

Limit pricing models and PBE 1

Limit pricing models and PBE 1 EconS 503 - Advanced Microeconomics II Limit pricing models and PBE 1 1 Model Consider an entry game with an incumbent monopolist (Firm 1) and an entrant (Firm ) who analyzes whether or not to join the

More information