Cyber and Physical Information Fusion for Infrastructure Protection: A Game-Theoretic Approach

Size: px
Start display at page:

Download "Cyber and Physical Information Fusion for Infrastructure Protection: A Game-Theoretic Approach"

Transcription

1 Cyber and Physical Information Fusion for Infrastructure Protection: A Game-Theoretic Approach Nageswara S V Rao Steve W Poole Chris Y T Ma Fei He Jun Zhuang David K Y Yau Oak Ridge National Laboratory Advanced Digital Sciences Center State University of New York at Buffalo Purdue University Abstract We consider a class of infrastructures composed of discrete components that can be disrupted by either cyber or physical attacks and are protected by cyber and physical reinforcements We formulate a game between the provider and attacker wherein their utility functions are in the form of sum of two terms an infrastructure survival probability term and a cost term We present a novel formulation that accounts for the cyber-physical interactions in two ways: i) the conditional survival probabilities of cyber and physical sub-infrastructures are specified by multiples of marginal probabilities at the structure-level and ii) the survival probabilities of components are determined by cyber and physical component attacks as well as component reinforcements We derive Nash Equilibrium conditions in terms of cost terms and component survival probabilities and obtain provider strategies by combining the cyber and physical parameters We propose sensitivity functions that highlight the dependence of infrastructure survival probability on cost parameters and component probabilities under statistical independence conditions This analysis shows a rather seemingly counter-intuitive qualitative behavior at NE that high costs and lower rewards lead to high infrastructure survival probability We apply this approach to simplified models of cloud computing infrastructures and energy grids both with a large number of components I INTRODUCTION The operation of infrastructures such as smart grids and cloud computing requires the continued functioning of cyber components such as Supervisory Control And Data Acquisition SCADA) systems servers routers and switches and also physical components such as power or fiber routes and cooling and power systems The components may be disabled and/or disconnected by cyber and physical attacks which will degrade the infrastructure performance In response the infrastructure providers are required to adopt strategies that ensure the required levels of operation and availability of both cyber and physical components by taking into account the strategies used by the attacker In this paper we consider a class of infrastructures consisting of discrete cyber and physical components which must be operational as individual units and also be available such as being connected to the network These components are subject to individual attacks in that cyber physical) attacks will disable cyber physical) components that have not been reinforced For example a cyber attack on a server may bring it down or a physical attack on a fiber route of a network may destroy it In addition to these direct impacts there are cyber-physical interactions that make a component unavailable to the infrastructure even though the component by itself is operational that is not disabled For example a physical attack on a fiber connection to a site that houses servers of a cloud computing infrastructure will render them unavailable over the network In addition to these component-level characterization we consider that all cyber components form the cyber subinfrastructure and all physical components form the physical sub-infrastructure The cyber and physical sub-infrastructures can be separately identified and are typically operated by different domain experts For example SCADA systems of a power grid are maintained by operations staff whereas the physical power routes are maintained by power engineering staff A complete disruption of either sub-infrastructure will lead to that of the entire infrastructure and we consider that conditional probability of failure or unavailability of one subinfrastructure given the failure of the other can be estimated as a scalar multiplier which is dervived using the underlying structure We consider infrastructures that consist of a large number of uniform components such as servers and SCADA systems such that the overall performance level of the infrastructure is adequately characterized by the number of components that are operational and available The attacker is expected to launch a certain number of cyber or physical attacks but not both But the provider needs to reinforce certain numbers of both cyber and physical components Thus there is a basic level of asymmetry between them although in some sense the infrastructure appears as a uniform collection of components to both This characterization is coarser than those that account for specific components and is intended for infrastructures with a large number of components such as cloud computing infrastructure with thousands of servers or a power grid with hundreds to thousands of SCADA systems 1 In these systems the sheer number of components makes it much too complex to account for the individual components and it is more manageable to deal in terms of the number of components being attacked or reinforced We focus mainly on the provider who is charged with reinforcing a certain number of cyber and physical components of the infrastructure to defend against the degradations of both kinds which are specified by the number 1 A finer model might require taking into account the specific details of the individual components

2 of components attacked) We consider that a component can be reinforced so that it cannot be disabled by a direct attack but it can be made unavailable as an indirect result of attack on another component as in the case of a server in the cloud computing infrastructure example These infrastructures are characterized by the following considerations: a) b) c) d) knowledge about the capabilities and certain locations of the infrastructure is available to the attacker primarily from public sources; costs incurred by the provider and attacker are private information and not available to the other; strategies used by the provider in choosing which parts to reinforce and by the attacker in choosing which parts to attack are not revealed to the other; results of attacks are known to the provider and attacker These considerations lead to game-theoretic models where information in items a) and d) is available to both defender and attacker and information in items b)-c) is private Both defender and attacker consider that the other utilizes a probabilistic strategy Our objective is to gain a qualitative understanding of the interactions between the provider and attacker by utilizing a simultaneous game model This model is simpler than those used in critical infrastructures such as power distribution transportation and agriculture [3] since it does not model the dynamics of the underlying phenomena for example using partial differential equations to model traffic dynamics We study methods that are designed to ensure the infrastructure survival in presence of cyber and physical degradations within the framework of game theory [4] [7] [8] Such characterizations that address system reliability and robustness aspects using a game-theoretic formulation have been considered recently in several applications [2] for example smart grids [6] cloud computing infrastructures [9] and power systems [5] Our approach is based on the Stackelberg formulation wherein the infrastructure provider chooses options based on instantaneous information and may re-derive the actions as new information becomes available This formulation is more reactive and sensitive to dynamic disruptions compared to long-term strategies used in Markov game models [1] [6] We present a formulation of a game between the provider and attacker wherein their utility functions are in the form of sum of a infrastructure survival probability term and a cost term The infrastructure survival probability accounts for cyber-physical aspects in two ways: i) the conditional survival probabilities of cyber and physical sub-infrastructures are specified by a multiple of marginal probabilities derived at the structure-level and ii) component survival probabilities are derived based on the number of cyber or physical attacks and the number of cyber and physical components reinforced Nash Equilibrium NE) represents the attack and reinforcement actions that optimize the utility of attacker and provider based on their individual information from which neither has a motivation to unilaterally deviate [4] We derive the Nash Equilibrium conditions in terms of cost terms and the component survival probabilities typically expressed in terms of number of cyber and physical attacks and reinforcements The infrastructure provider strategy is derived by combining both cyber and physical parameters We also estimate the partial derivatives that indicate the sensitivities of infrastructure survival probability with respect to cost parameters and conditional success and failure probabilities of components under statistical independence conditions This analysis shows a rather seemingly counter-intuitive qualitative behavior that high costs and lower rewards lead to NE with high infrastructure survival probability We apply this approach to simplified models of cloud computing infrastructures and smart energy grids We first consider cases both cyber and physical components are uniform in Section II-B namely servers and fiber connections for cloud infrastructures and SCADA systems and power lines for power grid Then we consider two different types of cyber components namely servers and routers for cloud infrastructure in Section IV-A and SCADA systems and power meters in the smart grid in Section IV-B In these application scenarios we explicitly derive NE conditions and sensitivity functions In Section II we present our discrete component model for the infrastructure and derive the survival probabilities at the structural- and component-level We present the game theoretic formulation in Section III and derive NE conditions and sensitivity estimates We present applications in Section IV II DISCRETE SYSTEM MODELS We consider that the infrastructure consists of N C cyber components that constitute the cyber sub-infrastructure and N P physical components that constitute the physical subinfrastructure Each cyber and physical component must be operational and available to contribute to the infrastructure operation A component may be unavailable in two ways: it may be operationally disabled or it is operational but disconnected from the infrastructure Typically a component may be disabled by a direct attack and may be disconnected as an indirect effect of an attack on another component In particular a cyber attack may render a physical component unavailable even if it is physically operational for example an attack on a SCADA system might disable power flow on a line And a physical attack on a component might render cyber components unavailable for example fiber cuts to a server site would make all servers unavailable even though they are up and running We capture these cyber-physical interactions using survival probabilities at two levels: i) at the structure-level we utilize the abstractions of cyber and physical sub-infrastructures and ii) at the component-level we consider that cyber attacks affect the availability of physical components and vice versa We consider that the number of components of the system to be large so that we abstract out the individual component differences by using probabilities that capture generic cyber and physical components A Cyber-Physical Structural Interactions The probability that the infrastructure is operational is denoted by P CP At the structure-level the probabilities that

