Colonel Blotto with Imperfect Targeting

Size: px
Start display at page:

Download "Colonel Blotto with Imperfect Targeting"

Transcription

1 Departent of Econoics Working Paper Colonel Blotto with Iperfect Targeting Deborah Fletcher Miai University Steven Slutsky University of Florida Deceber 2009 Working Paper #

2 Colonel Blotto with Iperfect Targeting* Deborah Fletcher a, **, Steven Slutsky b a Departent of Econoics, Miai University, 208 Laws Hall, Oxford, OH b Departent of Econoics, University of Florida, Matherly Hall, Gainesville, FL Deceber 2009 Abstract: Colonel Blotto gaes have been widely applied in a variety of contests where the players allocate resources across a nuber of battlefields and the winner in each battlefield is the one with ore resources there. One drawback of this standard odel is the assuption that players can perfectly target their efforts toward different battlefields. In any situations, players can only iperfectly target different battlefields, with an allocation affecting ore than one battlefield. We develop an extension of Colonel Blotto that incorporates this type of interrelation. The equilibria here generally utilize ixed strategies that tend to be asyetric across battlefields. That is, at least one player will have zero probability of dividing resources equally across battlefields, even if the characteristics of the battlefields are siilar. We use advertising data fro the 2002 races for governor and US senate to test the application of the Blotto odel to political contests. Although the Colonel Blotto odel has been used extensively to odel political capaigns, we find that candidates advertising allocations across arkets are far too syetric to fit the odel. JEL code: C72 Keywords: Colonel Blotto; ixed strategies **Corresponding author. Eail addresses: fletchd@uohio.edu, steven.slutsky@cba.ufl.edu

3 (I) Introduction A variety of contests exist in which the opponents copete by expending resources. In any gaes of this type, the players benefit by allocating resources differently fro their opponents; the gae is thus one of strategic allocative isatch. 1 Proinent exaples of this are ilitary contests and political capaigns. One approach to odeling such situations is the classic Colonel Blotto gae. 2 In this odel, the winner is deterined by which player puts in ore resources, that is gets there first with the ost. 3 This akes the payoffs very discontinuous in the actions of the players. In the siplest version of Colonel Blotto, the players have equal resources that they ust allocate to different battlefields of equal size. On any battlefield, the winner is the player with the ost resources there. The goal of the players is to axiize the expected nuber of battlefields that they win. Extensions of this odel allow for the players to have unequal resources, for battlefields to be of different sizes, and for one of the players to have an advantage on soe battlefields so as to be able to win the with fewer resources (perhaps, having gotten there first, within liits, the player does not need the ost). 4, 5 1 See Golan and Page (2009). 2 Borel (1921) first proposed this gae, with further analysis in Borel and Ville (1938). Modern analysis began with Tukey (1949), with follow-ups by Blackett (1954, 1958) and Bellan (1969). Only recently has a general solution to the continuous gae been provided (Roberson (2006)); see also Weinstein (2005). 3 In response to a question about who would win a battle, Gen. Nathan Bedford Forest of the Confederate Ary replied, The one who gets there first with the ost en. This quotation is often used in discussions of strategy in a variety of contexts. 4 Kovenock and Roberson (2008) consider a odel of two-party copetition where parties attract voters by offering redistributive policies when voters have heterogeneous loyalties to the different parties. There is a foral overlap between getting votes through redistributive policies and attracting the through capaign expenditures, as analyzed here. 5 Colonel Blotto odels of advertising go back to Friedan (1958). Colonel Blotto odels of elections go back at least to Sankoff and Mellos (1972). Recently, Szentes and Rosenthal (2003) study a type of all-pay 2

4 Although the Colonel Blotto gae can be straightforward to specify, equilibriu behavior can be coplicated. Pure strategy equilibria exist only in special cases, such as when only two battlefields exist or when one battlefield is uch larger than all the others cobined. In the latter case, the pure strategy equilibriu has both players spending all resources in the larger battlefield. Pure strategy equilibria also exist if one player has such an overwheling resource advantage that it can allocate enough resources to the battlefields to win the all, regardless of the other player s allocation. Typically, when there are ore than two battlefields, only ixed strategy equilibria exist, and can be quite coplex. Consider a player axiizing over n battlefields. The arginal distributions of the ixed strategy give the probability of allocating different aounts to any battlefield, while the joint distributions give the probability of allocating different n-tuples across the battlefields. Necessary and sufficient conditions on the arginal distributions for a ixed strategy equilibriu have been specified (see Roberson (2006)). Consistent with any set of arginal distributions, ultiple joint distributions can exist. Characterizing the equilibriu joint distributions has been ore difficult. Exaples of these go back to Borel and Ville (1938) with other possibilities shown only recently by Roberson (2006) and Weinstein (2005). The equilibriu joint distributions can vary widely in their nature. Soe are asyetric and have supports that are of lower diension than the n-1 diensional space of allocations. There are also equilibria with full support such as the Hex equilibriu given by Borel and Ville; see Weinstein for a discussion of this equilibriu. In an equilibriu with full support, any neighborhood in auction of which a Colonel Blotto odel of Electoral College copetition is an exaple. Laslier and Picard (2002) consider a odel of distributive politics that reduces to a Colonel Blotto gae. 3

5 the space of allocations, including any containing the point at which resources are allocated equally to all battlefields, has positive easure. One assuption in all these variants is that players can perfectly target their resources. That is, resources can be allocated to a single battlefield with no spillover effects to other battlefields. In any contexts, however, spillovers do exist. For exaple, consider advertising capaigns by firs or political candidates. A battlefield ight be considered to be soe group defined by gender, ethnicity, age, socioeconoic status, geographic location, or preferences. In a perfect world for the players, they would be able to target expenditures in the for of ads with different essages very narrowly aied at each deographic group, with only that group seeing the ad designed for it. While firs or candidates do try to carry out such targeting through such actions as the placeent of different ads on specific radio or television progras, perfect targeting rarely is possible. Ads that are aied at one group will often be observed by ebers of other groups. 6 Fletcher and Slutsky (2009) develop a structure that allows considering such iperfect targeting in the probabilistic voting context. Their structure has two edia arkets where ads can be purchased. In each arket, the ads are viewed by three groups of voters: those initially supporting each candidate and those indifferent between the. The partisan types are assued to have an intensity of preference toward their preferred candidates. Ads ove this intensity in favor of the candidate running the ad. Under 6 Golan and Page (2009) also offer extensions of the Colonel Blotto gae that involve externalities across battlefields. However, their externalities are in the payoffs, with players valuing cobinations of battlefields beyond siply suing the values of each battlefield. They do not consider having the outcoes on ultiple battlefields depend on the sae expenditures as we do here. 4

