Uncertainty Regarding Interpretation of the `Negligence Rule' and Its Implications for the Efficiency of Outcomes

Size: px
Start display at page:

Download "Uncertainty Regarding Interpretation of the `Negligence Rule' and Its Implications for the Efficiency of Outcomes"

Transcription

1 Jawaharlal Nehru University From the SelectedWorks of Satish K. Jain 2011 Uncertainty Regarding Interpretation of the `Negligence Rule' and Its Implications for the Efficiency of Outcomes Satish K. Jain, Jawaharlal Nehru University Available at:

2 Uncertainty Regarding Interpretation of the Negligence Rule and Its Implications for the Efficiency of Outcomes Satish K. Jain Abstract There are two ways that the negligence rule is interpreted. Under one interpretation a negligent injurer is liable for the entire harm to the victim; and under the other interpretation a negligent injurer is liable only for that part of the harm which can be ascribed to his negligence. Both these versions are efficient. However, if there is uncertainty regarding whether the court will be employing the full liability version or the incremental liability version for determining the liability of a negligent injurer, notwithstanding the fact that both the versions are efficient, inefficiency is possible. In the paper necessary and sufficient conditions for efficiency are derived when there is uncertainty regarding the interpretation of the negligence rule. Keywords: Negligence Rule; Full Liability; Incremental Liability; Standard Version; Incremental Version; Uncertainty Regarding Interpretation of Negligence Rule; Necessary and Sufficient Conditions for Efficiency. JEL Classification: K13 1 Introduction The negligence rule, one of the most important of liability rules, is usually interpreted to mean that the injurer is liable for the entire harm to the victim in case he is negligent; Centre for Economic Studies and Planning, School of Social Sciences, Jawaharlal Nehru University, New Delhi skjain@mail.jnu.ac.in, satishkumarjain@gmail.com 1

3 and he is not at all liable in case he is nonnegligent. There is, however, another way that the negligence rule can be interpreted. Under this interpretation, the injurer, if negligent, is liable for only that part of the harm which can be attributed to his negligence; and as before he is not at all liable if he is nonnegligent. We will use the expressions the standard version and the incremental version respectively for these two ways of defining the negligence rule. Both these versions of the negligence rule are efficient. The efficiency of the standard version was established by Brown (1973). The incremental version has been shown to be efficient for the unilateral care case in Kahan (1989); and for the bilateral care case in Jain (2010). In view of the efficiency of both the versions it follows that from the efficiency perspective it does not really matter which version is used by the courts as long as both the parties have the information as to which version will be used. 1 If courts use one version sometimes and the other version at other times and the parties do not know in advance as to which version will be used in the present instance then notwithstanding the fact that both the versions are efficient it is not at all clear that the outcome will necessarily be efficient. We present an example in this paper where the outcome arrived at is inefficient on account of uncertainty regarding interpretation of the negligence rule. Given that there is uncertainty as to which version of the rule will be used by the courts the two parties must estimate the probabilities with which the two versions could be expected. Let α denote the probability with which the victim expects the standard version to be employed; and let β denote the probability with which the injurer expects the standard version to be employed (Therefore, the victim expects the incremental version to be employed with probability (1 α); and the injurer expects the incremental version to be employed with probability (1 β)). It turns out that, when there is uncertainty regarding interpretation of the negligence rule, a necessary and sufficient condition for efficiency to obtain regardless of the nature of harmful interaction between the two parties is that β be at least as large as α (Theorem 1). That is to say, if β is greater than or equal to α then regardless of which application of the negligence rule obtains the outcome will be efficient; and if β is less than α then efficiency does not obtain for some applications of the negligence rule. For the injurer the incremental version of the rule is clearly better than the standard version; and for the victim it is the other way around. If both parties form their beliefs on the basis of more or less the same information (e.g., the history of the use of the negligence rule by the courts), and if both parties are conservative 1 For illuminating discussions of a large number of court cases, involving both the standard and incremental interpretations, see Landes and Posner (1987) and Grady (1983, 1984). See also Kahan (1989) and the cases cited therein. 2

4 in assessing probabilities, pessimistic in other words, then one would on the whole expect β to be at least as large as α. A careful analysis of the example showing that inefficiency is possible if there is uncertainty regarding the interpretation of the negligence rule shows that the main reason for the failure of efficiency to obtain lies in the complementarity of the cares of the two parties. The natural question that arises then is whether one can always be sure of obtaining efficiency if complementarities in cares are ruled out. It turns out that if complementarities in cares are ruled out then a necessary and sufficient condition for obtaining of efficiency is that β be positive or α be zero (Theorem 2). As long as β is greater than 0 we are assured of efficiency regardless of the value of α. If, however, β is 0 then it is possible that inefficiency might obtain. If both β and α are zero then of course by Theorem 1 we know that inefficiency is impossible; so we must have both β = 0 and α to be greater than 0 for inefficiency to materialize. As the condition is necessary as well, if β = 0 and α > 0 then one can always find an application without complementarities in the cares of the two parties under which efficiency does not obtain. Thus, the assumption of absence of complementarities in the cares of the two parties, although ensuring efficiency in almost all cases, does not completely rule out inefficiency. If in addition to assuming absence of complementarities in the cares of the two parties, it is also assumed that the total social costs are minimized at only one care-configuration, i.e., the minimum is unique, then it turns out that efficiency will obtain regardless of the values of α and β (Theorem 3). In the law and economics literature, in the context of analysis of the efficiency of liability rules, it is generally assumed that there are no complementarities in the cares of the two parties as well as that the care-configuration at which total social costs are minimized is unique. 2 Thus, it follows that under the standard assumptions efficiency will obtain regardless of the subjective probabilities of the two parties. This, indeed, is quite remarkable. Even when the two parties do not which of the two versions is going be used in their case, under the standard assumptions we can be sure that there will be no inefficiency. The paper is divided into four sections, including this introductory section. The second section contains the definitions and assumptions, and spells out the framework of analysis. The third section contains an example which shows that when there is uncertainty regarding as to whether the court will interpret the negligence rule to imply full liability on the part of a negligent injurer or merely the incremental liability inefficiency is possible. The last section discusses the conditions under which the efficiency obtains 2 See Brown (1973), Landes and Posner (1987), and Shavell (1987), among others. 3

5 even when there is uncertainty regarding the interpretation of the negligence rule. All proofs are relegated to the Appendix at the end of the paper. 2 Definitions and Assumptions We consider accidents resulting from interaction of two parties, assumed to be strangers to each other, in which, to begin with, the entire loss falls on one party to be called the victim (plaintiff). The other party would be referred to as the injurer (defendant). At times, the victim would be referred to as individual or party 1 and the injurer individual or party 2. We denote by c 0 the cost of care taken by the victim and by d 0 the cost of care taken by the injurer. Costs of care would be assumed to be strictly increasing functions of indices of care, i.e., care levels; consequently, costs of care themselves can be taken to be indices of care. Let C = {c c is the cost of some feasible level of care which can be taken by the victim} and D = {d d is the cost of some feasible level of care which can be taken by the injurer}. We will identify c = 0 with victim taking no care; and d = 0 with injurer taking no care. We assume: 0 C 0 D. (A1) Assumption (A1) merely says that, for each party, taking no care is always a feasible option. Let π denote the probability of occurrence of accident and H 0 the loss in case of occurrence of accident. Both π and H will be assumed to be functions of c and d; π = π(c, d), H = H(c, d). Let L = πh. L is thus expected loss due to accident. We assume: ( c, c C)( d, d D)[[c > c L(c, d) L(c, d)] [d > d L(c, d) L(c, d )]]. (A2) That is to say: a larger expenditure on care by either party, given the expenditure on care by the other party, does not result in greater expected accident loss. Total social costs (T SC) are defined to be the sum of cost of care by the victim, cost of care by the injurer, and expected loss due to accident; T SC = c + d + L(c, d). Let M = {(c, d ) C D c +d +L(c, d ) is minimum of {c+d+l(c, d) c C d D}}. Thus M is the set of all costs of care configurations (c, d ) which are total social cost minimizing. It will be assumed that: 4

6 C, D and L are such that M is nonempty. (A3) The notion of negligence will be defined as shortfall from a specified level called due care. Let d denote the due care for the injurer. It will be assumed that: ( c C)[(c, d ) M]. That is to say, due care for the injurer is chosen appropriately from the perspective of minimization of total social costs. The injurer is called negligent at (c, d) iff his care level d is less than d ; and nonnegligent iff d is greater than or equal to d. There are two versions of negligence rule which are used in practice. The standard (s) version of negligence rule is defined by: (a) The injurer is liable for the entire loss iff he is negligent; and (b) The injurer is not at all liable iff he is nonnegligent. The incremental (i) version of negligence rule is defined by: (a) The injurer is liable for the loss which can be ascribed to his negligence iff he is negligent; and (b) The injurer is not at all liable iff he is nonnegligent. Let ˆL 2 (c, d) denote expected loss which can be ascribed to injurer s negligence at (c, d). We define ˆL 2 (c, d) as follows: ˆL 2 (c, d) = L(c, d) L(c, d ) if d < d = 0 if d d. Let EC 1 (c, d) and EC 2 (c, d) denote expected costs of the victim and the injurer respectively. Then, under the standard negligence rule the expected costs are given by: EC 1 (c, d) = c EC 2 (c, d) = d + L(c, d) if d < d EC 1 (c, d) = c + L(c, d) EC 2 (c, d) = d if d d. Under the incremental negligence rule the expected costs are given by: EC 1 (c, d) = c + L(c, d ) EC 2 (c, d) = d + L(c, d) L(c, d ) if d < d EC 1 (c, d) = c + L(c, d) EC 2 (c, d) = d if d d. Both parties are assumed to prefer smaller expected costs to larger expected costs and be indifferent between alternatives with equal expected costs. An application of negligence rule, standard or incremental, consists of specification of C, D, π, H and d satisfying (A1)-(A3), where d is such that ( c C)[(c, d ) M]. The set of all applications will be denoted by A. Negligence rule, standard or incremental, is defined to be efficient for a given application belonging to A iff ( (c, d) C D)[(c, d) is a Nash equilibrium (c, d) M] 5

7 and ( (c, d) C D)[(c, d) is a Nash equilibrium]. In other words, negligence rule is efficient for a given application iff (i) every (c, d) C D which is a Nash equilibrium is total social cost minimizing, and (ii) there exists at least one (c, d) C D which is a Nash equilibrium. Negligence rule is defined to be efficient with respect to a class of applications iff it is efficient for every application belonging to that class. We also say that efficiency obtains under a particular a A iff (i) and (ii) hold for a; and that efficiency obtains for a class of applications A A iff efficiency obtains under every application belonging to A. It will be assumed that when courts use negligence rule, they sometimes use the standard version and sometimes the incremental version. The parties do not know in advance which version of the negligence rule will be applied by the court. We assume that the victim expects the standard version with probability α and the incremental version with probability 1 α; and that the injurer expects the standard version with probability β and the incremental version with probability 1 β. 3 An Example Although both versions of the negligence rule are efficient, but if there is uncertainty regarding as to which version of the rule will be applied by the court then there is no guarantee that the outcome will be efficient as the following example shows. Example 1 Let C = D = {0, 1}; and L(c, d), (c, d) C D, be as given in the following array: c d Let α =.9 and β =.1. TSC are uniquely minimized at (1, 1). Let the due care d for the injurer be 1. We obtain (EC 1 (c, d), EC 2 (c, d)), (c, d) C D, as given in the following array: 6

8 c d (0.25, 0.75) (2.50, 1.00) 1 (1.00, 2.50) (1.00, 1.00) (0, 0), which is not TSC-minimizing, is also a Nash equilibrium. Thus efficiency does not obtain under this application. 4 Conditions for Efficiency While from the example considered above it is clear that there are combinations of values of α and β with which efficiency is not guaranteed for every application belonging to A; there do exist combinations of values of α and β with which efficiency obtains under every application belonging to A. In fact, it turns out that, when there is uncertainty regarding interpretation of the negligence rule, a necessary and sufficient condition for obtaining of efficiency under every application belonging to A is that β be greater than or equal to α (Theorem 1). Thus, if β is greater than or equal to α then regardless of which application belonging to A materializes one can be sure that the outcome which will obtain will be efficient. On the other hand, if α is greater than β then there is no guarantee that the outcome will be efficient. There are some applications under which efficiency will obtain even with α > β. But equally there are applications under which efficiency will not obtain if α > β. The proof of the sufficiency part of Theorem 1 is straightforward and is contained in Lemmas 1 and 2. Lemma 1 establishes that the total social costs minimizing configuration involving the due care is a Nash equilibrium; and Lemma 2 establishes that, given β α, all Nash equilibria are total social costs minimizing. The necessity part turns out to be rather complicated; and is established via Lemmas 3-5. Because Lemma 1, which establishes that the TSC-minimizing care-configuration involving the due care is a Nash equilibrium, does not assume anything regarding the values of α and β, it follows that even when α > β (c, d ), where d is the due care for the injurer and c is such that (c, d ) M, is a Nash equilibrium. Thus the inefficiency which is possible when α > β arises not on account of TSC-minimizing care-configuration involving the due care not being a Nash equilibrium but due to some non-tsc-minimizing care-configuration emerging as a Nash equilibrium as well. 7

9 Incremental version of the negligence rule is better for the injurer compared to the standard version; and for the victim it is the other way round. If the liability is going to be determined on the basis of the standard version and if the victim has any reason to believe that the injurer is going to be negligent then the optimal strategy for the victim is to take zero care. On the other hand if the liability is going to be determined on the basis of the incremental version then it is possible, as is the case in Example 1, that given that the victim is taking less than the optimal care the injurer may find the strategy of being negligent to be better than that of being nonnegligent. This is the reason why when α is greater than β it is possible for a care-configuration in which both parties are taking less then the optimal care to emerge as a Nash equilibrium. If both parties are conservative in their expectations, that is to say, have a pessimistic outlook, then, assuming that both the parties form their expectations on the basis of more or less the same objective information, on the whole one can expect the probability with which the injurer would expect the standard version (β) to be at least as large as the probability with which the victim would expect the same to be the case (α). The pessimistic outlook ensures that the injurer s care level is not below the due care and thus eliminating the possibility of non-tsc-minimizing care-configurations emerging as Nash equilibria. The application considered in Example 1 is such that cares of the two parties are complementary. If the injurer increases expenditure on care from 0 to 1 when the victim is taking 0 care then the reduction in expected loss is only.5, but if the victim is spending 1 on care then the same increase by the injurer results in a decrease in expected loss of amount 2.5. As the example is symmetric between the injurer and the victim we have that, if only one party takes care then it is not cost-effective, but if both of them take care then together the cares are. A question which therefore naturally arises is whether inefficiency can be ruled out altogether if complementarities are not there. The answer is a qualified yes. If it is given that β is greater than zero then it can be shown that the absence of complementarities ensures efficiency. The idea of absence of complementarities can be formalized as S-restriction which is defined as follows: An application is S-restricted iff ( c, c C)( d, d D)[[(c > c ) (d > d )] [L(c, d ) L(c, d) L(c, d ) L(c, d)] [L(c, d) L(c, d) L(c, d ) L(c, d )]]. In other words, an application is S-restricted iff it is such that any increase in care from a particular level to a higher level by one party is never more effective with a higher level of care by the other party than with a lower level of care. 8

10 Let the subset of all applications satisfying the S-restriction be denoted by A s. Theorem 2 establishes that if β > 0 then efficiency obtains under every application belonging to A s A regardless of the values of α. If β = 0 then inefficiency is possible for some applications belonging to A s ; α must of course then be greater than 0 in view of Theorem 1. The following example shows inefficiency under an application belonging to A s when β = 0 and α > 0. Example 2 Let C = D = {0, 1}; and L(c, d), (c, d) C D, be as given in the following array: c d Let α = 1 and β = 0. TSC are minimized at (1, 0) and at (1, 1). Let the due care d for the injurer be 1. We obtain (EC 1 (c, d), EC 2 (c, d)), (c, d) C D, as given in the following array: c d (0, 1) (9, 1) 1 (1, 1) (8, 1) (0, 0), which is not TSC-minimizing, is also a Nash equilibrium. Thus efficiency does not obtain under this application. Thus, when β = 0 and α > 0 then efficiency is not guaranteed for every application belonging to A s. In fact, Theorem 2 establishes that given β = 0, for every α > 0 there exists an application for which efficiency does not obtain. In other words, Theorem 2 establishes that a necessary and sufficient condition for obtaining of efficiency under 9

11 every application belonging to A s is that β be positive or α be zero. Thus absence of complementarities rules out inefficiency in almost all cases. The reason why the absence of complementarities ensures efficiency regardless of the values of α and β, as long as β is positive, is as follows: We know that if the victim is taking the optimal care (c = c ) then if the injurer increases his care from a level below the due care (d < d ) to the due care level (d = d ) then the reduction in the expected loss must be at least as large as the increase in care by the injurer. If there are no complementarities then it follows that even if the victim is taking less than the optimal care (c < c ), when the injurer increases his care from a level below the due care level to the due care level the reduction in expected loss must be at least as large as the increase in care. Thus, if there are no complementarities, it can never be advantageous to the injurer to go in for a care level lower than the due care. In case the injurer s care is less than the due care and the victim s care is below the optimal level then the expected loss must be greater than the amount by which the injurer s care falls short of the due care. Consequently, if β is positive then a care-configuration in which the injurer is taking less than the due care and the victim is taking less than the optimal care can never be a Nash equilibrium. The condition that β be positive or α be zero is a very mild condition. Even this condition is not required for efficiency if in addition to ruling out complementarities it is also assumed that there is a unique care-configuration at which total social costs are minimized. Let A m denote the set of applications which are such that there is a unique care-configuration at which total social costs are minimized, i.e., M is a singleton. Then, A s A m is the of applications without complementarities in cares and with a unique TSC-minimizing configuration. Theorem 3 establishes that the efficiency obtains for every application belonging to A s A m regardless of the values of α and β. We have already seen that when there are no complementarities in cares it can never be advantageous for the injurer to take less than the due care. If, TSC are minimized at a unique careconfiguration, then it follows that taking less than the due care will be disadvantageous for the injurer even when β is zero as the uniqueness of the care-configuration coupled with the absence of complementarities implies that regardless of whether the victim is taking the optimal care or less than the optimal care, the lower than the due care by the injurer will result in an increase in expected loss of an amount greater than the amount by which the injurer s care falls short of the due care level. In summary, if there is uncertainty regarding whether the court will apply the standard version or the incremental version then inefficiency is possible. A necessary and sufficient 10

12 condition for efficiency under every application is that β be greater than or equal to α. If complementarities in cares are assumed away then a necessary and sufficient condition for efficiency to obtain under every application without care-complementarities is that β be positive or α be zero. If in addition to assuming that there are no complementarities in cares it is also assumed that TSC are minimized at a unique care-configuration then the efficiency obtains under every application with these characteristics. In the law and economics literature both the absence of complementarities and uniqueness of minimum are generally assumed. Thus under the standard assumptions efficiency obtains notwithstanding uncertainty regarding the interpretation of the negligence rule. References Brown, John Prather (1973), Toward an Economic Theory of Liability, Journal of Legal Studies 2, pp Grady, Mark F. (1983), A New Positive Theory of Negligence, Yale Law Journal 92, pp Grady, Mark F. (1984), Proximate Cause and the Law of Negligence, Iowa Law Review 69, pp Jain, Satish K. (2010), On the Efficiency of the Negligence Rule, Journal of Economic Policy Reform 13, pp Kahan, M. (1989), Causation and Incentives to Take Care under the Negligence Rule, Journal of Legal Studies 18, pp Landes, William M. and Posner, Richard A. (1987), The Economic Structure of Tort Law, Harvard University Press: Cambridge (MA). Shavell, Steven (1987), Economic Analysis of Accident Law, Harvard University Press: Cambridge (MA). Appendix Lemma 1 Let < C, D, π, H, d > be an application belonging to A. Let c be such that (c, d ) M. Then, regardless of the values of α and β, (c, d ) is a Nash equilibrium. Proof: Let < C, D, π, H, d > A; and let (c, d ) M. 11

13 EC 1 (c, d ) = c + L(c, d ) c c EC 1 (c, d ) = c + L(c, d ) Therefore, c c EC 1 (c, d ) EC 1 (c, d ) = [c + L(c, d )] [c + L(c, d )] = [c + d + L(c, d )] [c + d + L(c, d )] = T SC(c, d ) T SC(c, d ) 0 (1.1) EC 2 (c, d ) = d d < d EC 2 (c, d) = d + βl(c, d) + (1 β)[l(c, d) L(c, d )] = d + L(c, d) (1 β)l(c, d ) Therefore: d < d EC 2 (c, d) EC 2 (c, d ) = [d + L(c, d) (1 β)l(c, d )] [d ] = [c + d + L(c, d)] [c + d + L(c, d )] + βl(c, d ) = [T SC(c, d) T SC(c, d )] + βl(c, d ) 0 (1.2) d > d EC 2 (c, d) = d Therefore, d > d EC 2 (c, d) EC 2 (c, d ) = d d > 0 (1.3) (1.1)-(1.3) establish that (c, d ) is a Nash equilibrium. Lemma 2 Let < C, D, π, H, d > be an application belonging to A; and let c be such that (c, d ) M. If β α, then we must have: ( (c, d) C D)[(c, d) is a Nash equilibrium (c, d) M]. Proof: Let < C, D, π, H, d > A. Let c be such that (c, d ) M. Suppose (c, d) is a Nash equilibrium. (c, d) is a Nash equilibrium implies EC 1 (c, d) EC 1 (c, d) (2.1) and EC 2 (c, d) EC 2 (c, d ) (2.2) (2.1) (2.2) EC 1 (c, d) + EC 2 (c, d) EC 1 (c, d) + EC 2 (c, d ) (2.3) 12

14 Now, if d < d we have: EC 1 (c, d) = c + (1 α)l(c, d ); EC 2 (c, d) = d + βl(c, d) + (1 β)[l(c, d) L(c, d )]; EC 1 (c, d) = c + (1 α)l(c, d ); and EC 2 (c, d ) = d. Therefore if d < d, (2.3) reduces to: c + (1 α)l(c, d ) + d + βl(c, d) + (1 β)[l(c, d) L(c, d )] c + (1 α)l(c, d ) + d c + d + L(c, d) c + (1 α)l(c, d ) + d (β α)l(c, d ) c + d + L(c, d) c + d + (1 α)l(c, d ), as (β α) 0 c + d + L(c, d) c + d + L(c, d ), as 0 1 α 1 Therefore, d < d T SC(c, d) T SC(c, d ) (2.4) If d d we have: EC 1 (c, d) = c + L(c, d); EC 2 (c, d) = d; EC 1 (c, d) = c + L(c, d); and EC 2 (c, d ) = d. Therefore, if d d, (2.3) reduces to: c + L(c, d) + d c + L(c, d) + d c + d + L(c, d) c + d + L(c, d ), as L(c, d) L(c, d ), by (A2) Therefore, d d T SC(c, d) T SC(c, d ) (2.5) (2.4) and (2.5) establish that T SC(c, d) T SC(c, d ). As total social costs are minimized at (c, d ), it follows that T SC(c, d) = T SC(c, d ); and consequently we must have (c, d) M. The proposition therefore stands established. Lemma 3 If 1 > α > β > 0, then there exists an application belonging to A under which the efficiency does not obtain. Proof: Let 1 > α > β > 0. Choose positive numbers δ and θ. Let 0 < ɛ 1 < 1 α α β δ; 0 < ɛ 2 < β α β δ. 13

15 Let c 0 = 1 α α β δ + 1 α α θ; d 0 = β α β δ + ɛ 2 + λθ; where 0 < β 1 α 1 β α < λ < 1.3 Now, consider the following application: C = {0, c 0 }; D = {0, d 0 }. L(c, d), (c, d) C D, is as given in the following array: d 0 d 0 c 0 c 0 + d 0 + δ c 0 + d 0 + δ ɛ 2 c 0 c 0 + d 0 + δ ɛ 1 0 As ɛ 1 < c 0 and ɛ 2 < d 0, it follows that (c 0, d 0 ) is the unique TSC-minimizing care-configuration. Let the due care for the injurer d = d 0. We have: EC 1 (0, 0) = (1 α)(c 0 + d 0 + δ ɛ 2 ); EC 2 (0, 0) = β(c 0 + d 0 + δ) + (1 β)ɛ 2 ; EC 1 (c 0, 0) = c 0 ; and EC 2 (0, d 0 ) = d 0. EC 1 (c 0, 0) EC 1 (0, 0) = c 0 (1 α)(c 0 + d 0 + δ ɛ 2 ) = αc 0 (1 α)(d 0 + δ ɛ 2 ) = α[ 1 α α β δ + 1 α α θ] (1 α)[ β α β δ + ɛ 2 + λθ + δ ɛ 2 ] = (1 α)(1 λ)θ > 0. (3.1) EC 2 (0, d 0 ) EC 2 (0, 0) = d 0 β(c 0 + d 0 + δ) (1 β)ɛ 2 = (1 β)d 0 β(c 0 + δ) (1 β)ɛ 2 β = (1 β)[ α β δ + ɛ 2 + λθ] β[ 1 α α β δ + 1 α α θ + δ] (1 β)ɛ 2 = θ[(1 β)λ β 1 α α ] > 0, as λ > β 1 β 1 α α 3 α > β β 1 α 1 β α < 1. > 0. (3.2) 14

16 (3.1) and (3.2) establish that (0,0) is a Nash equilibrium. As (0, 0) / M, it follows that efficiency does not obtain under the application considered here. This establishes the proposition. Lemma 4 If 1 = α > β, then there exists an application belonging to A under which the efficiency does not obtain. Proof: Let 1 = α > β. Choose positive numbers δ, θ, ɛ 2 and c 0. Let 0 < ɛ 1 < c 0 and d 0 = β 1 β (c 0 + δ) + ɛ 2 + θ. Now, consider the following application: C = {0, c 0 }; D = {0, d 0 }. L(c, d), (c, d) C D, is as given in the following array: d 0 d 0 c 0 c 0 + d 0 + δ c 0 + d 0 + δ ɛ 2 c 0 c 0 + d 0 + δ ɛ 1 0 As ɛ 1 < c 0 and ɛ 2 < d 0, it follows that (c 0, d 0 ) is the unique TSC-minimizing care-configuration. Let the due care for the injurer d = d 0. We have: EC 1 (0, 0) = 0; EC 2 (0, 0) = β(c 0 + d 0 + δ) + (1 β)ɛ 2 ; EC 1 (c 0, 0) = c 0 ; and EC 2 (0, d 0 ) = d 0. EC 1 (c 0, 0) EC 1 (0, 0) = c 0 0 > 0. (4.1) 15

17 EC 2 (0, d 0 ) EC 2 (0, 0) = d 0 β(c 0 + d 0 + δ) (1 β)ɛ 2 = (1 β)d 0 β(c 0 + δ) (1 β)ɛ 2 = (1 β)[ β 1 β (c 0 + δ) + ɛ 2 + θ] β(c 0 + δ) (1 β)ɛ 2 = (1 β)θ > 0. (4.2) (4.1) and (4.2) establish that (0,0) is a Nash equilibrium. As (0, 0) / M, it follows that efficiency does not obtain under the application considered here. This establishes the proposition. Lemma 5 If α > β = 0, then there exists an application belonging to A under which the efficiency does not obtain. Proof: Let α > β = 0. Choose positive numbers δ, θ and d 0. Let 0 < ɛ 2 < d 0. Let c 0 = 1 α α (d 0 + δ) + θ; and let 0 < ɛ 1 < c 0. Now, consider the following application: C = {0, c 0 }; D = {0, d 0 }. L(c, d), (c, d) C D, is as given in the following array: d 0 d 0 c 0 c 0 + d 0 + δ c 0 + d 0 + δ ɛ 2 c 0 c 0 + d 0 + δ ɛ 1 0 As ɛ 1 < c 0 and ɛ 2 < d 0, it follows that (c 0, d 0 ) is the unique TSC-minimizing 16

18 care-configuration. Let the due care for the injurer d = d 0. We have: EC 1 (0, 0) = (1 α)(c 0 + d 0 + δ ɛ 2 ); EC 2 (0, 0) = ɛ 2 ; EC 1 (c 0, 0) = c 0 ; and EC 2 (0, d 0 ) = d 0. EC 1 (c 0, 0) EC 1 (0, 0) = c 0 (1 α)(c 0 + d 0 + δ ɛ 2 ) = αc 0 (1 α)(d 0 + δ ɛ 2 ) = α[ 1 α α (d 0 + δ) + θ] (1 α)[d 0 + δ ɛ 2 ] = αθ + (1 α)ɛ 2 > 0. (5.1) EC 2 (0, d 0 ) EC 2 (0, 0) = d 0 ɛ 2 > 0. (5.2) (5.1) and (5.2) establish that (0,0) is a Nash equilibrium. As (0, 0) / M, it follows that efficiency does not obtain under the application considered here. This establishes the proposition. Theorem 1 A necessary and sufficient condition for efficiency under every application belonging to A is that β be at least as large as α. Proof: Let β α. Consider any a =< C, D, π, H, d > application belonging to A. (c, d ) is a Nash equilibrium by Lemma 1. By Lemma 2 we have: ( (c, d) C D)[(c, d) is a Nash equilibrium (c, d) M]. Therefore, it follows that the efficiency obtains under a. Next suppose that α > β. Then by Lemmas 3-5 there exists an application a =< C, D, π, H, d > under which the efficiency does not obtain. This establishes the theorem. Lemma 6 Let < C, D, π, H, d > be an application belonging to A s. Then, if β > 0 we must have: ( (c, d) C D)[(c, d) is a Nash equilibrium (c, d) M]. 17

19 Proof: Let β > 0; and let < C, D, π, H, d > A s. Let c be such that (c, d ) M. Suppose (c, d) is a Nash equilibrium. (c, d) is a Nash equilibrium implies EC 1 (c, d) EC 1 (c, d) (6.1) and EC 2 (c, d) EC 2 (c, d ). (6.2) (6.1) (6.2) EC 1 (c, d) + EC 2 (c, d) EC 1 (c, d) + EC 2 (c, d ). (6.3) If d < d we have: EC 1 (c, d) = c + (1 α)l(c, d ); EC 2 (c, d) = d + βl(c, d) + (1 β)[l(c, d) L(c, d )]; EC 1 (c, d) = c + (1 α)l(c, d ); and EC 2 (c, d ) = d. Suppose c < c d < d. c < c L(c, d) L(c, d ) L(c, d) L(c, d ), (6.4) because the application under consideration belongs to A s. L(c, d) L(c, d ) d d, (6.5) as TSC are minimized at (c, d ). From inequalities (6.4) and (6.5) we obtain: L(c, d) d d + L(c, d ), which in turn implies that: L(c, d) > d d, as L(c, d ) > 0. (6.6) Now, EC 2 (c, d) = d + βl(c, d) + (1 β)[l(c, d) L(c, d )] d + βl(c, d) + (1 β)[l(c, d) L(c, d )], by (6.4) d + βl(c, d) + (1 β)[d d], by (6.5) > d + β[d d] + (1 β)[d d], by (6.6) as β > 0 = d. But by (6.2), EC 1 (c, d) d. This contradiction establishes that if c < c d < d then (c, d) cannot be a Nash equilibrium; and therefore: (c, d) is a Nash equilibrium c c d d. (6.7) 18

20 If d d we have: EC 1 (c, d) = c + L(c, d); EC 2 (c, d) = d; EC 1 (c, d) = c + L(c, d); and EC 2 (c, d ) = d. Therefore, if d d, (6.3) reduces to: c + L(c, d) + d c + L(c, d) + d c + d + L(c, d) c + d + L(c, d ), as L(c, d) L(c, d ), by (A2). Therefore, d d [(c, d) is a Nash equilibrium T SC(c, d) T SC(c, d )]. (6.8) Next suppose d < d c c. If d < d, (6.3) reduces to: c + (1 α)l(c, d ) + d + βl(c, d) + (1 β)[l(c, d) L(c, d )] c + (1 α)l(c, d ) + d (6.9) c + d + L(c, d) c + (1 α)l(c, d ) + d (β α)l(c, d ) c + d + L(c, d) c + d + L(c, d ) αl(c, d ) (β α)l(c, d ) T SC(c, d) T SC(c, d ) α[l(c, d ) L(c, d )] βl(c, d ). (6.10) If c c then L(c, d ) L(c, d ) by (A2). From (6.10), therefore, it follow that: d < d c c T SC(c, d) T SC(c, d ) 0. (6.11) As total social costs are minimized at (c, d ), it follows that: T SC(c, d) T SC(c, d ) 0 T SC(c, d) = T SC(c, d ); and consequently we obtain: T SC(c, d) T SC(c, d ) 0 (c, d) M. (6.7), (6.8) and (6.11), therefore, establish the lemma. Lemma 7 If β = 0 α > 0, then there exists an application belonging to A s under which the efficiency does not obtain. Proof: Let β = 0 α > 0. Choose positive numbers δ and d 0. Let c 0 > 1 α α δ. 19

21 Now, consider the following application: C = {0, c 0 }; D = {0, d 0 }. L(c, d), (c, d) C D, is as given in the following array: d c 0 d 0 0 c 0 + d 0 + δ c 0 + δ c 0 d 0 0 As δ > 0 we obtain: M = {(c 0, 0)(c 0, d 0 )}. Let the due care for the injurer d = d 0. It is clear that this application belongs to A s. We have: EC 1 (0, 0) = (1 α)(c 0 +δ); EC 2 (0, 0) = d 0 ; EC 1 (c 0, 0) = c 0 ; and EC 2 (0, d 0 ) = d 0. EC 1 (c 0, 0) EC 1 (0, 0) = c 0 (1 α)(c 0 +δ) = αc 0 (1 α)δ = α(c 0 1 α α δ) > 0, as α > 0 c 0 > 1 α α δ. (7.1) EC 2 (0, d 0 ) EC 2 (0, 0) = d 0 d 0 = 0 (7.2) (7.1) and (7.2) establish that (0,0) is a Nash equilibrium. As (0, 0) / M, it follows that efficiency does not obtain under the application considered here. This establishes the proposition. Theorem 2 A necessary and sufficient condition for efficiency under every application belonging to A s is that (β > 0 α = 0). Proof: If α = 0 then regardless of the value of β we have: β α; therefore, 20

22 by Theorem 1, efficiency obtains under every application belonging to A s, as A s A. Let β > 0. Consider any a =< C, D, π, H, d > belonging to A s. (c, d ) is a Nash equilibrium by Lemma 1 as A s A. By Lemma 6 we have: ( (c, d) C D)[(c, d) is a Nash equilibrium (c, d) M]. Therefore, it follows that the efficiency obtains under a. This establishes the sufficiency part of the theorem. If (β = 0 α > 0) then by Lemma 7 there exists an application belonging to A s under which efficiency does not obtain; which establishes the necessity part. Lemma 8 Let a = < C, D, π, H, d > be an application belonging to A s A m. Then: ( (c, d) C D)[(c, d) is a Nash equilibrium (c, d) M]. Proof: Let a = < C, D, π, H, d > A s A m. Let c be such that (c, d ) M. Suppose (c, d) is a Nash equilibrium. (c, d) is a Nash equilibrium implies EC 1 (c, d) EC 1 (c, d) (8.1) and EC 2 (c, d) EC 2 (c, d ). (8.2) (8.1) (8.2) EC 1 (c, d) + EC 2 (c, d) EC 1 (c, d) + EC 2 (c, d ). (8.3) If d < d we have: EC 1 (c, d) = c + (1 α)l(c, d ); EC 2 (c, d) = d + βl(c, d) + (1 β)[l(c, d) L(c, d )]; EC 1 (c, d) = c + (1 α)l(c, d ); and EC 2 (c, d ) = d. Suppose c < c d < d. c < c L(c, d) L(c, d ) L(c, d) L(c, d ), as a A s. (8.4) L(c, d) L(c, d ) > d d, (8.5) as TSC are uniquely minimized at (c, d ) because a A m. (8.4) (8.5) L(c, d) > d d + L(c, d ) 21

23 L(c, d) > d d, as L(c, d ) > 0. (8.6) L(c, d) L(c, d ) > d d L(c, d) > d d βl(c, d) + (1 β)[l(c, d) L(c, d )] > β(d d) + (1 β)(d d) = d d (8.7) Now, EC 2 (c, d) = d + βl(c, d) + (1 β)[l(c, d) L(c, d )] > d + (d d), by (8.7) = d. But by (8.2), EC 2 (c, d) d. This contradiction establishes that if c < c d < d then (c, d) cannot be a Nash equilibrium; and therefore: (c, d) is a Nash equilibrium c c d d. (8.8) If d d we have: EC 1 (c, d) = c + L(c, d); EC 2 (c, d) = d; EC 1 (c, d) = c + L(c, d); and EC 2 (c, d ) = d. Therefore, if d d, (8.3) reduces to: c + L(c, d) + d c + L(c, d) + d c + d + L(c, d) c + d + L(c, d ), as L(c, d) L(c, d ), by (A2). Therefore, d d [(c, d) is a Nash equilibrium T SC(c, d) T SC(c, d )]. (8.9) Next suppose d < d c c. If d < d, (8.3) reduces to: c + (1 α)l(c, d ) + d + βl(c, d) + (1 β)[l(c, d) L(c, d )] c + (1 α)l(c, d ) + d (8.10) c + d + L(c, d) c + (1 α)l(c, d ) + d (β α)l(c, d ) c + d + L(c, d) c + d + L(c, d ) αl(c, d ) (β α)l(c, d ) T SC(c, d) T SC(c, d ) α[l(c, d ) L(c, d )] βl(c, d ). (8.11) If c c then L(c, d ) L(c, d ) by (A2). From (8.11), therefore, it follow that: d < d c c T SC(c, d) T SC(c, d ) 0. (8.12) 22

24 As total social costs are minimized at (c, d ), it follows that: T SC(c, d) T SC(c, d ) 0 T SC(c, d) = T SC(c, d ); and consequently we obtain: T SC(c, d) T SC(c, d ) 0 (c, d) M. (8.8), (8.9) and (8.12), therefore, establish the lemma. Theorem 3 Efficiency obtains under every application belonging to A s A m. Proof: Consider any application a =< C, D, π, H, d > belonging to A s A m. (c, d ) is a Nash equilibrium by Lemma 1 as A s A m A. By Lemma 8 we have: ( (c, d) C D)[(c, d) is a Nash equilibrium (c, d) M]. Therefore, it follows that efficiency obtains under a. This establishes the theorem. 23

On the Efficiency of Negligence Rule

On the Efficiency of Negligence Rule Jawaharlal Nehru University From the SelectedWorks of Satish K. Jain 2009 On the Efficiency of Negligence Rule Satish K. Jain, Jawaharlal Nehru University Available at: https://works.bepress.com/satish_jain/2/

More information

Math 5593 Linear Programming Lecture Notes

Math 5593 Linear Programming Lecture Notes Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................

More information

Numerical Optimization

Numerical Optimization Convex Sets Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Let x 1, x 2 R n, x 1 x 2. Line and line segment Line passing through x 1 and x 2 : {y

More information

Network Topology and Equilibrium Existence in Weighted Network Congestion Games

Network Topology and Equilibrium Existence in Weighted Network Congestion Games Network Topology and Equilibrium Existence in Weighted Network Congestion Games Igal Milchtaich, Bar-Ilan University August 2010 Abstract. Every finite noncooperative game can be presented as a weighted

More information

Approximation Algorithms: The Primal-Dual Method. My T. Thai

Approximation Algorithms: The Primal-Dual Method. My T. Thai Approximation Algorithms: The Primal-Dual Method My T. Thai 1 Overview of the Primal-Dual Method Consider the following primal program, called P: min st n c j x j j=1 n a ij x j b i j=1 x j 0 Then the

More information

On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games

On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games Bruno Codenotti Daniel Štefankovič Abstract The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix

More information

ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY

ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY ALGEBRAIC METHODS IN LOGIC AND IN COMPUTER SCIENCE BANACH CENTER PUBLICATIONS, VOLUME 28 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1993 ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING

More information

PCP and Hardness of Approximation

PCP and Hardness of Approximation PCP and Hardness of Approximation January 30, 2009 Our goal herein is to define and prove basic concepts regarding hardness of approximation. We will state but obviously not prove a PCP theorem as a starting

More information

Lecture Notes on Congestion Games

Lecture Notes on Congestion Games Lecture Notes on Department of Computer Science RWTH Aachen SS 2005 Definition and Classification Description of n agents share a set of resources E strategy space of player i is S i 2 E latency for resource

More information

SOME REMARKS CONCERNING D METRIC SPACES

SOME REMARKS CONCERNING D METRIC SPACES SOME REMARKS CONCERNING D METRIC SPACES Zead Mustafa and Brailey Sims November 2003 Abstract In this note we make some remarks concerning D metric spaces, and present some examples which show that many

More information

AXIOMS FOR THE INTEGERS

AXIOMS FOR THE INTEGERS AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,

More information

THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.

THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions. THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of

More information

Notes for Recitation 9

Notes for Recitation 9 6.042/18.062J Mathematics for Computer Science October 8, 2010 Tom Leighton and Marten van Dijk Notes for Recitation 9 1 Traveling Salesperson Problem Now we re going to talk about a famous optimization

More information

Parameterized Complexity of Independence and Domination on Geometric Graphs

Parameterized Complexity of Independence and Domination on Geometric Graphs Parameterized Complexity of Independence and Domination on Geometric Graphs Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de

More information

Lecture 19 Subgradient Methods. November 5, 2008

Lecture 19 Subgradient Methods. November 5, 2008 Subgradient Methods November 5, 2008 Outline Lecture 19 Subgradients and Level Sets Subgradient Method Convergence and Convergence Rate Convex Optimization 1 Subgradients and Level Sets A vector s is a

More information

The College Admissions Problem Reconsidered

The College Admissions Problem Reconsidered The College Admissions Problem Reconsidered Zhenhua Jiao School of Economics Shanghai University of Finance and Economics Shanghai, 200433, China Guoqiang Tian Department of Economics Texas A&M University

More information

Spherical Tiling by Congruent Pentagons

Spherical Tiling by Congruent Pentagons Spherical Tiling by Congruent Pentagons Min Yan November 12, 2015 webpage for further reading: http://www.math.ust.hk/ mamyan/research/urop.shtml We consider tilings of the sphere by congruent pentagons.

More information

Lecture 2 September 3

Lecture 2 September 3 EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give

More information

Open and Closed Sets

Open and Closed Sets Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.

More information

EC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 2: Convex Sets

EC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 2: Convex Sets EC 51 MATHEMATICAL METHODS FOR ECONOMICS Lecture : Convex Sets Murat YILMAZ Boğaziçi University In this section, we focus on convex sets, separating hyperplane theorems and Farkas Lemma. And as an application

More information

The Encoding Complexity of Network Coding

The Encoding Complexity of Network Coding The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network

More information

A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY

A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,

More information

Comment on Strategic Information Management Under Leakage in a. Supply Chain

Comment on Strategic Information Management Under Leakage in a. Supply Chain Comment on Strategic Information Management Under Leakage in a Supply Chain Lin Tian 1 School of International Business Administration, Shanghai University of Finance and Economics, 00433 Shanghai, China,

More information

Reflection in the Chomsky Hierarchy

Reflection in the Chomsky Hierarchy Reflection in the Chomsky Hierarchy Henk Barendregt Venanzio Capretta Dexter Kozen 1 Introduction We investigate which classes of formal languages in the Chomsky hierarchy are reflexive, that is, contain

More information

Lecture 17: Continuous Functions

Lecture 17: Continuous Functions Lecture 17: Continuous Functions 1 Continuous Functions Let (X, T X ) and (Y, T Y ) be topological spaces. Definition 1.1 (Continuous Function). A function f : X Y is said to be continuous if the inverse

More information

Repairing Multi-Player Games

Repairing Multi-Player Games Repairing Multi-Player Games Shaull Almagor, Guy Avni, and Orna Kupferman School of Computer Science and Engineering, The Hebrew University, Israel Abstract Synthesis is the automated construction of systems

More information

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18 601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18 22.1 Introduction We spent the last two lectures proving that for certain problems, we can

More information

CPSC 536N: Randomized Algorithms Term 2. Lecture 10

CPSC 536N: Randomized Algorithms Term 2. Lecture 10 CPSC 536N: Randomized Algorithms 011-1 Term Prof. Nick Harvey Lecture 10 University of British Columbia In the first lecture we discussed the Max Cut problem, which is NP-complete, and we presented a very

More information

4 Integer Linear Programming (ILP)

4 Integer Linear Programming (ILP) TDA6/DIT37 DISCRETE OPTIMIZATION 17 PERIOD 3 WEEK III 4 Integer Linear Programg (ILP) 14 An integer linear program, ILP for short, has the same form as a linear program (LP). The only difference is that

More information

Generalized Nash Equilibrium Problem: existence, uniqueness and

Generalized Nash Equilibrium Problem: existence, uniqueness and Generalized Nash Equilibrium Problem: existence, uniqueness and reformulations Univ. de Perpignan, France CIMPA-UNESCO school, Delhi November 25 - December 6, 2013 Outline of the 7 lectures Generalized

More information

Matching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.

Matching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition. 18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have

More information

Lecture 22 Tuesday, April 10

Lecture 22 Tuesday, April 10 CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 22 Tuesday, April 10 GRAPH THEORY Directed Graphs Directed graphs (a.k.a. digraphs) are an important mathematical modeling tool in Computer Science,

More information

Two Comments on the Principle of Revealed Preference

Two Comments on the Principle of Revealed Preference Two Comments on the Principle of Revealed Preference Ariel Rubinstein School of Economics, Tel Aviv University and Department of Economics, New York University and Yuval Salant Graduate School of Business,

More information

Representation of Finite Games as Network Congestion Games

Representation of Finite Games as Network Congestion Games Representation of Finite Games as Network Congestion Games Igal Milchtaich To cite this version: Igal Milchtaich. Representation of Finite Games as Network Congestion Games. Roberto Cominetti and Sylvain

More information

Applied Lagrange Duality for Constrained Optimization

Applied Lagrange Duality for Constrained Optimization Applied Lagrange Duality for Constrained Optimization Robert M. Freund February 10, 2004 c 2004 Massachusetts Institute of Technology. 1 1 Overview The Practical Importance of Duality Review of Convexity

More information

Sequential Two-Prize Contests

Sequential Two-Prize Contests Sequential Two-Prize Contests Aner Sela September, 2009 Abstract We study two-stage all-pay auctions with two identical prizes. In each stage, the players compete for one prize. Each player may win either

More information

Lecture 5: Duality Theory

Lecture 5: Duality Theory Lecture 5: Duality Theory Rajat Mittal IIT Kanpur The objective of this lecture note will be to learn duality theory of linear programming. We are planning to answer following questions. What are hyperplane

More information

Line Graphs and Circulants

Line Graphs and Circulants Line Graphs and Circulants Jason Brown and Richard Hoshino Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia, Canada B3H 3J5 Abstract The line graph of G, denoted L(G),

More information

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/3/15

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/3/15 600.363 Introduction to Algorithms / 600.463 Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/3/15 25.1 Introduction Today we re going to spend some time discussing game

More information

Lower bounds and recursive methods for the problem of adjudicating conflicting claims

Lower bounds and recursive methods for the problem of adjudicating conflicting claims Lower bounds and recursive methods for the problem of adjudicating conflicting claims Diego Dominguez University of Rochester March 31, 006 Abstract For the problem of adjudicating conflicting claims,

More information

STABILITY AND PARADOX IN ALGORITHMIC LOGIC

STABILITY AND PARADOX IN ALGORITHMIC LOGIC STABILITY AND PARADOX IN ALGORITHMIC LOGIC WAYNE AITKEN, JEFFREY A. BARRETT Abstract. Algorithmic logic is the logic of basic statements concerning algorithms and the algorithmic rules of deduction between

More information

Abstract Combinatorial Games

Abstract Combinatorial Games Abstract Combinatorial Games Arthur Holshouser 3600 Bullard St. Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA hbreiter@email.uncc.edu

More information

Journal of Asian Scientific Research WEAK SEPARATION AXIOMS VIA OPEN SET AND CLOSURE OPERATOR. Mustafa. H. Hadi. Luay. A. Al-Swidi

Journal of Asian Scientific Research WEAK SEPARATION AXIOMS VIA OPEN SET AND CLOSURE OPERATOR. Mustafa. H. Hadi. Luay. A. Al-Swidi Journal of Asian Scientific Research Special Issue: International Conference on Emerging Trends in Scientific Research, 2014 journal homepage: http://www.aessweb.com/journals/5003 WEAK SEPARATION AXIOMS

More information

15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018

15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 In this lecture, we describe a very general problem called linear programming

More information

Graphs connected with block ciphers

Graphs connected with block ciphers Graphs connected with block ciphers OTOKAR GROŠEK Slovak University of Technology Department of Applied Informatics Ilkovičova 3 812 19 Bratislava SLOVAKIA PAVOL ZAJAC Slovak University of Technology Department

More information

Correlated Equilibria in Sender-Receiver Games

Correlated Equilibria in Sender-Receiver Games Correlated Equilibria in Sender-Receiver Games Andreas Blume Department of Economics University of Pittsburgh Pittsburgh, PA 15260 May, 2010 Abstract It is shown that the efficiency bound for communication

More information

Topics in Artificial Intelligence: Multiagent Systems Selfish Routing in Computer Networks

Topics in Artificial Intelligence: Multiagent Systems Selfish Routing in Computer Networks Topics in Artificial Intelligence: Multiagent Systems Selfish Routing in Computer Networks Sebastian Streg December 10, 2005 1 Introduction Efficiency in networks with lots of traffic is a serious problem

More information

Computer Science Technical Report

Computer Science Technical Report Computer Science Technical Report Feasibility of Stepwise Addition of Multitolerance to High Atomicity Programs Ali Ebnenasir and Sandeep S. Kulkarni Michigan Technological University Computer Science

More information

1.3. Conditional expressions To express case distinctions like

1.3. Conditional expressions To express case distinctions like Introduction Much of the theory developed in the underlying course Logic II can be implemented in a proof assistant. In the present setting this is interesting, since we can then machine extract from a

More information

CS369G: Algorithmic Techniques for Big Data Spring

CS369G: Algorithmic Techniques for Big Data Spring CS369G: Algorithmic Techniques for Big Data Spring 2015-2016 Lecture 11: l 0 -Sampling and Introduction to Graph Streaming Prof. Moses Charikar Scribe: Austin Benson 1 Overview We present and analyze the

More information

SAT-CNF Is N P-complete

SAT-CNF Is N P-complete SAT-CNF Is N P-complete Rod Howell Kansas State University November 9, 2000 The purpose of this paper is to give a detailed presentation of an N P- completeness proof using the definition of N P given

More information

Lecture 6: Faces, Facets

Lecture 6: Faces, Facets IE 511: Integer Programming, Spring 2019 31 Jan, 2019 Lecturer: Karthik Chandrasekaran Lecture 6: Faces, Facets Scribe: Setareh Taki Disclaimer: These notes have not been subjected to the usual scrutiny

More information

A PARAMETRIC SIMPLEX METHOD FOR OPTIMIZING A LINEAR FUNCTION OVER THE EFFICIENT SET OF A BICRITERIA LINEAR PROBLEM. 1.

A PARAMETRIC SIMPLEX METHOD FOR OPTIMIZING A LINEAR FUNCTION OVER THE EFFICIENT SET OF A BICRITERIA LINEAR PROBLEM. 1. ACTA MATHEMATICA VIETNAMICA Volume 21, Number 1, 1996, pp. 59 67 59 A PARAMETRIC SIMPLEX METHOD FOR OPTIMIZING A LINEAR FUNCTION OVER THE EFFICIENT SET OF A BICRITERIA LINEAR PROBLEM NGUYEN DINH DAN AND

More information

A Reduction of Conway s Thrackle Conjecture

A Reduction of Conway s Thrackle Conjecture A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854

More information

A New Approach to Meusnier s Theorem in Game Theory

A New Approach to Meusnier s Theorem in Game Theory Applied Mathematical Sciences, Vol. 11, 2017, no. 64, 3163-3170 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.712352 A New Approach to Meusnier s Theorem in Game Theory Senay Baydas Yuzuncu

More information

Math 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)

Math 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus) Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.

More information

Discharging and reducible configurations

Discharging and reducible configurations Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs

More information

Acyclic fuzzy preferences and the Orlovsky choice function: A note. Denis BOUYSSOU

Acyclic fuzzy preferences and the Orlovsky choice function: A note. Denis BOUYSSOU Acyclic fuzzy preferences and the Orlovsky choice function: A note Denis BOUYSSOU Abstract This note corrects and extends a recent axiomatic characterization of the Orlovsky choice function for a particular

More information

Division of the Humanities and Social Sciences. Convex Analysis and Economic Theory Winter Separation theorems

Division of the Humanities and Social Sciences. Convex Analysis and Economic Theory Winter Separation theorems Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 8: Separation theorems 8.1 Hyperplanes and half spaces Recall that a hyperplane in

More information

Lecture 2 - Introduction to Polytopes

Lecture 2 - Introduction to Polytopes Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.

More information

Network Improvement for Equilibrium Routing

Network Improvement for Equilibrium Routing Network Improvement for Equilibrium Routing UMANG BHASKAR University of Waterloo and KATRINA LIGETT California Institute of Technology Routing games are frequently used to model the behavior of traffic

More information

Extremal Graph Theory: Turán s Theorem

Extremal Graph Theory: Turán s Theorem Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini

More information

Should ISPs be liable for negative externalities of botnets?

Should ISPs be liable for negative externalities of botnets? Should ISPs be liable for negative externalities of botnets? Shinya Kinukawa June 24, 2012 Abstract A botnet, a network of computers under the control of an on-line attacker, is an important threat to

More information

arxiv: v1 [cs.ma] 8 May 2018

arxiv: v1 [cs.ma] 8 May 2018 Ordinal Approximation for Social Choice, Matching, and Facility Location Problems given Candidate Positions Elliot Anshelevich and Wennan Zhu arxiv:1805.03103v1 [cs.ma] 8 May 2018 May 9, 2018 Abstract

More information

Pebble Sets in Convex Polygons

Pebble Sets in Convex Polygons 2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon

More information

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.6 Indirect Argument: Contradiction and Contraposition Copyright Cengage Learning. All

More information

Incompatibility Dimensions and Integration of Atomic Commit Protocols

Incompatibility Dimensions and Integration of Atomic Commit Protocols The International Arab Journal of Information Technology, Vol. 5, No. 4, October 2008 381 Incompatibility Dimensions and Integration of Atomic Commit Protocols Yousef Al-Houmaily Department of Computer

More information

KNOWLEDGE TRANSFER AS A RATIONAL CHOICE: A DECISION THEORETIC CHARACTERIZATION

KNOWLEDGE TRANSFER AS A RATIONAL CHOICE: A DECISION THEORETIC CHARACTERIZATION NOWLEDGE TRANSFER AS A RATIONAL CHOICE: A DECISION THEORETIC CHARACTERIZATION Yasuo Sasaki School of nowledge Science, Japan Advanced Institute of Science and Technology 1-1, Asahidai, Nomi, Ishikawa,

More information

CS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm. Instructor: Shaddin Dughmi

CS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm. Instructor: Shaddin Dughmi CS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm Instructor: Shaddin Dughmi Outline 1 Recapping the Ellipsoid Method 2 Complexity of Convex Optimization

More information

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

CHAPTER 8. Copyright Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation

More information

Some new higher separation axioms via sets having non-empty interior

Some new higher separation axioms via sets having non-empty interior Bhat & Das, Cogent Mathematics (015), : 109695 http://dx.doi.org/10.1080/3311835.015.109695 PURE MATHEMATICS RESEARCH ARTICLE Some new higher separation axioms via sets having non-empty interior Pratibha

More information

Inapproximability of the Perimeter Defense Problem

Inapproximability of the Perimeter Defense Problem Inapproximability of the Perimeter Defense Problem Evangelos Kranakis Danny Krizanc Lata Narayanan Kun Xu Abstract We model the problem of detecting intruders using a set of infrared beams by the perimeter

More information

Consistency and Set Intersection

Consistency and Set Intersection Consistency and Set Intersection Yuanlin Zhang and Roland H.C. Yap National University of Singapore 3 Science Drive 2, Singapore {zhangyl,ryap}@comp.nus.edu.sg Abstract We propose a new framework to study

More information

Chapter 3. Set Theory. 3.1 What is a Set?

Chapter 3. Set Theory. 3.1 What is a Set? Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any

More information

Progress Towards the Total Domination Game 3 4 -Conjecture

Progress Towards the Total Domination Game 3 4 -Conjecture Progress Towards the Total Domination Game 3 4 -Conjecture 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006 South Africa

More information

Week 5. Convex Optimization

Week 5. Convex Optimization Week 5. Convex Optimization Lecturer: Prof. Santosh Vempala Scribe: Xin Wang, Zihao Li Feb. 9 and, 206 Week 5. Convex Optimization. The convex optimization formulation A general optimization problem is

More information

1 Counting triangles and cliques

1 Counting triangles and cliques ITCSC-INC Winter School 2015 26 January 2014 notes by Andrej Bogdanov Today we will talk about randomness and some of the surprising roles it plays in the theory of computing and in coding theory. Let

More information

Approximability Results for the p-center Problem

Approximability Results for the p-center Problem Approximability Results for the p-center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Prof. Timothy Chan University of Waterloo, Spring 2004 The p-center

More information

Semantics via Syntax. f (4) = if define f (x) =2 x + 55.

Semantics via Syntax. f (4) = if define f (x) =2 x + 55. 1 Semantics via Syntax The specification of a programming language starts with its syntax. As every programmer knows, the syntax of a language comes in the shape of a variant of a BNF (Backus-Naur Form)

More information

Sequential Equilibrium in Games of Imperfect Recall

Sequential Equilibrium in Games of Imperfect Recall Sequential Equilibrium in Games of Imperfect Recall Joseph Y. Halpern Cornell University halpern@cs.cornell.edu Rafael Pass Cornell University rafael@cs.cornell.edu First version: October, 2008 This version:

More information

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14 600.363 Introduction to Algorithms / 600.463 Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14 23.1 Introduction We spent last week proving that for certain problems,

More information

Program Calculus Calculational Programming

Program Calculus Calculational Programming Program Calculus Calculational Programming National Institute of Informatics June 21 / June 28 / July 5, 2010 Program Calculus Calculational Programming What we will learn? Discussing the mathematical

More information

Language Barriers. Andreas Blume and Oliver Board Department of Economics University of Pittsburgh Pittsburgh, PA October 5, 2009.

Language Barriers. Andreas Blume and Oliver Board Department of Economics University of Pittsburgh Pittsburgh, PA October 5, 2009. Language Barriers Andreas Blume and Oliver Board Department of Economics University of Pittsburgh Pittsburgh, PA 15260 October 5, 2009 Abstract Private information about language competence drives a wedge

More information

Hedonic Clustering Games

Hedonic Clustering Games Hedonic Clustering Games [Extended Abstract] Moran Feldman CS Dept., Technion Haifa, Israel moranfe@cs.technion.ac.il Liane Lewin-Eytan IBM Haifa Research Lab. Haifa, Israel lianel@il.ibm.com Joseph (Seffi)

More information

On The Theoretical Foundation for Data Flow Analysis in Workflow Management

On The Theoretical Foundation for Data Flow Analysis in Workflow Management Association for Information Systems AIS Electronic Library (AISeL) AMCIS 2005 Proceedings Americas Conference on Information Systems (AMCIS) 2005 On The Theoretical Foundation for Data Flow Analysis in

More information

Elements of Economic Analysis II Lecture III: Cost Minimization, Factor Demand and Cost Function

Elements of Economic Analysis II Lecture III: Cost Minimization, Factor Demand and Cost Function Elements of Economic Analysis II Lecture III: Cost Minimization, Factor Demand and Cost Function Kai Hao Yang 10/05/2017 1 Cost Minimization In the last lecture, we saw a firm s profit maximization problem.

More information

Error-Correcting Codes

Error-Correcting Codes Error-Correcting Codes Michael Mo 10770518 6 February 2016 Abstract An introduction to error-correcting codes will be given by discussing a class of error-correcting codes, called linear block codes. The

More information

Optimal Channel Selection for Cooperative Spectrum Sensing Using Coordination Game

Optimal Channel Selection for Cooperative Spectrum Sensing Using Coordination Game 2012 7th International ICST Conference on Communications and Networking in China (CHINACOM) Optimal Channel Selection for Cooperative Spectrum Sensing Using Coordination Game Yuhua Xu, Zhan Gao and Wei

More information

Winning Positions in Simplicial Nim

Winning Positions in Simplicial Nim Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:

More information

Topology and Topological Spaces

Topology and Topological Spaces Topology and Topological Spaces Mathematical spaces such as vector spaces, normed vector spaces (Banach spaces), and metric spaces are generalizations of ideas that are familiar in R or in R n. For example,

More information

JOURNAL OF OBJECT TECHNOLOGY

JOURNAL OF OBJECT TECHNOLOGY JOURNAL OF OBJECT TECHNOLOGY Online at www.jot.fm. Published by ETH Zurich, Chair of Software Engineering JOT, 2002 Vol. 1, No. 2, July-August 2002 The Theory of Classification Part 2: The Scratch-Built

More information

2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006

2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,

More information

Efficiency and Respecting Improvements in College Admissions

Efficiency and Respecting Improvements in College Admissions Efficiency and Respecting Improvements in College Admissions Zhenhua Jiao School of Economics Shanghai University of Finance and Economics Shanghai, 200433, China Guoqiang Tian Department of Economics

More information

Treewidth and graph minors

Treewidth and graph minors Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under

More information

1 Matchings in Graphs

1 Matchings in Graphs Matchings in Graphs J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 Definition Two edges are called independent if they are not adjacent

More information

Deformable Polygon Representation and Near-Mincuts

Deformable Polygon Representation and Near-Mincuts BOLYAI SOCIETY Building Bridges MATHEMATICAL STUDIES, 19 pp. 1 33. Deformable Polygon Representation and Near-Mincuts András A. Benczúr and Michel X. Goemans We derive a necessary and sufficient condition

More information

1 The Traveling Salesperson Problem (TSP)

1 The Traveling Salesperson Problem (TSP) CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation

More information

Lecture : Topological Space

Lecture : Topological Space Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous

More information

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 Recitation-6: Hardness of Inference Contents 1 NP-Hardness Part-II

More information

Course notes for Data Compression - 2 Kolmogorov complexity Fall 2005

Course notes for Data Compression - 2 Kolmogorov complexity Fall 2005 Course notes for Data Compression - 2 Kolmogorov complexity Fall 2005 Peter Bro Miltersen September 29, 2005 Version 2.0 1 Kolmogorov Complexity In this section, we present the concept of Kolmogorov Complexity

More information