3 the cyber and physical sub-infrastructures are operational are denoted by P C and P P respectively and their failure probabilities are denoted by P C P C and P P P P respectively For the infrastructure to be operational both cyber and physical sub-infrastructures must necessarily be operational and available) and the failure of one in general effects the availability of the other due to component-level cyber-physical interactions The attacker can disable the infrastructure by bringing down either cyber or physical sub-infrastructures Since the costs of attacking individual sub-infrastructures are additive typically there is no particular advantage in attacking both parts simultaneously in our formulation Thus we have P CP [P C + P P P C P ] = P C + P P 1 + P C P 21) The joint probability P C P is expressed in terms of conditional failure probabilities as: P C P = P C P P P and P C P = P P CP C Using the structural properties of infrastructure we utilize cyber and physical multipliers denoted by a C and a P respectively to capture the relative importance of cyber and physical parts The failure probability of cyber sub-infrastructure given that physical sub-infrastructure is disabled is P C P = a C P C For example in a cloud computing infrastructure with 100 servers per site disabling the fiber connection would disconnect all servers at the site which can be reflected by choosing a C 00 Similarly we have P P C = a P P P The cyberphysical multiplier a CP = a C or a CP = a P captures the effects of cyber and physical multipliers respectively which is appropriately chosen based on the details of the infrastructure Condition 21: The probability that infrastructure is operational is expressed in terms of those of cyber and physical sub-infrastructures as P CP = P C+P P P C P = P C +P P 1+a CP 1 P C )1 P P ) where a CP = a C or a CP = a P If a C > 1 the cyber failures are positively correlated to physical failures that is they occur with higher probability following physical failures since P C P > P C If a C < 1 means that cyber failures are negatively correlated to physical failures The special case a C means that the cyber failures are independent of physical failures The conditions on a P are similarly interpreted If a CP > 1 then either cyber failures are positively correlated or physical failures are positively correlated with the other If a CP < 1 then both cyber and physical failures are negatively correlated with the other B Component Survival Probabilities Let p CR and p CN denote the probability of survival of a cyber component with and without reinforcement respectively Under the assumption of statistical independence of component failures the probability that the cyber and physical parts survive the attacks are given by and P C β C P P β P NC x c NP x p ) p xc CR pn C x c CN ) p xp CR pn P x p CN respectively where β C and β P are the corresponding normalization constants Let p R denote the probability that a component is reinforced such that p CR = p C R p R where p C R is the conditional probability that a reinforced component will survive Similarly p N p R is probability that a component is not reinforced and p CN = p N where is the probability that a non-reinforced component will survive We apply normalization by using the probability one event that exactly x c cyber components and x p physical components are reinforced such that ) NC p xc R 1 p R) N C x c = β C and x c NP x p ) p xp R 1 p R) N C x p = β P where p R is specific to cyber and physical components By applying this normalization factor we have the following simpler expression for component survival probabilities: P C = p xc C R pn C x c C N and P P = p xp P R pn P x p P N Condition 22: The component failures are statistically independent such that the survival probabilities of cyber and physical sub-infrastructures are given by P C = p xc C R pn C x c C N and P P = p xp P R pn P x p P N respectively We now describe two simplified illustrative examples for which we can derive estimates for p B R and p B N for B = C P We will expand further on these examples in Section IV by taking additional details into account Example1: Cloud Computing Infrastructure: We consider a simplified model of a cloud computing infrastructure which consists of several sites each of which houses 100 servers The servers constitute cyber components which may be disabled by cyber attacks if not cyber-reinforced The physical fiber connections constitute the physical components of our model and they can be disrupted by physical attacks; reinforcements in this case could be in the form of redundant physically separate fiber runs A physical fiber attack will disconnect all servers at the site from the network making them unavailable We assume that both attacker and provider choose the components according to uniform distribution Thus the probability that a cyber-reinforced component survives the fiber attacks is given by p C R = [y p x p ] + where 0 1 is appropriately chosen and [] + is the non-negative part that is [x] + = x for x > 0 and [x] + = 0 otherwise This estimate reflects that there are a minimum of [y p x p ] + non-reinforced fiber connections and a randomly chosen cyber component is more likely to be disconnected for higher values of [y p x p ] + There is no dependence on y c since a cyber attack will not be able to disable a cyber-reinforced component If the cyber component is not reinforced it will be brought down by a direct cyber attack or indirectly by fiber attack but the latter will have higher impact Thus we use the estimate of survival probability as = 1 + y c + 100[y p x p ] +

4 which reflects the additional lowering of survival probability inversely proportional to the level of cyber attack y c Example 2: Power Grid Infrastructure: We consider a simplified model of a power grid controlled by a cyber) network of SCADA systems where each system controls the power flow on 5 lines The SCADA systems constitute the cyber components and the power lines constitute the physical components A SCADA system may be disabled by cyber means and we assume that that such event will disrupt the power flow on all 5 lines associated with the system By using the reasoning analogous to Example 1 we estimate the survival probability of reinforced power lines that can be disconnected by y c cyber attacks as f P p P R = 1 + 5[y c x c ] + where 0 f P 1 is appropriately chosen Each power line can be directly disrupted by physical means such that it can be brought down if not reinforced and a component is more likely to be unavailable if there are more physical attacks namely higher y p Thus an attack on a SCADA system will have an amplified effect on power lines compared to direct physical attacks such that f P = 1 + y p + 5[y c x c ] + provides an estimate of the probability of survival of a nonreinforced power line III GAME THEORETIC FORMULATION Consider that the provider chooses to reinforce x c cyber components and x p physical components and the attacker attacks y c cyber components and y p physical components The provider s objective is to keep the infrastructure operational and available which involves selecting a number of components to reinforce at certain costs We express the provider utility function as a sum of system probability and cost terms U D = [P CP x c x p y c y p )] C D x c x p ) where represents the reward of keeping the infrastructure available and C D ) represents the cost incurred in reinforcing the components When the component reinforcement costs are uniform we use C D x c x p ) = c CD x c + c P D x p where c CD and c P D are reinforcement costs of cyber and physical components respectively Similarly the attacker s utility function is given by U A = [1 P CP x c x p y c y p )] g A C A y c y p ) where g A represents the reward of disabling the infrastructure and C A ) represents the cost of attacking the components When the attack costs are uniform we use C A y c y p ) = c CA y c + c P A y p where c CA and c P A are the attack costs of cyber and physical components respectively and only one of y c and y p are non-zero A Nash Equilibrium Conditions The Nash Equilibrium conditions are derived by equating the corresponding derivatives to zero which yields U D x a = x a x a = 0 for a = c p for the provider and U A y a = y a g A C A y a = 0 for a = c p for the attacker When uniform component costs are used these conditions are simplified and compactly represented as z a = m B c ab /g B where z = x a = c p B = D and m D correspond to the provider and z = y a = c p B = A and m A = 1 correspond to the attacker We define the cyber-physical differential z c z p = z p z c = C B z p C B z c = θ B x c x p y c y p ) which indicates the relative importance of cyber and physical parts such that z = x and B = D for the provider and z = y and B = A for the attacker When component costs are used we have θ B x c x p y c y p ) = c P B c CB for B = A for the attacker and B = D for the provider which solely depends on component costs We now consider that the effects of reinforcement and attacks on cyber and physical sub-infrastructures can be separated such that most of the interactions are captured at the P P z c component level more precisely 0 and P C z p 0 for z = x y Intuitively these conditions indicate that at the structure-level only direct impacts are dominant for example cyber reinforcements contribute to improving the cyber subinfrastructure but not directly to physical sub-infrastructure Consequently we have for the defender the following condition Condition 31: For P C in Condition 21 we have for the defender B OR Systems [ 1 P P )] P C [ 1 P C )] P P Before we present the general result in the next section we first consider a special case where the probability of simultaneous failures of cyber and physical sub-infrastructures is negligible Consequently the infrastructure will fail if either of the physical or cyber sub-infrastructures fails such that PCP = P C + P P and such infrastructures are called OR Systems In this case the dependence of P CP on system parameters at NE is easier to derive and interpret since it will turn out to be determined entirely by component-level cyber-physical interactions without requiring the structurelevel interactions Condition 32: The probability of simultaneous failures of cyber and physical sub-infrastructures is low P C P 0 such that P CP P C + P P ) = P C + P P 1