6 probabilistic voting, the support each candidate receives fro a type varies continuously with its post-capaign intensity. In this paper, we adapt this structure to replace the probabilistic voting assuption so that, as in standard Blotto, all ebers of each group in a arket vote for the candidate the group prefers after all ads have been shown, no atter how sall the group s preference for that candidate. In addition, we generalize its applicability to situations beyond the political context. 7 We consider a situation in which ultiple battlefields are grouped together because they cannot be targeted separately, and the players allocate resources to each grouping. For convenience, we will call a grouping a battlefield and each coponent of the grouping a sub-battlefield. We will analyze allocations across two battlefields, each of which has three sub-battlefields. 8 The two battlefields overall ay be of unequal iportance and the different sub-battlefields can also vary in iportance. One of the players ay have an advantage on soe subbattlefield so can win there, even though she allocates fewer resources to that subbattlefield than the other player. The effectiveness of allocations can differ across battlefields or even across sub-battlefields. The effectiveness function is, however, the sae for both players. 9 Unlike the typical Colonel Blotto gae or the odel in Fletcher and Slutsky (2009), we also assue that allocations can have diinishing rather than constant arginal effectiveness. 7 Iperfect targeting has been analyzed in soe contexts, such as developent econoics (see Bibi and Duclos (2007)). However, it has not been explored in the contest literature. 8 While it would be interesting to analyze the case where there is a continuu of sub-battlefields, such an approach would no longer be in the spirit of a Blotto odel. In a continuu odel, the aount a player wins would vary continuously with the resources each side expends, while in a Blotto odel, there are significant discontinuities in the aounts won as functions of the resources expended. 9 This generalization has an iportant iplication in the political context. Since the effectiveness function ay differ across arkets, it incorporates the possibility of ad price differences across arkets. Thus, the decision variable could be either the nuber of ads played in the arket or the total advertising expenditure. 5

7 Our results under iperfect targeting are not only consistent with the basic nature of standard Blotto, but strengthen those results. First, pure strategy equilibria are even less likely to exist with iperfect targeting. Unlike the standard results, pure strategy equilibria ay not exist even when there are only two battlefields and one is larger than the other. As follows fro Theore 1 and Lea 2 below, the neutral sub-battlefield in one battlefield ust be larger than the entire other battlefield for a pure strategy equilibriu to exist. Of course, then the equilibriu has all resources expended in the larger arket. Second, consider situations where pure strategy equilibria do not exist and the players have the sae aount of resources to allocate between battlefields. If this aount lies in soe range deterined by the aount of the advantages the players have in the non-neutral sub-battlefields, a necessary condition on equilibriu ixed strategies is that at least one player acts asyetrically. That is, as shown in Theore 2 below, there cannot be equilibria where the joint distributions for both players have full support with at least one player putting no probability weight on allocations in a neighborhood around equal allocation across the two battlefields. 10 This contrasts with the standard Blotto result, which has ixed strategy equilibria with realizations where candidates allocate equally across arkets. Thus, for this odified Blotto odel, whether a pure or ixed strategy exists, players will use very asyetric strategies across battlefields. Given this, it would be possible in principle to test whether a Blotto approach is consistent with behavior in any of the specific contexts to which the analysis ight apply. If Blotto were appropriate, we would expect to see asyetric allocations across the 10 Note that although iperfect targeting introduces an eleent of having ore than two battlefields, an iportant eleent of just two battlefields reains. Taking into account budget balance, each player has only a one-diensional allocation decision. 6

8 battlefields, even when they appear to be siilar. Thus, an ary would allocate troops asyetrically between two battlefronts even if the sub-battlefields in the were siilar in iportance and in the extent of the advantage to one ary over the other. Product or political advertiseents would tend to be placed ore heavily in one arket over another, even when the deand conditions in the arkets appear to be very siilar. Finally, we would expect to see significant variation in educational quality across school districts, even when the districts are alike in ost easurable ways. Whether the equilibriu is in pure or ixed strategies, players will use very asyetric strategies across battlefields. However, since the conditions for existence of pure strategy equilibria are so extree, the equilibriu will generally be in ixed strategies that are typically not directly observable. A sall literature exists that addresses the use of ixed strategies by players in gaes. This literature considers two questions: Do players eploy ixed strategies? If so, are they choosing the optial ixed strategies? The first question has been considered in several ways. Merolla, Munger, and Tofias (2005) note that when ixed strategies are used, a player would gain by altering the chosen action once the opponent s strategy is known. They argue that in the 2000 US presidential election, Gore used ixed strategies, since he would have gained fro reallocating resources had he known what allocations Bush was aking across states. To ake this arguent, they ust deterine the effect that reallocating expenditures would have on the outcoe in different states. They base this analysis on coparing outcoes to pre-election polls. Chiappori, Levitt, and Groseclose (2002) argue that in a gae in which players use ixed strategies and ake a nuber of oves, each ove is a rando 7

9 realization of the strategy. Thus, their choices should exhibit independence over tie. They show that goalies and kickers in soccer atches behave consistently with using ixed strategies during penalty kicks since their choices show no serial correlation. The second question, optiality of the ixed strategies, is considered by Chiappori, Levitt, and Groseclose (2002) in the soccer context and Walker and Wooders (2001) with respect to tennis serves. Both sets of authors copute what the optial ixtures would be, and both conclude that players choose strategy ixes close to the optial ones. Walker and Wooders find that ore experienced players choose ixed strategies closer to the optial ones but all players ix ore than would be optial. The approaches used above cannot be applied in any settings including political capaigns. Often there is only one realization of a candidate s strategy, not a series of observations as with tennis serves or soccer kicks. Strategy choices cannot be easily related to outcoes. For exaple, polling data is not as extensive for lower-level political races as it is for presidential elections. The necessary condition we derive gives a novel way of testing whether the Blotto fraework is appropriate in various contexts even if the candidates use ixed strategies by directly exaining the actions of players to see if they ever choose syetric actions across battlefields. With this approach, it is not necessary to ake epirical inferences about the effects of strategy choices on outcoes. For any of the applications, getting the appropriate data on players strategic choices would be difficult. For the case of political capaigns, however, detailed data exists on political advertising, one iportant strategic variable available to candidates. Recent data on political capaigns in the United States fro the Capaign Media Analysis Group (CMAG) contains extensive inforation on political advertiseents at 8