5 Under this condition we have a much simpler form of Condition 31 given by P C and P P At NE we have P C P P We now estimate the partial differentials on the left hand side for these terms by using the specific forms P C = p xc C R pn C x c C N and P P = p xp P R pn P x p P N from Condition 22 For this estimation we utilize the following general formula Lemma 31: For fx) = a x b N x we have lna/b)fx) x fx) = Proof: We take ln on both sides of fx) and differentiate them with respect to x Then an algebraic manipulation yields the above formula By applying the above formula from Lemma 31 to P C and P P we obtain the following estimates for the survival probabilities of cyber and physical sub-infrastructures: P P ;D x p y c y p ) = P C;D x c y c y p ) = ) pp R x c ) When component costs are used these will be further simplified to c P D P P ;D x p y c y p ) = ) pp R P C;D x c y c y p ) = c CD ) These estimates provide qualitative information about the sensitivity of survival probabilities of cyber and physical parts in terms of costs and component-level survival probabilities First observation is that these estimates involve only componentlevel probabilities of the same type namely P P ;D and P C;D depend only on the probabilities of physical and cyber components respectively In particular they do not involve structurelevel interactions but the component probabilities capture the cyber-physical interactions since they depend on both cyber and physical component attacks and reinforcements For both cyber and physical parts the survival probabilities are proportional to component costs and inversely proportional to reward terms At a first look this looks counter intuitive but this characterization applies to the set of Nash equilibria and not to system behavior as a whole In part it is an artifact of the multiplicative term in the provider s utility function instead of just being P CP alone Because of the maximization of the additive utility term at NE a higher utility indeed can be achieved at lower P C or P P for a given gain term Qualitatively at NE the partial derivative of P C is directly proportional to the cost and inversely proportional to the reward term But under Lemma 31 the partial derivative is indeed proportional to P C itself with the multiplication term ln ) and hence has the same qualitative behavior as its partial derivative In addition both P P ;D and P C;D depend on the component survival probabilities due to the multiplication term in a qualitatively similar: a) higher survival probability of reinforced component leads to lower infrastructure survival probability and b) higher survival probability of nonreinforced component leads to higher infrastructure survival probability From the provider s perspective qualitative information about the dependence of P CP can be inferred using the estimate P CP ;D x c ) = PCP dx c = c CD x c that utilizes the partial derivative as a linearized approximation of dp C dx c It shows that the system survival probability at NE is inversely proportional to and directly proportional to component cost c CD and level of reinforcement x C C Statistical Independence oyber and Physical Sub- Infrastructures We consider the special case a CP such that P C P = P C or P P C = P P or both such that the cyber subinfrastructure failures are statistically independent of physical sub-infrastructure failures and vice versa Under this condition the survival probabilities of the cyber and physical subinfrastructures are also statistically independent such that At NE we have P CP = P C P P P C P P We now substitute expressions for P C and P P Lemma 31 and obtain the system of equations: P C;D PP :D = P P ;D PC;D = ) pp R x c ) based on Qualitatively at NE the survival probabilities of cyber and physical sub-infrastructures have an inverse relationship but their product is determined by cost terms and component survival probabilities in a manner similar to individual part probabilities P C;D and P P ;D of previous section

6 D NE Sensitivity Functions We now estimate P C and P P under Conditions and 31 to provide qualitative information about their sensitivities to different parameters from the provider s perspective Theorem 31: Under Conditions and 31 for a CP 1 an estimate of the survival probability of physical sub-infrastructure is ˆP P ;D x c y c y p ) = d P D d CD 2 ) ) 2a CP ± 1 2a CP acp ) 2 d P D d CD ) ) + 4a CP d P D and an estimate of the survival probability of cyber subinfrastructure is ˆP C;D x c y c y p ) where = d CD d P D 2 ) ) 2a CP ± 1 2a CP acp ) 2 d CD d P D ) ) + 4a CP d CD d P D x p y c y p ) = d CD x c y c y p ) = ) pp R x c ) Proof: At NE we have and P P P By using the formulae in Condition 31 we have [ 1 P P )] P C [ 1 P C )] P P We now substitute expressions for P C and P P Lemma 31 and obtain the system of equations: Then we have P C [ 1 P P )] = P P [ 1 P C )] = P C P P = d CD d P D ) pp R x c ) based on where we represent d P D x p y c y p ) and d CD x c y c y p ) by simply d P D and d CD respectively By using P C from this equation in P P [ 1 P C )] P P = d P D we obtain the quadratic equation [ ] a CP PP 2 dp D d CD )a CP ) P P d P D = 0 Solution to this equation provides ˆP P ;D x c y c y p ) which in turn yields ˆP C;D x c y c y p ) Compared to the case of OR Systems described in the previous section there is a significant level of cyber-physical interactions in ˆP P ;D x c y c y p ) and ˆP C;D x c y c y p ) which both depend on d P D x p y c y p ) and d CD x c y c y p ) In particular they both are affected by survival probabilities of cyber and physical components each of which in turn depends on the number of both cyber and physical component attacks and reinforcements Also the cyber-physical multiplier a CP affects these quantities in much more complicated manner than its multiplier role in Condition 21 Since 0 P C P 1 we 1 have 0 a CP max{p C P P } which implies a CP can take values both higher and lower than 1 Both ˆP P ;D x c y c y p ) and ˆP C;D x c y c y p ) depend on the difference of components costs as opposed to depending on components of the same type as in the case or OR Systems Furthermore the nature of dependence reverses as a CP crosses 1 reflecting the effects of positive and negative correlations between the cyber and physical parts For a CP < 1 ˆPP ;D and ˆP C;D are directly proportional to cyber and physical component costs respectively and this relationship reverses for a CP > 1 Similarly for a CP < 1 ˆPP ;D and ˆP C;D depend on components of the corresponding type namely physical and cyber component survival probabilities respectively as follows: a) higher survival probability of reinforced component leads to lower sub-infrastructure survival probability and b) higher survival probability of non-reinforced component leads to higher sub-infrastructure survival probability And ˆPP ;D and ˆP C;D depend on components of other type namely cyber and physical component survival probabilities respectively in the opposite way For a CP > 1 the qualitative behavior reverses in the cases above which illustrates the significant impact of the structure-level cyber-physical correlation on the overall behavior of the infrastructure E Survival Probabilities oyber and Physical Sub- Infrastructures It is instructive to compare the two survival probabilities of cyber and physical sub-infrastructuers P C and P P respectively since minimum of the two determines the survival of the infrastructure We have P C P P = d CD d P D Then the relationship between P C and P P is determined as follows: a) d CD > d P D ; a CP > 1: P C = P P a for a 0

7 b) d CD > d P D ; a CP < 1: P C = P P + b for b 0 c) d CD < d P D ; a CP > 1: P C = P P + c for c 0 d) d CD < d P D ; a CP < 1: P C = P P d for d 0 It shows that both relative component costs and cyber-physical multiplier a CP can independently determine which part has the higher probability of survival The difference in the survival probabilities of cyber and physical parts depends on the difference in component costs as expected But the exact nature depends on the 1-crossing point of a CP namely the dependence reverse as the cyber and physical parts are switched from being positively correlated to negatively correlated IV APPLICATION EXAMPLES In this section we incorporate additional details into Examples 1 and 2 described in Section II-B We consider that there are different types of cyber and physical components such that x a c a A C corresponds to cyber components of type a and x b p b A P corresponds to physical components of type b Thus we have x c = x a C and x p = x b p Now we a A C b A P generalize Condition 31 as follows Condition 41: The component failures are statistically independent such that P C = ) x a p a c C R p N C x c C N a A C P P = b A P ) x b p b p P R p N P x p P N By proceedings as in Section II-B we obtain the following conditions using Lemma 31: for a A C b A P P C p a ) C R x a = P C ln c ) P P p b P R x b = P P ln p where p a C R and pb P R denote the probabilities of reinforced cyber component of type a and reinforced physical component of type b respectively These estimates can be used for evaluating ˆP B and P B for B = C P as described in previous sections when there are different types of cyber and physical components The overall conclusions are qualitatively quite similar to the simpler cases of uniform components A Cloud Computing Infrastructure We now consider that in the cloud computing infrastructure of Example 1 all servers at a site are connected via a single gateway router to the network A physical fiber attack will disconnect all servers at the site from the network making them unavailable and a cyber attack on the gateway router will also have the same effect The multiplier a CP would be computed appropriately at the structure-level to reflect it and the component survival probabilities are computed using more detailed formulae derived above Now we separate the cyber components into two classes namely server and routers and x c = x S c + x R c such that x S c and x R c denote the number of reinforced servers and routers respectively Similarly y c = yc S + yc R such that yc S and yc R denote the number of servers and routers attacked respectively Then the cyber component probabilities are computed separately for severs and routers denoted by p S C R and pr C R respectively The probability that a cyber-reinforced server survives fiber or router attacks is given by p S C R = [y p x p ] [y R c x R c ] + which now depends on both physical attacks on fiber and cyber attack on routers Then an estimate of the probability that cyber-reinforced router survives a fiber attack is given by p R C R = 1 + [y p x p ] + since a cyber attack on a reinforced router has no impact and a fiber attack will disconnect only one router If the router is not cyber-reinforced then we have p R C N + [y p x p ] + + yc R By using these estimates for the router we have d R CD = 1 + c CD ) yc R 1+100[y p x p] + which increases in the number of attacks on non-reinforced fiber routes and decreases in the number of cyber router attacks If the cyber component server or router is not reinforced it will be brought down by a direct cyber attack or indirectly by fiber attack but the latter will have more impact However cyber attacks on servers and routers will have different impacts on the availability to the infrastructure namely a server attack will just bring it down but a router attack will make all 100 servers unavailable Thus for server that is not cyber reinforced we use the estimate p S C N + 100[y p x p ] [yc R x R c ] + + yc S which reflects the additional lowering of survival probability inversely proportional to the level of cyber attack yc S and to but amplified by a factor 100 Thus for servers we have y R c d S CD = c CD ) [yR c xr c ]++ys c 1+100[y p x p] + which increases in the number of attacks on non-reinforced fiber connections but decreases in the number of cyber attacks on non-reinforced routers multiplied by 100 and also in the total number of cyber attacks on servers The survival probabilities of physical fiber components depend on x p and y p such that f P p P R = and = f P 1 + [y p x P ] y p which increases in the number of physical attacks but decreases in the number of attacks on non-reinforced fiber components By combining the two formulae for fiber we have c P D d P D = ) 1+[yp x P ] + 1+y p

8 which increases in the number of physical attacks but decreases in the number of attacks on non-reinforced fiber components In addition to d P D and d B CD for B = S R the survival probabilities of cyber and physical sub-infrastructures are determined by the correlation multiplier a CP as described in Section III-E B Smart Grid Infrastructure The power grid model described in Example 2 is enhanced with smart meters on the lines that provide demand information to the generation and distribution control systems The smart meters can be attacked by cyber means so that the demand information can be manipulated for example to make it zero Now we separate the cyber components into two classes namely SCADA systems and smart meters and x c = x S c +x M c such that x S c and x M c denote the number of reinforced SCADA systems and meters respectively Similarly y c = yc S + yc M such that yc S and yc M denote the number of SCADA systems and meters attacked respectively Then the cyber component probabilities are estimated separately for SCADA systems and meters The survival probabilities of the power supply lines with and without reinforcement are denoted by p P R and respectively A SCADA system or a meter may be disabled by cyber means which will disrupt the power flow on the lines so that 1 p P R = 1 + 5[yc S x S c ] + + [yc M x M c ] + for physically-reinforced power lines; notice that cyber attacks on SCADA systems are amplified 5 times compared to attacks on smart meters Each power line can be directly disrupted by physical means such that it can be brought down if not reinforced and thus we have 1 = 1 + [y p x p ] + + 5[yc S x S c ] + + [yc M x M c ] + which reflects the amplified effect of cyber attacks on SCADA systems compared to physical line attacks Combining the two formulae we have d P D = 1 + c P D ) [y p x p] + 1+5[yc S xs c ]++[ym c xm C ]+ which decreases in the number of attacks on non-reinforced power lines and increases in the number of attacks on nonreinforced SCADA systems and non-reinforced meters but the former effect is amplified 5 times The survival probabilities of cyber components are given by p B C R 1 + [yc B x B and p B C N c ] yc B for B = S M Then we have d B CD = c P D ) 1+yc B 1+[yc B xb c ]+ for B = S M which decreases in the total number of cyber attacks but increases in the number of attacks on nonreinforced cyber attacks The net effect of the numbers of attacks and reinforcements on the survival probabilities of cyber and physical sub-infrastructures is also determined by correlation multiplier a CP in addition to d P D and d B P D for B = S M as described in Section III-E V CONCLUSIONS We studied a class of infrastructures composed of a large number of discrete components that can be disrupted by either cyber or physical attacks and are protected by cyber and physical reinforcements Using a game-theoretic formulation we capture the cyber-physical interactions in two ways: conditional survival probabilities of cyber and physical sub-infrastructures at the structure-level and the survival probabilities of components determined by the number of cyber and physical component attacks and reinforcements We derived Nash Equilibrium conditions in terms of cost terms and component survival probabilities and estimated the sensitivity functions that indicate the dependence of infrastructure survival probability on cost parameters component probabilities and the correlation multipliers of cyber and physical subinfrastructures We applied this approach to models of cloud computing infrastructures and energy grids at different levels of abstraction when both have a large number of components This formulation could be extended in several ways in future studies It would be interesting to study sequential game formulations of this problem and cases where different levels of knowledge are available to each party Applications of our approach to more detailed models of cloud computing infrastructure smart energy grid infrastructures and highperformance computing complexes would be of future interest Acknowledgments This work is funded by the Mathematics oomplex Distributed Interconnected Systems Program Office of Advanced Computing Research US Department of Energy and by Extreme Scale Systems Center sponsored by U S Department of Defense and performed at Oak Ridge National Laboratory managed by UT-Battelle LLC for US Department of Energy under Contract No DE-AC05-00OR22725 REFERENCES [1] T Alpcan and T Basar Network Security: A Decision and Game Theoretic Approach Cambridge University Press 2011 [2] V M Bier and M N Azaiez editors Game Theoretic Risk Analysis of Security Threats Springer 2009 [3] G Brown M Carlyle J Salmern and K Wood Defending critical infrastructure Interfaces 366): [4] D Fudenberg and J Tirole Game Theory MIT Press 2003 [5] C Y T Ma D K Y Yau and N S V Rao Markov game analysis for attack-defense of power networks under possible misinformation IEEE Transactions on Power Systems 2013 in press [6] C Y T Ma D K Y Yau and N S V Rao Scalable solutions of Markov games for smart-grid infrastructure protection IEEE Transactions on Smart Grid 14) 2013 [7] R B Myerson Game Theory: Analysis oonflict Harvard University Press 1991 [8] N Nisan T Roughgarden E Tardos and V V Vazirani editors Algorithmic Game Theory Cambridge University Press 2007 [9] N S V Rao D K Y Yau and C Y T Ma On robustness of cyberphysical network infrastructure In Workshop on Design Modeling and Evaluation oyber Physical Systems 2011

Defense of Cyber Infrastructures Against Cyber-Physical Attacks Using Game-Theoretic Models

Defense of Cyber Infrastructures Against Cyber-Physical Attacks Using Game-Theoretic Models Risk Analysis, Vol. 36, No. 4, 26 DOI:./risa.2362 Defense of Cyber Infrastructures Against Cyber-Physical Attacks Using Game-Theoretic Models Nageswara S. V. Rao,, Stephen W. Poole, Chris Y. T. Ma, 2 Fei

More information

CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria

CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria Tim Roughgarden November 4, 2013 Last lecture we proved that every pure Nash equilibrium of an atomic selfish routing

More information

Simple Counter-terrorism Decision

Simple Counter-terrorism Decision A Comparative Analysis of PRA and Intelligent Adversary Methods for Counterterrorism Risk Management Greg Parnell US Military Academy Jason R. W. Merrick Virginia Commonwealth University Simple Counter-terrorism