10 the individual ad level including content, length, tie, station of airing, and estiated cost. The data, sold to candidates and news organizations desiring real-tie inforation about capaign activity, are released for acadeic use after a lag of several years. The only data currently available for a non-presidential year are fro Despite soe shortcoings, that candidates purchase these data indicates that they contain useful inforation about strategic choices. 11 In general, the candidates see to use strategies which are not consistent with what the Blotto odel would predict, with advertising allocations uch ore equally divided across arkets. 12 This supports the conclusion that equal allocations ight be explained by a ore continuous gae of allocative isatch, such as a probabilistic voting odel as in Fletcher and Slutsky (2009) or a odel using a contest success function. 13 Of course, this evidence does not argue that the Blotto odel is not appropriate in any of the other settings to which the odel ight apply. The foral odel is described in Section II. Pure strategy equilibria are considered in Section III. Soe properties of ixed strategy equilibria are derived in Section IV. The epirical analysis related to political capaigns is given in Section V and conclusions are discussed in Section VI. All proofs are contained in an Appendix. 11 The data are only for broadcast and cable television in the 100 largest edia arkets, and do not include advertising on other edia such as print or radio. Soe aspects of the data are questionable, particularly the price coponent. See Goldstein and Freedan (2002) for a detailed discussion of the CMAG data and its liitations. 12 This situation differs fro the outcoe that is observed in Presidential elections, where candidates allocate asyetrically across states. In the forer, the agnitude of the win in a battlefield (arket) atters because it is the su of votes over all the arkets in a state that atters. In the latter, the agnitude of a player s win in a battlefield (state) is uniportant, since a player wins all the Electoral College votes of the state if he wins that state by the narrowest of argins. 13 Skaperdas (1996) axioatizes several contest success functions that have been widely used in the literature. 9

11 (II) The Model Consider a contest between two players A and B, each of who divides resources between two battlefields denoted and n. Each battlefield has three sub-battlefields denoted 1, 2 and 3. Sub-battlefield (i, j) denotes sub-battlefield i of battlefield j. Each sub-battlefield possesses two characteristics: iportance and advantage. Iportance ay be the size of the sub-battlefield, but could ore generally relate to its significance to the players. The iportance of sub-battlefields are denoted by i and n i, i = 1, 2, 3. The overall iportance of a battlefield is assued to be the su of the iportance of the sub-battlefields, with M = i and N = n i. The two players have the sae evaluation of the iportance of sub-battlefields. Advantage relates to the extent to which the characteristics of a sub-battlefield favor one of the players over the other. For convenience, advantages to A are treated as positive while advantages to B are treated as negative. Sub-battlefield 1 in each battlefield favors B with the size of the advantage denoted as - and - n, while sub-battlefields 3 favor A with the size of the advantage denoted as and n. Sub-battlefields 2 are neutral, with neither player having an advantage before the battle begins. The total resources available to the two players are R A and R B, which we assue are exogenously deterined. The players can allocate their resources across the two battlefields with x and x n denoting the allocations of player A and y and y n denoting the allocations of player B. Thus, the two players face resource constraints x + x n = R A and y + y n = R B (1) An allocation to a battlefield goes to all the sub-battlefields in that battlefield in the sae aount. Resources allocated to a battlefield by a player will shift the advantage toward 10