More information

Intensive Computation and Performance of Computer Networks

Intensive Computation and Performance of Computer Networks Introduction to joint projects for the courses of Intensive Computation and Performance of Computer Networks Novella Bartolini and Annalisa Massini Damage assessment and recovery after network failures

More information

Lecture December 2009 Fall 2009 Scribe: R. Ring In this lecture we will talk about

Lecture December 2009 Fall 2009 Scribe: R. Ring In this lecture we will talk about 0368.4170: Cryptography and Game Theory Ran Canetti and Alon Rosen Lecture 7 02 December 2009 Fall 2009 Scribe: R. Ring In this lecture we will talk about Two-Player zero-sum games (min-max theorem) Mixed

More information

Defending Multiple Terrorist Targets

Defending Multiple Terrorist Targets Defending Multiple Terrorist Targets Sanghoon Lee May 1, 2006 Abstract This paper analyzes a situation in which multiple targets are exposed to a potential terrorist threat. The probability of an attack

More information

Time-varying failure rate for system reliability analysis in large-scale railway risk assessment simulation

Time-varying failure rate for system reliability analysis in large-scale railway risk assessment simulation Time-varying failure rate for system reliability analysis in large-scale railway risk assessment simulation H. Zhang, E. Cutright & T. Giras Center of Rail Safety-Critical Excellence, University of Virginia,

More information

Quantifying Cyber Security for Networked Control Systems

Quantifying Cyber Security for Networked Control Systems Quantifying Cyber Security for Networked Control Systems Henrik Sandberg ACCESS Linnaeus Centre, KTH Royal Institute of Technology Joint work with: André Teixeira, György Dán, Karl H. Johansson (KTH) Kin

More information

Combinatorial Agency of Threshold Functions

Combinatorial Agency of Threshold Functions Combinatorial Agency of Threshold Functions Shaili Jain 1 and David C. Parkes 2 1 Yale University, New Haven, CT shaili.jain@yale.edu 2 Harvard University, Cambridge, MA parkes@eecs.harvard.edu Abstract.

More information

Cyber Attacks, Detection and Protection in Smart Grid State Estimation

Cyber Attacks, Detection and Protection in Smart Grid State Estimation 1 Cyber Attacks, Detection and Protection in Smart Grid State Estimation Yi Zhou, Student Member, IEEE Zhixin Miao, Senior Member, IEEE Abstract This paper reviews the types of cyber attacks in state estimation

More information

For general queries, contact

For general queries, contact PART I INTRODUCTION LECTURE Noncooperative Games This lecture uses several examples to introduce the key principles of noncooperative game theory Elements of a Game Cooperative vs Noncooperative Games:

More information

Computation of Efficient Nash Equilibria for experimental economic games

Computation of Efficient Nash Equilibria for experimental economic games International Journal of Mathematics and Soft Computing Vol.5, No.2 (2015), 197-212. ISSN Print : 2249-3328 ISSN Online: 2319-5215 Computation of Efficient Nash Equilibria for experimental economic games

More information

A Polynomial-time Nash Equilibrium Algorithm for Repeated Games

A Polynomial-time Nash Equilibrium Algorithm for Repeated Games A Polynomial-time Nash Equilibrium Algorithm for Repeated Games Michael L. Littman mlittman@cs.rutgers.edu Rutgers University Peter Stone pstone@cs.utexas.edu The University of Texas at Austin Main Result

More information

NETWORK TOPOLOGY VULNERABILITY/COST TRADE-OFF: MODEL, APPLICATION, AND COMPUTATIONAL COMPLEXITY

NETWORK TOPOLOGY VULNERABILITY/COST TRADE-OFF: MODEL, APPLICATION, AND COMPUTATIONAL COMPLEXITY Internet Mathematics, 11:588 66, 015 Copyright Taylor & Francis Group, LLC ISSN: 154-7951 print/1944-9488 online DOI: 10.1080/1547951.015.1018019 NETWORK TOPOLOGY VULNERABILITY/COST TRADE-OFF: MODEL, APPLICATION,

More information

Game Theory: Lecture 3

Game Theory: Lecture 3 Game Theory: Lecture 3 Lecturer: Pingzhong Tang Topic: Mixed strategy Scribe: Yuan Deng March 16, 2015 Definition 1 (Mixed strategy). A mixed strategy S i : A i [0, 1] assigns a probability S i ( ) 0 to

More information

The Impact of Distributed Generation on Power Transmission Grid Dynamics

The Impact of Distributed Generation on Power Transmission Grid Dynamics The Impact of Distributed Generation on Power Transmission Grid Dynamics D. E. Newman B. A. Carreras M. Kirchner I. Dobson Physics Dept. University of Alaska Fairbanks AK 99775 Depart. Fisica Universidad

More information

Unsupervised Learning with Permuted Data

Unsupervised Learning with Permuted Data Unsupervised Learning with Permuted Data Sergey Kirshner skirshne@ics.uci.edu Sridevi Parise sparise@ics.uci.edu Padhraic Smyth smyth@ics.uci.edu School of Information and Computer Science, University

More information

Adaptive State Feedback Nash Strategies for Linear Quadratic Discrete-Time Games

Adaptive State Feedback Nash Strategies for Linear Quadratic Discrete-Time Games Adaptive State Feedbac Nash Strategies for Linear Quadratic Discrete-Time Games Dan Shen and Jose B. Cruz, Jr. Intelligent Automation Inc., Rocville, MD 2858 USA (email: dshen@i-a-i.com). The Ohio State

More information

A Price-Based Approach for Controlling Networked Distributed Energy Resources

A Price-Based Approach for Controlling Networked Distributed Energy Resources A Price-Based Approach for Controlling Networked Distributed Energy Resources Alejandro D. Domínguez-García (joint work with Bahman Gharesifard and Tamer Başar) Coordinated Science Laboratory Department

More information

Algorithmic Game Theory. Alexander Skopalik

Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory Alexander Skopalik Today Course Mechanics & Overview Introduction into game theory and some examples Chapter 1: Selfish routing Alexander Skopalik Skopalik@mail.uni-paderborn.de

More information

On the errors introduced by the naive Bayes independence assumption

On the errors introduced by the naive Bayes independence assumption On the errors introduced by the naive Bayes independence assumption Author Matthijs de Wachter 3671100 Utrecht University Master Thesis Artificial Intelligence Supervisor Dr. Silja Renooij Department of

More information

Self-stabilizing uncoupled dynamics

Self-stabilizing uncoupled dynamics Self-stabilizing uncoupled dynamics Aaron D. Jaggard 1, Neil Lutz 2, Michael Schapira 3, and Rebecca N. Wright 4 1 U.S. Naval Research Laboratory, Washington, DC 20375, USA. aaron.jaggard@nrl.navy.mil

More information

OSNR Optimization in Optical Networks: Extension for Capacity Constraints

OSNR Optimization in Optical Networks: Extension for Capacity Constraints 5 American Control Conference June 8-5. Portland OR USA ThB3.6 OSNR Optimization in Optical Networks: Extension for Capacity Constraints Yan Pan and Lacra Pavel Abstract This paper builds on the OSNR model

More information

Cheap talk theoretic tools for distributed sensing in the presence of strategic sensors

Cheap talk theoretic tools for distributed sensing in the presence of strategic sensors 1 / 37 Cheap talk theoretic tools for distributed sensing in the presence of strategic sensors Cédric Langbort Department of Aerospace Engineering & Coordinated Science Laboratory UNIVERSITY OF ILLINOIS

More information

Securing Infrastructure Facilities: When Does Proactive Defense Help?

Securing Infrastructure Facilities: When Does Proactive Defense Help? Securing Infrastructure Facilities: When Does Proactive Defense Help? The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As

More information

arxiv: v1 [cs.ai] 22 Feb 2018

arxiv: v1 [cs.ai] 22 Feb 2018 Reliable Intersection Control in Non-cooperative Environments* Muhammed O. Sayin 1,2, Chung-Wei Lin 2, Shinichi Shiraishi 2, and Tamer Başar 1 arxiv:1802.08138v1 [cs.ai] 22 Feb 2018 Abstract We propose

More information

Algebraic Equations for Blocking Probabilities in Asymmetric Networks

Algebraic Equations for Blocking Probabilities in Asymmetric Networks Algebraic Equations for Blocking Probabilities in Asymmetric Networks Ian Dinwoodie, Emily Gamundi and Ed Mosteig Technical Report #2004-15 April 6, 2004 This material was based upon work supported by

More information

4: Dynamic games. Concordia February 6, 2017

4: Dynamic games. Concordia February 6, 2017 INSE6441 Jia Yuan Yu 4: Dynamic games Concordia February 6, 2017 We introduce dynamic game with non-simultaneous moves. Example 0.1 (Ultimatum game). Divide class into two groups at random: Proposers,

More information

Defending against Internet worms using a phase space method from chaos theory

Defending against Internet worms using a phase space method from chaos theory Defending against Internet worms using a phase space method from chaos theory Jing Hu and Jianbo Gao Department of Electrical & Computer Engineering University of Florida Nageswara S. Rao Computer Science

More information

Deceptive Advertising with Rational Buyers

Deceptive Advertising with Rational Buyers Deceptive Advertising with Rational Buyers September 6, 016 ONLINE APPENDIX In this Appendix we present in full additional results and extensions which are only mentioned in the paper. In the exposition

More information

On the Informed Principal Model with Common Values

On the Informed Principal Model with Common Values On the Informed Principal Model with Common Values Anastasios Dosis ESSEC Business School and THEMA École Polytechnique/CREST, 3/10/2018 Anastasios Dosis (ESSEC and THEMA) Informed Principal with Common

More information

1 Undirected Graphical Models. 2 Markov Random Fields (MRFs)

1 Undirected Graphical Models. 2 Markov Random Fields (MRFs) Machine Learning (ML, F16) Lecture#07 (Thursday Nov. 3rd) Lecturer: Byron Boots Undirected Graphical Models 1 Undirected Graphical Models In the previous lecture, we discussed directed graphical models.

More information

Electric Power Network Response to Random Demand Variations: A large deviations view on voltage collapse phenomena

Electric Power Network Response to Random Demand Variations: A large deviations view on voltage collapse phenomena Electric Power Network Response to Random Demand Variations: A large deviations view on voltage collapse phenomena Christopher DeMarco Electrical and Computer Engineering University of Wisconsin-Madison

More information

THEORY OF OLIGOPOLIES: DYNAMICS AND STABILITY OF EQUILIBRIA

THEORY OF OLIGOPOLIES: DYNAMICS AND STABILITY OF EQUILIBRIA ROMAI J., 4, (2008), 47 60 THEORY OF OLIGOPOLIES: DYNAMICS AND STABILITY OF EQUILIBRIA Konstantinos Andriopoulos, Tassos Bountis, Nikos Papadopoulos Centre for Research and Applications of Nonlinear Systems

More information

Dynamic Games with Asymmetric Information: Common Information Based Perfect Bayesian Equilibria and Sequential Decomposition

Dynamic Games with Asymmetric Information: Common Information Based Perfect Bayesian Equilibria and Sequential Decomposition Dynamic Games with Asymmetric Information: Common Information Based Perfect Bayesian Equilibria and Sequential Decomposition 1 arxiv:1510.07001v1 [cs.gt] 23 Oct 2015 Yi Ouyang, Hamidreza Tavafoghi and

More information

Vasilis Syrgkanis Microsoft Research NYC

Vasilis Syrgkanis Microsoft Research NYC Vasilis Syrgkanis Microsoft Research NYC 1 Large Scale Decentralized-Distributed Systems Multitude of Diverse Users with Different Objectives Large Scale Decentralized-Distributed Systems Multitude of

More information

Monopoly Regulation in the Presence of Consumer Demand-Reduction

Monopoly Regulation in the Presence of Consumer Demand-Reduction Monopoly Regulation in the Presence of Consumer Demand-Reduction Susumu Sato July 9, 2018 I study a monopoly regulation in the setting where consumers can engage in demand-reducing investments. I first

More information

Bargaining, Contracts, and Theories of the Firm. Dr. Margaret Meyer Nuffield College

Bargaining, Contracts, and Theories of the Firm. Dr. Margaret Meyer Nuffield College Bargaining, Contracts, and Theories of the Firm Dr. Margaret Meyer Nuffield College 2015 Course Overview 1. Bargaining 2. Hidden information and self-selection Optimal contracting with hidden information

More information

Discrete Random Variable

Discrete Random Variable Discrete Random Variable Outcome of a random experiment need not to be a number. We are generally interested in some measurement or numerical attribute of the outcome, rather than the outcome itself. n

More information

Cyber-Awareness and Games of Incomplete Information

Cyber-Awareness and Games of Incomplete Information Cyber-Awareness and Games of Incomplete Information Jeff S Shamma Georgia Institute of Technology ARO/MURI Annual Review August 23 24, 2010 Preview Game theoretic modeling formalisms Main issue: Information

More information

The effect of learning on membership and welfare in an International Environmental Agreement

The effect of learning on membership and welfare in an International Environmental Agreement The effect of learning on membership and welfare in an International Environmental Agreement Larry Karp University of California, Berkeley Department of Agricultural and Resource Economics karp@are.berkeley.edu

More information

Introduction to Game Theory

Introduction to Game Theory COMP323 Introduction to Computational Game Theory Introduction to Game Theory Paul G. Spirakis Department of Computer Science University of Liverpool Paul G. Spirakis (U. Liverpool) Introduction to Game

More information

Rational Proofs against Rational Verifiers

Rational Proofs against Rational Verifiers Rational Proofs against Rational Verifiers Keita Inasawa Kenji Yasunaga March 24, 2017 Abstract Rational proofs, introduced by Azar and Micali (STOC 2012), are a variant of interactive proofs in which

More information

Computational Evolutionary Game Theory and why I m never using PowerPoint for another presentation involving maths ever again

Computational Evolutionary Game Theory and why I m never using PowerPoint for another presentation involving maths ever again Computational Evolutionary Game Theory and why I m never using PowerPoint for another presentation involving maths ever again Enoch Lau 5 September 2007 Outline What is evolutionary game theory? Why evolutionary

More information

Selecting Efficient Correlated Equilibria Through Distributed Learning. Jason R. Marden

Selecting Efficient Correlated Equilibria Through Distributed Learning. Jason R. Marden 1 Selecting Efficient Correlated Equilibria Through Distributed Learning Jason R. Marden Abstract A learning rule is completely uncoupled if each player s behavior is conditioned only on his own realized

More information

Cyber Security Games with Asymmetric Information

Cyber Security Games with Asymmetric Information Cyber Security Games with Asymmetric Information Jeff S. Shamma Georgia Institute of Technology Joint work with Georgios Kotsalis & Malachi Jones ARO MURI Annual Review November 15, 2012 Research Thrust:

More information

Algebra II. Key Resources: Page 3

Algebra II. Key Resources: Page 3 Algebra II Course This course includes the study of a variety of functions (linear, quadratic higher order polynomials, exponential, absolute value, logarithmic and rational) learning to graph, compare,

More information

3.3.3 Illustration: Infinitely repeated Cournot duopoly.

3.3.3 Illustration: Infinitely repeated Cournot duopoly. will begin next period less effective in deterring a deviation this period. Nonetheless, players can do better than just repeat the Nash equilibrium of the constituent game. 3.3.3 Illustration: Infinitely

More information

6 Evolution of Networks

6 Evolution of Networks last revised: March 2008 WARNING for Soc 376 students: This draft adopts the demography convention for transition matrices (i.e., transitions from column to row). 6 Evolution of Networks 6. Strategic network

More information

Balancing Terrorism and Natural Disasters Defensive Strategy with Endogenous Attacker Effort

Balancing Terrorism and Natural Disasters Defensive Strategy with Endogenous Attacker Effort OPERATIONS RESEARCH Vol. 55, No. 5, September October 27, pp. 976 99 issn 3-364X eissn 526-5463 7 555 976 informs doi.287/opre.7.434 27 INFORMS Balancing Terrorism and Natural Disasters Defensive Strategy

More information

Controlo Switched Systems: Mixing Logic with Differential Equations. João P. Hespanha. University of California at Santa Barbara.

Controlo Switched Systems: Mixing Logic with Differential Equations. João P. Hespanha. University of California at Santa Barbara. Controlo 00 5 th Portuguese Conference on Automatic Control University of Aveiro,, September 5-7, 5 00 Switched Systems: Mixing Logic with Differential Equations João P. Hespanha University of California