12 that player. The effectiveness of resources in shifting the advantage are given by the functions h ij in sub-battlefield i of battlefield j, where h 0,h 0,h (0) 0 (2) ij ij ij For exaple, in sub-battlefield (1, ), the post-battle advantage to player B is + h 1 (x ) h 1 (y ), while in sub-battlefield (3, n), the post-battle advantage to player A is n + h 3n (x n ) h 3n (y n ). Figure 1 shows the post-battle situation in the two battlefields. This specification generalizes the standard Colonel Blotto assuption that effectiveness is linear in expenditures. Here, we allow for the possibility of diinishing arginal effectiveness. In addition, specifying different functions for each sub-battlefield allows the effectiveness of allocations to differ across sub-battlefields. This could be due to differences between the sub-battlefields in aspects such as size and terrain. We continue to assue that the effectiveness functions are the sae for both players and are independent of the level of the other player s allocation. Any sub-battlefield is won by the player with the post-battle advantage. Let I denote the post-battle advantage to player A. Then the outcoe in any sub-battlefield is specified as: { 1 if > 0 V() = 1\2 if = 0 0 if < 0 (3) The overall payoff to Player A is Vˆ (x, x n, y, y n ) = 1 V[- + h 1 (x ) h 1 (y )] + 2 V[h 2 (x ) h 2 (y )] + 3 V[ + h 3 (x ) h 3 (y )] + n 1 V[- n + h 1n (x n ) h 1n (y n )] + n 2 V[h 2n (x n ) h 2n (y n )] + 11

13 n 3 V[ n + h 3n (x n ) h 3n (y n )] (4) The players siultaneously ake their allocation decisions, with Player A choosing x and x n to axiize Vˆ and player B choosing y and y n to iniize Vˆ, subject to the resource constraints (1). Consider the following settings that fit within the context of this odel. Military capaigns First, to extend the classic Colonel Blotto warfare odel to incorporate iperfect targeting, consider a ilitary capaign between ary A and ary B. Two battlefields, and n, are contested. Ary A allocates x soldiers to battlefield and x n soldiers to battlefield n, while ary B allocates y and y n soldiers across the battlefields. In each battlefield, the aries face off across a linear battlefront, with the terrain giving advantage to one ary or the other at different points along the battlefront. Subbattlefields 1 and 3 denote points along the front that are advantageous to ary B and ary A, respectively, while sub-battlefields 2 are neutral, favoring neither ary. For exaple, one location in battlefield ight have boulders on ary B s side of the front, giving that ary s soldiers convenient cover. The agnitude by which ary B gains fro this cover is represented by. The iportance paraeter 1 could be based on the size of this location or on its intrinsic value to the aries. Such points of advantage need not be geographically contiguous, so that it would be difficult for an ary to send soldiers only to neutral points or to those points where that ary has an advantage. Thus, each ary is unable to perfectly target its troops to areas with a given advantage. The 12

14 effectiveness of troops, represented by the h ij functions, could differ across subbattlefields because of differences in such factors as ease in counications or resupply. Advertising capaigns A second application of the odel is in advertising capaigns, either between two firs copeting for sales, or two political candidates copeting for votes. In the product advertising case, the firs do not copete by changing the characteristics of the products, but through advertising. Consuers differ in which product they prefer, with soe being indifferent. For exaple, a few years ago the University of Florida switched fro selling only Coke products to selling only Pepsi products on capus. Soe at the University were ecstatic about the change, others were outraged, and soe, like the authors, were copletely indifferent. The Coca-Cola Copany and PepsiCo do not attept to win consuers over by changing the forulas of Coke and Pepsi, but instead have advertising wars. As in Golan and Page (2009), the product advertising case is winner-takes-all if a store has shelf space for only one fir s product. 14 Another possibility is advertising to institutional users that will sign exclusive contracts to use one fir s good. Exaples of this would be hospitals buying all their cleaning supplies fro a single supplier, or schools buying all their ilk fro a single producer because of the influence of advertising. In the political advertising exaple, the two candidates have platfors that are fixed prior to the beginning of the capaigns. The capaign of each candidate is designed to alter voter preferences in favor of that candidate. Since no voter is likely to 14 If soe custoers use arket ranking as a signal of quality, then a discontinuous payoff would result siilar to the winner-takes-all setting. A relatively sall increase in advertising ight increase the fir s arket ranking, then induce a large increase in sales through the quality perception effect. 13

15 prefer one candidate s position over that of the other on every issue, ads ight be designed to change voter preferences in other ways. For exaple, candidates ight attept to change the saliency of different issues in the inds of the voters, or focus on non-issue factors such as character or copetence. 15 The battlefields in either advertising case would be edia arkets and n. In the political case, these are different edia arkets in the sae electoral district, such as two cities in the sae state for a Senate race. Subarkets 1 represent consuers with a preference for product B or partisans for candidate B, while subarkets 3 are the individuals preferring product or candidate A. Subarkets 2 are the neutral consuers or voters. Firs or candidates allocate advertising dollars x and y across arkets, but cannot perfectly target who will see a given ad within a arket. Since all sales and votes are equally iportant, 16 the iportance paraeters i and n i siply represent nubers of consuers or voters. j and j are the preference intensities of the partisans for B and A, respectively. The h ij are the advertising effectiveness functions in the various subarkets. Ads ight have different effectiveness in different edia arkets because of different television viewing habits or differences in ad prices between large and sall arkets. Additionally, individuals with initially strong preferences toward a product or candidate ight respond differently to ads than do initially neutral individuals. 15 In the political context, axiizing the probability of winning rather than expected plurality is considered preferable, but is often not used as it is significantly ore coplicated to analyze. A nuber of papers including Aranson, Hinich and Ordeshook (1974), Ledyard (1984), Snyder (1989), Duggan (2000) and Patty (2005) have considered the relation between outcoes under the two objectives in a spatial voting context. In soe, perhaps special, circustances, they are equivalent. It should be noted that expected plurality axiization is not only ore convenient but in soe circustances can be justified as ore realistic. Candidates with a low probability of winning ay desire to lose by as sall a argin as possible. 16 In the political setting, this would be true in a statewide or district-wide race. Obviously, all votes are not created equal in an Electoral College setting. 14

16 Quality copetition aong providers of education In the final exaple, two private school providers copete for students by varying the quality of education in two districts, and n. Provider A is a religious organization and provider B is a secular fir. Quality differences are achieved by A via allocations x and x n, and by B via y and y n. The providers wish to axiize the total nuber of pupils they serve because of econoies of scale arising fro such factors as reduced textbook prices for large orders or fixed adinistrative costs. Different types of parents have underlying preferences about sending their children to secular or religious schools, while soe parents are indifferent. These underlying preferences i and j could be overcoe with large enough quality differentials. Quality differentials are difficult to target toward pupils of one type and not another. 1, 3 and 2 are the parent types preferring secular or religious education and the neutrals, respectively. h ij, the effectiveness of dollars spent on quality, ight differ across counities because dollars buy different aounts of quality due to differences in land costs and prevailing wage rates, or due to differently sized physical plants. All of these factors would likely be correlated with counity size. The effectiveness functions ight also differ across parental types, as these ay have different sensitivities to changes in quality. The iportance paraeters would generally relate to the nubers of the different types in each counity but ight also incorporate desires by the schools to have students with certain skills (acadeic or athletic). Within the general structure specified above, we ake soe notational conventions and soe technical assuptions to assure that the analysis is interesting. 15

17 Without loss of generality, we can renae the players so that A has at least as uch resources as B (i.e. R A R B ). In addition, we can renae the battlefields so that n is at least as iportant as (N M). If the player advantages in sub-battlefields 1 and 3 were so large as to be insurountable by any allocation of resources by the opponent not favored in the, then the gae would reduce to a single battlefield, and the extension would not be interesting. Thus, we assue that all sub-battlefields are in play. That is, each player has sufficient resources to potentially win those sub-battlefields in which the other player has an advantage: 17 j < h 1j (R A ) and j < h 3j (R B ), j =, n (5) If the resource differences were very large, one player could overwhel the other on all sub-battlefields. To rule this out we assue that the resource difference between the players is not very large relative to the sub-battlefield advantages: j > h 1j (R A - R B ) and j > h 3j (R A - R B ), j =, n (6) In essence, allocating just the difference in resources available to the players to a battlefield is not enough to sway the outcoe of any non-neutral sub-battlefield. Note that (5) and (6) with respect to j iply that R A < 2R B. Next, if there is an exact balancing of the iportance of certain sub-battlefields, then knife-edge equilibria ay result. For exaple, if 2 = n 2, ultiple equilibria ay exist, because the gains and losses fro sall changes in allocations across the battlefields that only change the outcoes on the neutral sub-battlefields cancel out. 17 Note that other sub-battlefields could exist with very high advantages, for exaple, with kj > h kj (R B ) but those sub-battlefields will always be won by the favored player. This, they need not be considered by players when setting strategies. 16

18 Such equilibria are non-generic, arising only on easure zero sets in the paraeter space. The following condition rules out this type of equilibriu: 3 i1 ( t n s ) 0 when t i and s i each take any values fro the set (7) i i i i (0, 1, -1, ½, -½) but are not all zero. The expression in (7) is a general forula for the change in Vˆ due to changes in a player s strategy. Either a strategy change has no effect in a sub-battlefield, or it causes victory in the sub-battlefield to switch fro one player to the other, or it creates or breaks a tie in the sub-battlefield. One iplication of this assuption is that M N, so that the two battlefields cannot be exactly equal in iportance. Therefore, given the naing convention above, M < N ust hold. Another iplication is that n 2 2, so the iportance of the initially neutral sub-battlefields cannot be exactly equal. (III) Pure Strategy Equilibria In a Colonel Blotto gae with perfect targeting, a pure strategy equilibriu generally exists when there are only two battlefields, with both contestants expending all their resources in the larger battlefield. With iperfect targeting, even though the players have only two alternatives on which to spend resources, there are really ore than two battlefields and pure strategy equilibria typically do not exist. To analyze this, we begin with Lea 1, which rules out interior pure strategy equilibria. Lea 1: Given paraeter restrictions (5) (7), there do not exist any pure strategy equilibria with 0 < x < R A and 0 < y < R B. 17

19 To specify the conditions for pure strategy equilibria, consider the case when R A = R B R, and define the cutoff values y and y by h 3 (y) = and h 1n (R y) = h 1n (R) n. When x = 0, A wins sub-battlefield (3, ) if y < y and B wins if y > y, while A wins sub-battlefield (1, n) if y > y and B wins if y < y. Siilarly, let x and x be defined by h 1 ( x ) = and h 3n (R x) = h 3n (R) n. When y = 0, A wins sub-battlefield (1, ) if x > x and B wins if x < x, while A wins sub-battlefield (3, n) if x < x and B wins if x > x. Given assuption (5), y, y, x, and x all lie between 0 and R. Theore 1: Under assuptions (1) (7) and the convention that the battlefields are naed so that M < N, the only possible pure strategy equilibriu is x = y = 0. This equilibriu exists if and only if R A = R B, 2 < n 2, and both of the following conditions hold: (A) Either y < y and ½n 2 > ½ or y y and n 1 + ½n 2 > ½ (B) Either x < x and ½n 2 > 1 + ½ 2 or x x and ½n 2 + n 3 > 1 + ½ 2 Fro Theore 1, when each player has sufficient resources which differ fro those of the other player but not by too large an aount, then no pure strategy equilibriu exists. It never exists when R A R B. When R A = R B, it exists only under further restrictions on the paraeters of the odel. To gain soe intuition behind this result, recognize that given the budget constraint, each player has a one-diensional strategy space: how uch is allocated to battlefield. Fixing the opponent s allocation, 18

20 a player s payoff is nononotonic over this strategy space. As a player allocates ore resources toward, sub-battlefields in will switch allegiance to that player, while those in n switch away at different allocation levels. Because of this non-onotonicity, at least one player will have an iproving deviation over any pair of pure strategy allocations, one for each player. The following result helps in understanding the conditions deterining the relations between y and y and x and x, at least in one special case. Assue that effectiveness is the sae in the sub-battlefields of each battlefield, with h i (z) = h (z) and h in (z) = h n (z), all i and z. Further, assue that battlefield is less iportant than n because it is saller, and hence that allocations are ore effective there with h (z) h n (z), all z. Lea 2: If < n, or if = n and h j < 0, then y < y. If < n, or if = n and h < 0, then x < x. j Therefore, if the ore iportant battlefield n also has larger advantages ( n > and n > ), then fro Lea 2 and conditions (A) and (B) of Theore 1, ½n 2 > ½ and ½n 2 > 1 + ½ 2 ust hold at a pure strategy equilibriu. Together these iply that n 2 > M. Not only is battlefield n ore iportant overall, its neutral sub-battlefield ust be ore iportant than all of battlefield. In this case, both players put all their resources in the ore iportant battlefield and devote no resources to the less iportant one. If the advantage relations do not hold, the conditions on n 2 relative to the iportance of sub-battlefields in are still sufficient but are not necessary for the pure 19

21 strategy equilibriu to exist. It is worth noting that in soe settings, it is plausible to have larger advantages in the ore iportant battlefield. For exaple, consider the advertising exaple, where the ore iportant battlefield is siply the larger arket. The advantages can be interpreted as how uch resources ust be expended to shift an individual s decision. In larger counities, the price of an advertiseent ay be larger, so that ore ust be spent to have an individual see the sae nuber of ads. Pure strategy equilibria ay exist if one player s resources are significantly larger than the other with assuption (6) violated. For exaple, with enough resources, player A could set x = x n = ½R A and, no atter what B did, win all sub-battlefields in battlefield provided + h 1 (½R A ) h 1 (R B ) > 0, and all sub-battlefields in battlefield n if n + h 1n (½R A ) h 1n (R B ) > 0. Although the foral results in Theore 1 apply to a situation with only two battlefields, the intuition that pure strategy equilibria are unlikely to exist carries over to ore than two battlefields. For a pure strategy equilibriu to exist in a setting of K battlefields, the equilibriu strategies restricted to any pair ust be an equilibriu in that pair holding fixed allocations to all the other battlefields. Let R ij A and R ij B be the su of resources allocated to battlefields i and j by the two players. If the players have total resources which do not differ uch, then, on at least one pair of battlefields i and j, the resources R ij A and R ij B will satisfy assuptions (5) and (6) with an equilibriu then unlikely on the pair. (IV) Mixed Strategy Equilibria 20

22 In ost circustances, no pure strategy equilibriu exists and the players use ixed strategies. Finding the equilibriu ixed strategies in general is difficult. In Theore 2 below, we are able to find a necessary condition on the equilibriu ixed strategies under the assuption that players have the sae resources. To specify this, let E(x ) and F(y ) denote the cuulative distribution functions for the ixed strategies of A and B, respectively. As cdfs, E(x ) and F(y ) are nondecreasing and right-hand continuous and can be divided into continuous parts E*(x ) and F*(y ) and countable sets of values at which positive probability is placed. Let e a (x ) and f a (y ) denote the probability placed on the specific values x and y if they are ass points. Fro righthand continuity, E(x ) = li 0 E(x ) + e a (x ) and F(y ) = li 0 F(y ) + f a (y ). Consider the case in which the players have the sae resources R R A = R B. Consider sub-battlefield (3, ), which favors player A. A wins the sub-battlefield if + h 3 (x ) h 3 (y ) > 0. There exists an x such that + h 3 (x ) h 3 (R) > 0 iff x > x. Since x < R ust hold, there exists an ( ) = R - x with 0 < ( ). Directly, ( ) is defined by h 3 (R - ( )) h 3 (R). ( ) defines a lower bound on x such that A wins sub-battlefield (3, ) no atter how uch B spends in battlefield. That is, for any y and all x > R - ( ), + h 3 (x ) h 3 (y ) > 0. Siilarly, ( n ), defined by h 3n (R - ( n )) h 3n (R) n, gives a lower bound on x n such that for all x n > ( n ) and any y n, n + h 3n (x n ) h 3n (y n ) > 0. For sub-battlefields 1 of both battlefields, which lean to B, we can define ( ) by h 1 (( )) and ( n ) by h 1n (( n )) n. In this case, for all x < ( ) and any y, - + h 1 ((x ) h 1 (y ) < 0, so B definitely wins (1, ). Siilarly, for all x n < ( n ) and any y n, - n + h 1n (x n ) h 1n (y n ) < 0, so B definitely wins (1, 21

23 n). Since h 1i (R) > i by assuption (5), ( i ) < R ust hold. Let in[( ), ( n ), ( ), ( n )]. Fro the construction of ( i ) and ( i ), it iediately follows that < R. In addition, we assue R < 2 (8) Clearly, it follows fro (8) that R < ½ R <. If either player chooses an allocation in the interval (R, ), then, no atter what its opponent does, that player cannot win either of the sub-battlefields favorable to the opponent, but also cannot lose either subbattlefield in which that player is favored. Only the neutral sub-battlefields are in play. On the other hand, if an allocation is chosen outside the interval, there are potential gains and losses in the other sub-battlefields. For exaple, if x is below R thiseans that x n is above In this case, if y is large, A could lose sub-battlefield (3, ), while B could lose sub-battlefield (1, n). Given a value of R, this assuption in effect puts lower bounds on the agnitudes of the i and i. These advantages cannot be too large relative to R fro assuption (5). Fro (8), they also cannot be too close to 0. Note that (8) in at least soe circustances strengthens (6). If the h ij are linear, then ( i ) = c ij i and ( i ) = c ij i, for soe positive constants c ij so in(c 1, c 1n n, c 3, c 3n n ). Hence, for R A = R B, (6) only iposes > 0 while (8) iposes the ore restrictive > ½ R. Theore 2: Assue R A = R B and paraeter restrictions (5) (8). Either E() e a () = E(R ) or F() f a () = F(R ), so that at least one player never expends resources in the open interval (R ). 22

24 Although ultiple ixed strategy equilibria ay exist and it is difficult analytically to find the exact equilibria, Theore 2 gives an iportant characterization of any ixed strategy equilibriu, at least in circustances when the resources available to the two players are the sae. In no equilibria do both players have any probability of dividing their resources nearly equally between the two battlefields. This does not iply that even one of the players will, with positive probability, have an approxiately equal division of expenditure between battlefields. In fact, if the gae is syetric, then neither player will ever have an approxiately equal division. Corollary 1: If R A = R B = R, i = i, n 1 = n 3 and 1 = 3, then in any ixed strategy equilibriu E() e a () = E(R ) and F() f a () = F(R ). The significance of these results depends upon the size of the interval (R ). For near its lower bound of ½ R, the interval around ½ R is sall. Only allocations with alost exactly equal spending in the two battlefields are ruled out. For near its upper bound R, this interval is alost the entire set of allocations. Anything except for alost coplete asyetry in expenditures is ruled out. The size of this interval thus depends upon the agnitude of the initial advantages relative to the resources available to players. The ore resources players have relative to these advantages, the ore asyetric ust be the allocations of a player. Throughout the analysis, we have assued that the resources are exogenous and uncorrelated to the advantages i and i. However, there ay be reasons for the to be positively or negatively correlated in soe of the exaples of the odel. Consider the 23

25 case of political capaigns. When the advantages are greater voters are less persuadable, so oney will be less effective and donors ay prefer to donate to other candidates in other races, yielding a negative correlation. On the other hand, in larger battlefields, ore oney is raised but ads ay be ore expensive, which is siilar in effect to having larger advantages, creating a positive correlation. 18 In general, assue that a br where the sign of b deterines whether and R are positively or negatively correlated. Then the interval becoes ((1 b)r a, br + a) with the size of the interval 2a (2b 1)R. The size of this interval declines in R for b < ½ and increases for b > ½. Only if b is near ½ and a is near 0 will the interval be very sall for all values of R. Otherwise, for at least soe R, it should be non-negligible in size. Both Theore 2 and Corollary 1 are knife-edge results, holding for situations with exactly equal resources for the players or exactly syetric gaes. However, the essence of the results are likely to carry over to nearby situations with the resources of the players siilar but not exactly equal, or to alost syetric gaes. If the equilibriu correspondence of the gae is upper hei continuous, since every equilibriu at R A = R B has one player placing no weight near equal division, then for a neighborhood of resource pairs around R A = R B, at least one player would put little probability weight in the interval (R A ) or (R B ). Siilarly, for alost syetric gaes, both players would put little weight in those intervals. (V) Epirical Evidence in Political Capaigns 18 See Stratann (2005) for a survey of the recent capaign contributions and capaign spending literatures, where he discusses both of these effects. Stratann notes that when voter preferences are strong toward one candidate or the other, contributors are less likely to donate since capaign spending would have little effect in those arkets. He also discusses the fact that spending is likely to buy very different aounts of advertising in different arkets. 24

26 If the candidates behaviors are consistent with the Blotto approach, then at least one candidate will use very asyetric strategies across arkets, regardless of whether the equilibriu is in pure or ixed strategies. To test this, we exaine the data to see if candidates run substantially different nubers of advertiseents across edia arkets. Note that strategies are not copared across candidates, but across arkets for each candidate. Our advertising data include inforation only for the 100 largest broadcast arkets in the United States. We initially include in our analysis any part of a arket in a state with a political contest, even if only a tiny fraction of the arket is in the state in question. The iplications of this will be discussed below. We first consider states in which there are only two arkets or in which one arket is uch larger than all the rest of the arkets cobined. These are the situations ost consistent with the foral odel. The results above were derived for allocations between two arkets. When ore arkets exist but one is very large relative to the others, it can be shown that a pure strategy equilibriu will still exist with the candidates only running ads in the large arket. Table 1 lists each of the eleven states consistent with these criteria. Many edia arkets cross state borders, so that the arket ay be divided between two, three, or even ore states. The table includes all edia arkets, or parts of edia arkets, in the state, and lists the population of the arket that is within that state in question. For exaple, the Washington, D.C. edia arket falls not only in the District of Colubia proper, but also in the states of Maryland, Virginia and West Virginia. The population listed in the table for Washington, D.C. includes only those individuals in the D.C. arket who live in the state of Maryland. The fourth colun in the table, fraction of 25

27 state, shows the fraction of the state s broadcast arket population 19 that falls in the arket in question. For each state, these fractions should su to 1, with soe allowance for rounding. The final colun in the table, fraction of arket, shows the fraction of the arket that falls in the state listed. For exaple, all of the Baltiore edia arket is within the state of Maryland, but only 45% of the D.C. broadcast arket is in Maryland. That states ay have very sall parts of large edia arkets along with other arkets has interesting iplications for our analysis. If ad prices are proportional to arket population, and if two edia arkets have the sae fraction of their populations in a particular state, then the cost to a candidate of reaching a single voter is the sae in both arkets even if the arkets differ in size. However, if a state has a large fraction of one arket and a sall fraction of a second arket, then the relative costs of reaching a single voter is proportional to these fractions. First, consider the four states in our saple with only two arkets or arket portions: Maryland, New Jersey, New Mexico and Oregon. The arkets in Maryland are of approxiately equal size. Recall, however, that the Baltiore arket is entirely in Maryland whereas less than half of the Washington, D.C. arket is in Maryland. Thus, it is ore than twice as expensive to reach a Maryland voter by buying ads in the D.C. arket as in the Baltiore arket. The other three states have uch larger differences in arket size. In New Jersey, the New York arket is about three ties as large as the Philadelphia arket but the fractions of each arket in that state are about the sae, so the cost of reaching a single New Jersey voter fro each arket are very siilar. In New Mexico, the 19 We define the state s broadcast arket population as the population living within one of the 100 largest broadcast arkets. State residents living outside one of these broadcast arkets are not included in our totals. 26

28 Albuquerque arket is about nine ties the size of the El Paso arket. Only a fifth of the El Paso arket, but nearly all of the Albuquerque arket, is in New Mexico. This iplies that the cost of reaching a voter by an ad there is perhaps four and a half ties the cost in Albuquerque. Finally, in Oregon, the Portland arket has 228 ties the population of the Spokane arket. This very large difference is due to the fact that such a sall fraction (less than 1%) of the Spokane arket falls in the state of Oregon, whereas the entire Portland arket is in Oregon. Thus, the cost of reaching an Oregon voter fro Spokane is 100 ties that of reaching a voter fro Portland. Given this price differential, it would be consistent with alost any optiizing odel --- not just Blotto --- for Oregon candidates to place no ads in Spokane, and this is in fact what we see in the data. For this reason, we think that it is appropriate to drop Spokane as a arket in this state and hence to treat Oregon as having only one edia arket. Second, consider the seven states with ultiple arkets but where one arket is uch larger than all the other arkets in the state cobined: Arizona, Colorado, Georgia, Illinois, Nebraska, New Hapshire, and Veront. Several of the arkets in these states will have very high relative advertising prices --- ore than 20 ties that in another arket --- and will thus be dropped fro the analysis. These include the portion of the Albuquerque arket in Arizona (where the relative price would be 25 ties that in Phoenix or Tucson) and Colorado (where the relative price would be at least 24 ties that in Colorado Springs or Denver). By the sae logic, Greenville and Jacksonville are dropped as Georgia arkets, Evansville is dropped as an Illinois arket, and Nebraska 27

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

Optimal Pigouvian Taxation when Externalities Affect Demand

Optimal Pigouvian Taxation when Externalities Affect Demand Optial Pigouvian Taxation when Externalities Affect Deand Enda Patrick Hargaden Departent of Econoics University of Michigan enda@uich.edu Version of August 2, 2015 Abstract Purchasing a network good such

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

Outperforming the Competition in Multi-Unit Sealed Bid Auctions

Outperforming the Competition in Multi-Unit Sealed Bid Auctions Outperforing the Copetition in Multi-Unit Sealed Bid Auctions ABSTRACT Ioannis A. Vetsikas School of Electronics and Coputer Science University of Southapton Southapton SO17 1BJ, UK iv@ecs.soton.ac.uk

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

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

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 Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

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

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna

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

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

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

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

A Simple Model of Reliability, Warranties, and Price-Capping

A Simple Model of Reliability, Warranties, and Price-Capping International Journal of Business and Econoics, 2006, Vol. 5, No. 1, 1-16 A Siple Model of Reliability, Warranties, and Price-Capping Donald A. R. George Manageent School & Econoics, University of Edinburgh,

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

Multidimensional Private Information, Market Structure and Insurance Markets

Multidimensional Private Information, Market Structure and Insurance Markets Multidiensional Private Inforation, Maret Structure and Insurance Marets Haning Fang Zenan Wu January 17, 2018 Abstract A large epirical literature found that the correlation between insurance purchase

More information

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109

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

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

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with

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

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

Midterm 1 Sample Solution

Midterm 1 Sample Solution Midter 1 Saple Solution NOTE: Throughout the exa a siple graph is an undirected, unweighted graph with no ultiple edges (i.e., no exact repeats of the sae edge) and no self-loops (i.e., no edges fro a

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

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

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

Chaotic Coupled Map Lattices

Chaotic Coupled Map Lattices Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each

More information

Deflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007

Deflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007 Deflation of the I-O Series 1959-2. Soe Technical Aspects Giorgio Rapa University of Genoa g.rapa@unige.it April 27 1. Introduction The nuber of sectors is 42 for the period 1965-2 and 38 for the initial

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

Modeling the Structural Shifts in Real Exchange Rate with Cubic Spline Regression (CSR). Turkey

Modeling the Structural Shifts in Real Exchange Rate with Cubic Spline Regression (CSR). Turkey International Journal of Business and Social Science Vol. 2 No. 17 www.ijbssnet.co Modeling the Structural Shifts in Real Exchange Rate with Cubic Spline Regression (CSR). Turkey 1987-2008 Dr. Bahar BERBEROĞLU

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

8.1 Force Laws Hooke s Law

8.1 Force Laws Hooke s Law 8.1 Force Laws There are forces that don't change appreciably fro one instant to another, which we refer to as constant in tie, and forces that don't change appreciably fro one point to another, which

More information

Tight Information-Theoretic Lower Bounds for Welfare Maximization in Combinatorial Auctions

Tight Information-Theoretic Lower Bounds for Welfare Maximization in Combinatorial Auctions Tight Inforation-Theoretic Lower Bounds for Welfare Maxiization in Cobinatorial Auctions Vahab Mirrokni Jan Vondrák Theory Group, Microsoft Dept of Matheatics Research Princeton University Redond, WA 9805

More information

Pivots Versus Signals in Elections

Pivots Versus Signals in Elections 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

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

The Transactional Nature of Quantum Information

The Transactional Nature of Quantum Information The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.

More information

lecture 36: Linear Multistep Mehods: Zero Stability

lecture 36: Linear Multistep Mehods: Zero Stability 95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,

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

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

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

NET Institute*

NET Institute* NET Institute* www.netinst.org Working Paper #07-5 Septeber 2007 undling and Copetition for Slots Doh-Shin Jeon Universitat Popeu Fabra Doenico Menicucci Università degli Studi di Firenze * The Networks,

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

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

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

Estimation of Korean Monthly GDP with Mixed-Frequency Data using an Unobserved Component Error Correction Model

Estimation of Korean Monthly GDP with Mixed-Frequency Data using an Unobserved Component Error Correction Model 100Econoic Papers Vol.11 No.1 Estiation of Korean Monthly GDP with Mixed-Frequency Data using an Unobserved Coponent Error Correction Model Ki-Ho Ki* Abstract Since GDP is announced on a quarterly basis,

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic

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

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

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

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points

More information

MULTIAGENT Resource Allocation (MARA) is the

MULTIAGENT Resource Allocation (MARA) is the EDIC RESEARCH PROPOSAL 1 Designing Negotiation Protocols for Utility Maxiization in Multiagent Resource Allocation Tri Kurniawan Wijaya LSIR, I&C, EPFL Abstract Resource allocation is one of the ain concerns

More information

The impact of online sales on centralised and decentralised dual-channel supply chains

The impact of online sales on centralised and decentralised dual-channel supply chains European J. Industrial Engineering, Vol. 12, No. 1, 2018 67 The ipact of online sales on centralised and decentralised dual-channel supply chains Ilkyeong Moon Departent of Industrial Engineering, Seoul

More information

Combining Classifiers

Combining Classifiers Cobining Classifiers Generic ethods of generating and cobining ultiple classifiers Bagging Boosting References: Duda, Hart & Stork, pg 475-480. Hastie, Tibsharini, Friedan, pg 246-256 and Chapter 10. http://www.boosting.org/

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

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc./B.A./B.Com.) MATHEMATICAL MODELLING

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc./B.A./B.Com.) MATHEMATICAL MODELLING ASSIGNMENT BOOKLET Bachelor s Degree Prograe (B.Sc./B.A./B.Co.) MTE-14 MATHEMATICAL MODELLING Valid fro 1 st January, 18 to 1 st Deceber, 18 It is copulsory to subit the Assignent before filling in the

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

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

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

Taming the Matthew Effect in Online Markets with Social Influence

Taming the Matthew Effect in Online Markets with Social Influence Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence AAAI-17 Taing the Matthew Effect in Online Markets with Social Influence Franco Berbeglia Carnegie Mellon University fberbegl@andrewcuedu

More information

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40 On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering

More information

1 Bounding the Margin

1 Bounding the Margin COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost

More information

Economic Resource Balancing in Plant Design, Plant Expansion, or Improvement Projects

Economic Resource Balancing in Plant Design, Plant Expansion, or Improvement Projects Econoic Resource Balancing in lant Design, lant Expansion, or Iproveent rojects Dan Trietsch MSIS Departent University of Auckland New Zealand --------------------------------------------------------------------------------------------------------

More information

26 Impulse and Momentum

26 Impulse and Momentum 6 Ipulse and Moentu First, a Few More Words on Work and Energy, for Coparison Purposes Iagine a gigantic air hockey table with a whole bunch of pucks of various asses, none of which experiences any friction

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

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

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

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax:

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax: A general forulation of the cross-nested logit odel Michel Bierlaire, EPFL Conference paper STRC 2001 Session: Choices A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics,

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

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL

More information

Ensemble Based on Data Envelopment Analysis

Ensemble Based on Data Envelopment Analysis Enseble Based on Data Envelopent Analysis So Young Sohn & Hong Choi Departent of Coputer Science & Industrial Systes Engineering, Yonsei University, Seoul, Korea Tel) 82-2-223-404, Fax) 82-2- 364-7807