More information

Information Theory Meets Game Theory on The Interference Channel

Information Theory Meets Game Theory on The Interference Channel Information Theory Meets Game Theory on The Interference Channel Randall A. Berry Dept. of EECS Northwestern University e-mail: rberry@eecs.northwestern.edu David N. C. Tse Wireless Foundations University

More information

1. The General Linear-Quadratic Framework

1. The General Linear-Quadratic Framework ECO 37 Economics of Uncertainty Fall Term 009 Notes for lectures Incentives for Effort - Multi-Dimensional Cases Here we consider moral hazard problems in the principal-agent framewor, restricting the

More information

Module 8: Multi-Agent Models of Moral Hazard

Module 8: Multi-Agent Models of Moral Hazard Module 8: Multi-Agent Models of Moral Hazard Information Economics (Ec 515) George Georgiadis Types of models: 1. No relation among agents. an many agents make contracting easier? 2. Agents shocks are

More information

Convergence Rate of Best Response Dynamics in Scheduling Games with Conflicting Congestion Effects

Convergence Rate of Best Response Dynamics in Scheduling Games with Conflicting Congestion Effects Convergence Rate of est Response Dynamics in Scheduling Games with Conflicting Congestion Effects Michal Feldman Tami Tamir Abstract We study resource allocation games with conflicting congestion effects.

More information

UNIVERSITY OF CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Secondary Education

UNIVERSITY OF CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Secondary Education UNIVERSITY OF CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Secondary Education ADDITIONAL MATHEMATICS 0606/02 Paper 2 Examination from 2013 SPECIMEN PAPER 2 hours Candidates

More information

The effect of learning on membership and welfare in an International Environmental Agreement

The effect of learning on membership and welfare in an International Environmental Agreement Climatic Change (202) 0:499 505 DOI 0007/s0584-0-034-5 The effect of learning on membership and welfare in an International Environmental Agreement Larry Karp Received: 7 March 200 / Accepted: 20 April

More information

The price of anarchy of finite congestion games

The price of anarchy of finite congestion games The price of anarchy of finite congestion games George Christodoulou Elias Koutsoupias Abstract We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions.

More information

Bertrand Model of Price Competition. Advanced Microeconomic Theory 1

Bertrand Model of Price Competition. Advanced Microeconomic Theory 1 Bertrand Model of Price Competition Advanced Microeconomic Theory 1 ҧ Bertrand Model of Price Competition Consider: An industry with two firms, 1 and 2, selling a homogeneous product Firms face market

More information

Q-Learning in Continuous State Action Spaces

Q-Learning in Continuous State Action Spaces Q-Learning in Continuous State Action Spaces Alex Irpan alexirpan@berkeley.edu December 5, 2015 Contents 1 Introduction 1 2 Background 1 3 Q-Learning 2 4 Q-Learning In Continuous Spaces 4 5 Experimental

More information

Combinatorial Agency

Combinatorial Agency Combinatorial Agency Moshe Babaioff, Michal Feldman, and Noam Nisan Abstract Much recent research concerns systems, such as the Internet, whose components are owned and operated by different parties, each

More information

A Game-Theoretical Approach for Finding Optimal Strategies in an Intruder Classification Game

A Game-Theoretical Approach for Finding Optimal Strategies in an Intruder Classification Game A Game-Theoretical Approach for Finding Optimal Strategies in an Intruder Classification Game Lemonia Dritsoula, Patrick Loiseau, and John Musacchio Abstract We consider a game in which a strategic defender

More information

Cournot and Bertrand Competition in a Differentiated Duopoly with Endogenous Technology Adoption *

Cournot and Bertrand Competition in a Differentiated Duopoly with Endogenous Technology Adoption * ANNALS OF ECONOMICS AND FINANCE 16-1, 231 253 (2015) Cournot and Bertrand Competition in a Differentiated Duopoly with Endogenous Technology Adoption * Hongkun Ma School of Economics, Shandong University,

More information

Solving Polynomial and Rational Inequalities Algebraically. Approximating Solutions to Inequalities Graphically

Solving Polynomial and Rational Inequalities Algebraically. Approximating Solutions to Inequalities Graphically 10 Inequalities Concepts: Equivalent Inequalities Solving Polynomial and Rational Inequalities Algebraically Approximating Solutions to Inequalities Graphically (Section 4.6) 10.1 Equivalent Inequalities

More information

: Cryptography and Game Theory Ran Canetti and Alon Rosen. Lecture 8

: Cryptography and Game Theory Ran Canetti and Alon Rosen. Lecture 8 0368.4170: Cryptography and Game Theory Ran Canetti and Alon Rosen Lecture 8 December 9, 2009 Scribe: Naama Ben-Aroya Last Week 2 player zero-sum games (min-max) Mixed NE (existence, complexity) ɛ-ne Correlated

More information

A Framework for Modeling and Optimizing Dynamic Systems Under Uncertainty

A Framework for Modeling and Optimizing Dynamic Systems Under Uncertainty A Framework for Modeling and Optimizing Dynamic Systems Under Uncertainty Bethany Nicholson John D. Siirola Center for Computing Research Sandia National Laboratories Albuquerque, NM USA FOCAPO January

More information

Modeling disruption and dynamic response of water networks. Sifat Ferdousi August 19, 2016

Modeling disruption and dynamic response of water networks. Sifat Ferdousi August 19, 2016 Modeling disruption and dynamic response of water networks Sifat Ferdousi August 19, 2016 Threat to water networks The main threats to water infrastructure systems can be classified in three different

More information

Equilibria for games with asymmetric information: from guesswork to systematic evaluation

Equilibria for games with asymmetric information: from guesswork to systematic evaluation Equilibria for games with asymmetric information: from guesswork to systematic evaluation Achilleas Anastasopoulos anastas@umich.edu EECS Department University of Michigan February 11, 2016 Joint work

More information

Consensus building: How to persuade a group

Consensus building: How to persuade a group Consensus building: How to persuade a group Bernard Caillaud and Jean Tirole May 7, 007 Additional materials Proof of Lemma C1 Referring to Appendix C and using feasibility constraints, note that a mechanism

More information

Planning and Model Selection in Data Driven Markov models

Planning and Model Selection in Data Driven Markov models Planning and Model Selection in Data Driven Markov models Shie Mannor Department of Electrical Engineering Technion Joint work with many people along the way: Dotan Di-Castro (Yahoo!), Assaf Halak (Technion),

More information

A Game Theoretic Investigation of Deception in Network Security

A Game Theoretic Investigation of Deception in Network Security A Game Theoretic Investigation of Deception in Network Security Thomas E. Carroll Pacific Northwest National Laboratory 902 Battelle Boulevard P.O. Box 999, MSIN J4-45 Richland, WA 99352 USA Email: Thomas.Carroll@pnl.gov

More information

Role of Synchronized Measurements In Operation of Smart Grids

Role of Synchronized Measurements In Operation of Smart Grids Role of Synchronized Measurements In Operation of Smart Grids Ali Abur Electrical and Computer Engineering Department Northeastern University Boston, Massachusetts Boston University CISE Seminar November

More information

A Game-Theoretical Approach for Finding Optimal Strategies in an Intruder Classification Game

A Game-Theoretical Approach for Finding Optimal Strategies in an Intruder Classification Game A Game-Theoretical Approach for Finding Optimal Strategies in an Intruder Classification Game Lemonia Dritsoula, Patrick Loiseau, and John Musacchio Abstract We consider a game in which a strategiefender

More information

Catastrophe and Stability Analysis of a Cable-Driven Actuator

Catastrophe and Stability Analysis of a Cable-Driven Actuator Catastrophe and Stability Analysis of a Cable-Driven Actuator James S. Sulzer, Michael A. Peshkin and James L. Patton Abstract Recent work in human-robot interaction has revealed the need for compliant,

More information

ECE 541 Project Report: Modeling the Game of RISK Using Markov Chains

ECE 541 Project Report: Modeling the Game of RISK Using Markov Chains Contents ECE 541 Project Report: Modeling the Game of RISK Using Markov Chains Stochastic Signals and Systems Rutgers University, Fall 2014 Sijie Xiong, RUID: 151004243 Email: sx37@rutgers.edu 1 The Game