More information

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation

More information

Determining OWA Operator Weights by Mean Absolute Deviation Minimization

Determining OWA Operator Weights by Mean Absolute Deviation Minimization Deterining OWA Operator Weights by Mean Absolute Deviation Miniization Micha l Majdan 1,2 and W lodziierz Ogryczak 1 1 Institute of Control and Coputation Engineering, Warsaw University of Technology,

More information

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J. Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6

More information

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry About the definition of paraeters and regies of active two-port networks with variable loads on the basis of projective geoetry PENN ALEXANDR nstitute of Electronic Engineering and Nanotechnologies "D

More information

Inference in the Presence of Likelihood Monotonicity for Polytomous and Logistic Regression

Inference in the Presence of Likelihood Monotonicity for Polytomous and Logistic Regression Advances in Pure Matheatics, 206, 6, 33-34 Published Online April 206 in SciRes. http://www.scirp.org/journal/ap http://dx.doi.org/0.4236/ap.206.65024 Inference in the Presence of Likelihood Monotonicity

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

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

Lower Bounds for Quantized Matrix Completion

Lower Bounds for Quantized Matrix Completion Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &

More information

Network Optimization Models for Resource Allocation in Developing Military Countermeasures

Network Optimization Models for Resource Allocation in Developing Military Countermeasures OPERATION REEARCH Vol. 60, No. 1, January February 2012, pp. 48 63 IN 0030-364X (print IN 1526-5463 (online http://dx.doi.org/10.1287/opre.1110.1002 2012 INFORM Network Optiization Models for Resource

More information

Forecasting and Rank-Order Contests

Forecasting and Rank-Order Contests Forecasting and Rank-Order Contests Marco Ottaviani Peter Noran Sørensen Preliinary Version, May 005 Abstract Forecasting is odeled as a rank-order contest with privately infored players. Rankorder contests

More information

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence Best Ar Identification: A Unified Approach to Fixed Budget and Fixed Confidence Victor Gabillon Mohaad Ghavazadeh Alessandro Lazaric INRIA Lille - Nord Europe, Tea SequeL {victor.gabillon,ohaad.ghavazadeh,alessandro.lazaric}@inria.fr

More information

A Dynamic Theory of Strategic Decision Making applied to the Prisoner s Dilemma

A Dynamic Theory of Strategic Decision Making applied to the Prisoner s Dilemma Dynaic Theory of Strategic Decision Making applied to the Prisoner s Dilea Gerald H Thoas and Keelan Kane Milwaukee School of Engineering dapt of Illinois Introduction The classic prisoner s dilea (PD)

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

Kinetic Theory of Gases: Elementary Ideas

Kinetic Theory of Gases: Elementary Ideas Kinetic Theory of Gases: Eleentary Ideas 9th February 011 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion of

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

A Fair Solution to the Compensation Problem

A Fair Solution to the Compensation Problem A Fair Solution to the Copensation Proble G. Valletta Discussion Paper 2007-38 Départeent des Sciences Éconoiques de l'université catholique de Louvain CORE DISCUSSION PAPER 2007/77 A FAIR SOLUTION TO

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

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

Kinetic Theory of Gases: Elementary Ideas

Kinetic Theory of Gases: Elementary Ideas Kinetic Theory of Gases: Eleentary Ideas 17th February 2010 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion

More information

Principal Components Analysis

Principal Components Analysis Principal Coponents Analysis Cheng Li, Bingyu Wang Noveber 3, 204 What s PCA Principal coponent analysis (PCA) is a statistical procedure that uses an orthogonal transforation to convert a set of observations

More information

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control An Extension to the Tactical Planning Model for a Job Shop: Continuous-Tie Control Chee Chong. Teo, Rohit Bhatnagar, and Stephen C. Graves Singapore-MIT Alliance, Nanyang Technological Univ., and Massachusetts

More information

Supplementary Information for Design of Bending Multi-Layer Electroactive Polymer Actuators

Supplementary Information for Design of Bending Multi-Layer Electroactive Polymer Actuators Suppleentary Inforation for Design of Bending Multi-Layer Electroactive Polyer Actuators Bavani Balakrisnan, Alek Nacev, and Elisabeth Sela University of Maryland, College Park, Maryland 074 1 Analytical

More information

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

More information

Error Exponents in Asynchronous Communication

Error Exponents in Asynchronous Communication IEEE International Syposiu on Inforation Theory Proceedings Error Exponents in Asynchronous Counication Da Wang EECS Dept., MIT Cabridge, MA, USA Eail: dawang@it.edu Venkat Chandar Lincoln Laboratory,

More information

USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta

USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta 1 USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS By: Ian Bloland, Augustana Capus, University of Alberta For: Physics Olypiad Weeend, April 6, 008, UofA Introduction: Physicists often attept to solve

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

INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN

INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN V.A. Koarov 1, S.A. Piyavskiy 2 1 Saara National Research University, Saara, Russia 2 Saara State Architectural University, Saara, Russia Abstract. This article

More information