More information

April 29, 2010 CHAPTER 13: EVOLUTIONARY EQUILIBRIUM

April 29, 2010 CHAPTER 13: EVOLUTIONARY EQUILIBRIUM April 29, 200 CHAPTER : EVOLUTIONARY EQUILIBRIUM Some concepts from biology have been applied to game theory to define a type of equilibrium of a population that is robust against invasion by another type

More information

MS&E 246: Lecture 18 Network routing. Ramesh Johari

MS&E 246: Lecture 18 Network routing. Ramesh Johari MS&E 246: Lecture 18 Network routing Ramesh Johari Network routing Last lecture: a model where N is finite Now: assume N is very large Formally: Represent the set of users as a continuous interval, [0,

More information

22 : Hilbert Space Embeddings of Distributions

22 : Hilbert Space Embeddings of Distributions 10-708: Probabilistic Graphical Models 10-708, Spring 2014 22 : Hilbert Space Embeddings of Distributions Lecturer: Eric P. Xing Scribes: Sujay Kumar Jauhar and Zhiguang Huo 1 Introduction and Motivation

More information

Resilient Control of Cyber-Physical Systems against Denial-of-Service Attacks

Resilient Control of Cyber-Physical Systems against Denial-of-Service Attacks Resilient Control of Cyber-Physical Systems against Denial-of-Service Attacks Yuan Yuan, Quanyan Zhu, Fuchun Sun, Qinyi Wang and Tamer Başar Abstract The integration of control systems with modern information

More information

A Network Security Classification Game

A Network Security Classification Game A Network Security Classification Game Ning Bao, O. Patrick Kreidl 2, and John Musacchio University of California Santa Cruz, Santa Cruz, CA 9564, USA, {nbao,johnm}@soe.ucsc.edu 2 BAE Systems Technology

More information

Estimation of Robustness of Interdependent Networks against Failure of Nodes

Estimation of Robustness of Interdependent Networks against Failure of Nodes Estimation of Robustness of Interdependent Networks against Failure of Nodes Srinjoy Chattopadhyay and Huaiyu Dai Department of Electrical and Computer Engineering, North Carolina State University. Email:

More information

Cyber Physical Power Systems Power in Communications

Cyber Physical Power Systems Power in Communications 1 Cyber Physical Power Systems Power in Communications Information and Communications Tech. Power Supply 2 ICT systems represent a noticeable (about 5 % of total t demand d in U.S.) fast increasing load.

More information

Algebra 2 College Prep Curriculum Maps

Algebra 2 College Prep Curriculum Maps Algebra 2 College Prep Curriculum Maps Unit 1: Polynomial, Rational, and Radical Relationships Unit 2: Modeling With Functions Unit 3: Inferences and Conclusions from Data Unit 4: Trigonometric Functions

More information

Gibbs Fields & Markov Random Fields

Gibbs Fields & Markov Random Fields Statistical Techniques in Robotics (16-831, F10) Lecture#7 (Tuesday September 21) Gibbs Fields & Markov Random Fields Lecturer: Drew Bagnell Scribe: Bradford Neuman 1 1 Gibbs Fields Like a Bayes Net, a

More information

Benchmarking of Hydrodynamic Models for Development of a Coupled Storm Surge Hazard-Infrastructure Modeling Method to improve Inundation Forecasting

Benchmarking of Hydrodynamic Models for Development of a Coupled Storm Surge Hazard-Infrastructure Modeling Method to improve Inundation Forecasting Benchmarking of Hydrodynamic Models for Development of a Coupled Storm Surge Hazard-Infrastructure Modeling Method to improve Inundation Forecasting Abstract Fragility-based models currently used in coastal

More information

Autonomous Demand Response in Heterogeneous Smart Grid Topologies

Autonomous Demand Response in Heterogeneous Smart Grid Topologies 1 Autonomous Demand Response in Heterogeneous Smart Grid Topologies Hamed Narimani and Hamed Mohsenian-Rad Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan,

More information

1. The General Linear-Quadratic Framework

1. The General Linear-Quadratic Framework ECO 317 Economics of Uncertainty Fall Term 2009 Slides to accompany 21. Incentives for Effort - Multi-Dimensional Cases 1. The General Linear-Quadratic Framework Notation: x = (x j ), n-vector of agent

More information

Lecture notes for Analysis of Algorithms : Markov decision processes

Lecture notes for Analysis of Algorithms : Markov decision processes Lecture notes for Analysis of Algorithms : Markov decision processes Lecturer: Thomas Dueholm Hansen June 6, 013 Abstract We give an introduction to infinite-horizon Markov decision processes (MDPs) with

More information

Achieving Pareto Optimality Through Distributed Learning

Achieving Pareto Optimality Through Distributed Learning 1 Achieving Pareto Optimality Through Distributed Learning Jason R. Marden, H. Peyton Young, and Lucy Y. Pao Abstract We propose a simple payoff-based learning rule that is completely decentralized, and

More information

Cyclic Equilibria in Markov Games

Cyclic Equilibria in Markov Games Cyclic Equilibria in Markov Games Martin Zinkevich and Amy Greenwald Department of Computer Science Brown University Providence, RI 02912 {maz,amy}@cs.brown.edu Michael L. Littman Department of Computer

More information

On the Convexity of Discrete (r, Q) and (s, T ) Inventory Systems

On the Convexity of Discrete (r, Q) and (s, T ) Inventory Systems On the Convexity of Discrete r, Q and s, T Inventory Systems Jing-Sheng Song Mingzheng Wang Hanqin Zhang The Fuqua School of Business, Duke University, Durham, NC 27708, USA Dalian University of Technology,

More information

Achieving Pareto Optimality Through Distributed Learning

Achieving Pareto Optimality Through Distributed Learning 1 Achieving Pareto Optimality Through Distributed Learning Jason R. Marden, H. Peyton Young, and Lucy Y. Pao Abstract We propose a simple payoff-based learning rule that is completely decentralized, and

More information

A note on network reliability

A note on network reliability A note on network reliability Noga Alon Institute for Advanced Study, Princeton, NJ 08540 and Department of Mathematics Tel Aviv University, Tel Aviv, Israel Let G = (V, E) be a loopless undirected multigraph,

More information

Population Games and Evolutionary Dynamics

Population Games and Evolutionary Dynamics Population Games and Evolutionary Dynamics (MIT Press, 200x; draft posted on my website) 1. Population games 2. Revision protocols and evolutionary dynamics 3. Potential games and their applications 4.

More information

Preliminary Results on Social Learning with Partial Observations

Preliminary Results on Social Learning with Partial Observations Preliminary Results on Social Learning with Partial Observations Ilan Lobel, Daron Acemoglu, Munther Dahleh and Asuman Ozdaglar ABSTRACT We study a model of social learning with partial observations from

More information

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program May 2012

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program May 2012 Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program May 2012 The time limit for this exam is 4 hours. It has four sections. Each section includes two questions. You are

More information

Abstract. Three Methods and Their Limitations. N-1 Experiments Suffice to Determine the Causal Relations Among N Variables

Abstract. Three Methods and Their Limitations. N-1 Experiments Suffice to Determine the Causal Relations Among N Variables N-1 Experiments Suffice to Determine the Causal Relations Among N Variables Frederick Eberhardt Clark Glymour 1 Richard Scheines Carnegie Mellon University Abstract By combining experimental interventions

More information

Quantitative Reliability Analysis

Quantitative Reliability Analysis Quantitative Reliability Analysis Moosung Jae May 4, 2015 System Reliability Analysis System reliability analysis is conducted in terms of probabilities The probabilities of events can be modelled as logical

More information

6196 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 9, SEPTEMBER 2011

6196 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 9, SEPTEMBER 2011 6196 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 9, SEPTEMBER 2011 On the Structure of Real-Time Encoding and Decoding Functions in a Multiterminal Communication System Ashutosh Nayyar, Student

More information

Switched Systems: Mixing Logic with Differential Equations

Switched Systems: Mixing Logic with Differential Equations research supported by NSF Switched Systems: Mixing Logic with Differential Equations João P. Hespanha Center for Control Dynamical Systems and Computation Outline Logic-based switched systems framework

More information