Voting Games with Positive Weights and. Dummy Players: Facts and Theory
|
|
- Archibald Copeland
- 5 years ago
- Views:
Transcription
1 Appled Mathematcal Scences, Vol 10, 2016, no 53, HIKARI Ltd, wwwm-hkarcom Votng Games wth Postve Weghts and Dummy Players: Facts and Theory Zdravko Dmtrov Slavov Varna Free Unversty, Varna, Bulgara Chrstna Slavova Evans The George Washngton Unversty, Washngton DC, USA Copyrght 2016 Zdravko Dmtrov Slavov and Chrstna Slavova Evans Ths artcle s dstrbuted under the Creatve Commons Attrbuton Lcense, whch permts unrestrcted use, dstrbuton, and reproducton n any medum, provded the orgnal work s properly cted Abstract In ths paper we consder a specal class of weghted votng games wth two basc characterstcs: each player has a postve weght and dchotomous rule - acceptance or reecton Frst, we present two real votng paradoxes where a player wth postve weght s a dummy Next, usng the knowledge of these paradoxes we generate some theoretcal statements Mathematcs Subect Classfcaton: 91A12 Keywords: votng game, postve weght, dummy, proper, decsve 1 Introducton Let N be a nonempty fnte set of players n a game G and every subset S N s referred to as a coalton The set N s called the grand coalton and N s called the empty coalton We denote the collecton of all coaltons by 2 and N the number of players of S 2 by S Let us label the players by 1,2, n, n N 2 The noton of a smple game was ntroduced by John von Neumann and Oscar Morgenstern n ther monumental book Theory of Games and Economc Behavor n 1944 [8] Ths game s a conflct n whch the only obectve s wnnng and the only rule s an algorthm to decde whch coaltons are wnnng
2 2638 Zdravko D Slavov and Chrstna S Evans Defnton 1 A smple game s a par ( N, v) where N { 1,2,, n} s a set N of players and v : 2 {0,1 } s the characterstc functon whch satsfes the followng three condtons: (1) v ( ) 0 (2) v ( N) 1 (3) s monotonc, e f S T N, then v( S) v( T) From the above defnton t follows that for each coalton S N we have ether v ( S) 0 or v ( S) 1 Defnton 2 For any coalton S N, S s wnnng f and only f v ( S) 1, S s losng f and only f v ( S) 0, and S s blockng f and only f S and N \ S are both losng The collectons of all wnnng, all losng and all blockng coaltons are denoted by W, L and B, respectvely By defnton, we obtan N W and L ; therefore, W and L are N nonempty, W L and W L 2 Observe that a coalton havng a wnnng sub-coalton s also wnnng, a sub-coalton of a losng coalton s also losng, the complement of a blockng coalton s also blockng, B can be ether empty or nonempty and B L For any player N, the collecton of all wnnng coaltons ncludng s denoted by W and the collecton of all wnnng coaltons excludng s denoted by nequalty W Clearly, f W W S W, then S { }W ; therefore, we obtan the Defnton 3 For any coalton S W, S s called a mnmal wnnng coalton f and only f S \{ } s a losng coalton for all S The collecton of all mnmal wnnng coaltons s denoted by MW It s easy to prove that MW and W are fnte sets, MW W and MW s nonempty Defnton 4 A player who does not belong to any mnmal wnnng coalton s called a dummy, e player N s a dummy f and only f S for all S MW A player who belongs to all mnmal wnnng coaltons s called a veto player, e player N has capacty to veto f and only f S for all S MW A player N s a dctator f and only f {} s a wnnng coalton Formally, for any player N, s a dctator s equvalent to { } MW, s a veto player s equvalent to S, s a dummy s equvalent to S MW S S MW 2 Basc Concepts and Defntons n Weghted Votng Games In ths secton we wll consder a specal class of smple games called weghted votng games wth dchotomous votng rule - acceptance ("yes") or reecton
3 Votng games wth postve weghts and dummy players 2639 ("no") These games have been found to be well-suted to model economc or poltcal bodes [5] The basc formal framework of ths study s as follows A weghted votng game ( N, v) s descrbed by G [ q; w1, w2,, wn ] where q and w 1, w2,, wn are postve nteger numbers such that q w k 1 k By conventon, we take w w f As a result we derve the followng propertes: (1) 1 q (2) n N 2 s the number of players (3) w 1 s the number of votes of player N (4) w1 w2 wn (5) q s the needed quota so that a coalton can wn (6) the symbol [ q ; w1, w2,, wn ] represents the smple game ( N, v) defned by 1, w q ks k v( S), where S N 0, w q ks k Of course, f N and w 0, then player s powerless, for more nformaton see [3] We wll consder three examples Example 1 The votng method of the Securty Councl of the Unted Natons, formed by 5 permanent (USA, UK, France, Russa and Chna) and 10 temporary members, s the game n whch each one of the permanent member has 7 votes and each one of the temporary member has only one vote, the establshed quota s 39 votes, and there are 45 total votes We observe that any coalton whch does not nclude all of the 5 permanent members has at most votes, whch s an nferor number to the fxed quota As a result ths coalton wll not be wnnng Hence, each one of the permanent members has the capacty to veto any proposal For more nformaton see [1] and [7] Example 2 The Bulgaran Parlament wth 240 seats uses two dfferent rules: a smple maorty by quota 121 (more than 1 ) and a qualfed maorty by 2 quota 161 (more than 2 ) The Fnsh Parlament wth 200 seats uses three 3 dfferent rules: a smple maorty by quota 101 (more than 1 ), a qualfed 2 maorty by quota 134 (more than 2 ), and n some specal cases by quota (more than 5 ) [1] 6 Defnton 5 A weghted votng game ( N, v) s called proper f and only f v ( S) v( N \ S) 1 for all S N Note that a weghted votng game s proper f and only f the complement of a wnnng coalton s not a wnnng coalton Ths means that n a proper game n
4 2640 Zdravko D Slavov and Chrstna S Evans the both coaltons S and N \ S cannot be wnnng In ths context, f S s wnnng, then N \ S s losng, but the converse s not true In ths paper, we wll only study proper games Defnton 6 A weghted votng game ( N, v) s called decsve f and only f v ( S) v( N \ S) 1 for all S N It s easy to prove that a smple game s decsve f and only f t has no blockng coalton For any coalton S, S s wnnng s equvalent to N \ S s losng If a smple game s decsve, then t has no blockng player, but the converse statement s not true If a smple game has a dctator, then t s decsve, but the converse statement s not true Let us consder a weghted votng game [ q ; w1, w2,, wn ], q qmn where mn 1 q 1 f s even and q mn f s odd It s easy to prove that: (1) q mn and 2q mn 1 for all postve nteger 2 (2) f s even, then 2q mn 1 In ths case ( q mn 1) ( qmn 1) ; therefore, t s possble to have a blockng coalton (3) f s odd, then 2q mn 1, e ( q mn 1) qmn In ths case, for q qmn we fnd that t s not possble to have a blockng coalton Hence, ths game s decsve Defnton 7 Consder two weghted votng games G1 [ q1; w1, w2,, wm ] and G2 [ q2; w1, w2,, wn ] Game G 1 s equvalent to game G 2 f and only f m n and MW ( G1 ) MW ( G2), e the set of all mnmal wnnng coaltons of game G 1 s equal to the set of all mnmal wnnng coaltons of game G 2 Note that the set of all wnnng coaltons and the set of all mnmal wnnng coaltons n the weghted votng game [ q ; w1, w2,, wn ] are the same as the set of all wnnng coaltons and the set of all mnmal wnnng coaltons n the weghted votng game [ q; w1, w2,, wn ] for every postve nteger number, respectvely As a result we obtan that the weghted votng game [ q ; w1, w2,, wn ] s equvalent to the game [ q; w1, w2,, wn ] Defnton 8 For any proper game ( N, v), a par of players, N s called symmetrc (or and are symmetrc) f and only f v( S { }) v( S { }) for all coaltons S N \{, } Of course, f w w, then players and are symmetrc, but the converse statement s not true For example, see game G [30;14,13,11,10] Consder a par of symmetrc players, N By defnton, f S N and S, then v( S) v( S { }\{ }) Now, t s easy to see that W W
5 Votng games wth postve weghts and dummy players Two Votng Paradoxes In ths secton we wll descrbe two paradoxes n real votng systems In prncple a player can be assgned weght zero, but n practce ths player would be slly, because t would be a dummy However, a player havng a postve weght can also be a dummy 31 The Votng Paradox of Luxembourg In ths subsecton we wll see that Luxembourg was a powerless country as a member of the European Unon Councl of Mnsters durng the perod Let us consder the Councl of Mnsters durng the above perod from a mathematcal pont of vew The decson rule s a weghted votng game L 58 [12; 4, 4, 4, 2, 2,1] In ths game the players are Germany, France, Italy, Belgum, Netherlands and Luxembourg, respectvely Note that the total sum of the weghts s 17 and the quota s 12, e n 6, 17 and q 12 It s easy to show that ths game s proper, see also [1] and [7] The number of wnnng coaltons s 14 and they are: {1,2,3,4,5,6}, {1,2,3,4,5}, {1,2,3,4,6}, {1,2,3,5,6}, {1,2,3,4}, {1,2,3,5}, {1,2,3,6}, {1,2,4,5,6}, {1,3,4,5,6}, {2,3,4,5,6}, {1,2,3}, {1,2,4,5}, {1,3,4,5} and {2,3,4,5} The number of mnmal wnnng coaltons s 4 and they are: {1,2,3}, {1,2,4,5}, {1,3,4,5} and {2,3,4,5} As a result we decde that player 6 s a dummy So player 6 or Luxembourg formally was never able to make any dfference n the votng process and was a dummy durng the perod [6] Obvously, game L 58 [12; 4, 4, 4, 2, 2,1] has no dctator, has no veto player and has a dummy player We also get that ths game has at least one blockng coalton Hence, ths game s not decsve For example, coalton { 1,4} s blockng and coalton { 4,5,6 } s losng but not blockng Clearly, players 1, 2 and 3 are symmetrc, and players 4 and 5 are symmetrc because they have equal weghts, respectvely 32 The Votng Paradox of Nassau Country In ths subsecton we wll study Nassau Country, New York, whch s a regon on Long Island The government of Nassau Country took the form of a Board of Supervsors n 1958 for the perod and n 1964 for the perod , one representatve for each of varous muncpaltes, who casts a block of votes [2] There are two specal weghted votng games used at varous tmes by Nassau Country We wll dscuss these two votng games 321 The Frst Votng Game The frst decson rule n 1958 was a weghted votng game N 58 [16; 9, 9, 7, 3,1,1] In ths game the players were Hempstead 1, Hempstead 2, North Hempstead, Oyster Bay, Long Beach and Glen Cove, respectvely In game N 58, the total sum of the weghts was 30 and the quota was 16, e n 6,
6 2642 Zdravko D Slavov and Chrstna S Evans 30 and q 16 As a result we fnd that game N 58 s proper It s easy to show that ths game has no blockng coalton; therefore, t s decsve The number of mnmal wnnng coaltons s 3 and they are: {1,2}, {1,3} and {2,3} As a result we see that Oyster Bay, Long Beach and Glen Cove (players 4, 5 and 6) are dummes Note that the number of all wnnng coaltons s , e W 32 and MW 3 In ths game players 1, 2 and 3 are symmetrc, but they do not have equal weghts Players 4, 5 and 6 do not have equal weghts and they are symmetrc too 322 The Second Votng Game The second decson rule n 1964 was a weghted votng game N 64 [58; 31, 31, 28, 21, 2, 2] In ths game the players were Hempstead 1, Hempstead 2, Oyster Bay, North Hempstead, Long Beach and Glen Cove, respectvely In game N 64, the total sum of the weghts was 115 and the quota was 58, e n 6, 115 and q 58 It s easy to show that ths game s also decsve The number of mnmal wnnng coaltons s also 3 and they are: {1,2}, {1,3} and {2,3} As a result we see that North Hempstead, Long Beach and Glen Cove (players 4, 5 and 6) are dummes The number of all wnnng coaltons s also 32 As n game N 58, we see n game N 64 that players 1, 2 and 3 are symmetrc, they do not have equal weghts, players 4, 5 and 6 are also symmetrc and they do not have equal weghts 323 On Decson Rules We have obtaned that both games N 58 [16; 9, 9, 7, 3,1,1 ] and N 64 [58; 31, 31, 28, 21, 2, 2] have no dctator, have no veto player and have no blockng coalton Obvously, Long Beach and Glen Cove are dummes n both games N 58 and N 64 Oyster Bay s a dummy player n game N 58, but North Hempstead s a dummy n game N 64 Note that game N 58 [16; 9, 9, 7, 3,1,1 ] s equvalent to game N 64 [58; 31, 31, 28, 21, 2, 2] We also see that the both games N 58 [16; 9, 9, 7, 3,1,1] and N 64 [58; 31, 31, 28, 21, 2, 2] are equvalent to game [ 8; 4, 4, 4,1,1,1 ] As a result, after 1964, the quota was rased to guarantee that no muncpalty was a dummy The next decson rule n 1970 was a weghted votng game N 70 [63; 31, 31, 28, 21, 2, 2], 115 and q 63 It s easy to see that {1,2,6} and {3,4,5,6} are two mnmal wnnng coalton, e ths game has no dummy player
7 Votng games wth postve weghts and dummy players Some Propertes of Weghted Votng Games In ths secton we wll consder a proper game [ q; w1, w2,, w n 1, wn ] when n 3 and each player has a postve weght Here, we generate some theoretcal statements Theorem 1 If player N s a dummy and S N, then: (a) S W mples S { } W and S \{ } W (b) S L mples S { } L and S \{ } L (c) v( S) v( S { }) ( S \{ }) (d) S B mples S { } B and S \{ } B Proof From Defnton 4 t follows that f S MW, then S (a) Let S W There are two cases: Case 1 If S, then S { } S W and S MW Player s a dummy, S W and S MW mply S \{ } W Case 2 If S, then S \{ } S W From S W t follows that S { } W Fnally, we obtan S { } W and S \{ } W (b) Let S L There are two cases: Case 1 If S, then S { } S L and S \{ } S L Case 2 If S, then S \{ } S L Let us assume that T S { } W Player s a dummy, S T, S and T mply T \{ } S W, see part (a) Ths leads to a contradcton; therefore, S { } L Fnally, we obtan S { } L and S \{ } L (c) Drectly from parts (a) and (b) (d) Let S B, e S L and N \ S L Accordng to part (b) for coaltons S and T N \ S we obtan S { } L, S \{ } L, T { } L and T \{ } L Ths means that S { } B and S \{ } B The theorem s proven Theorem 2 Consder a par of players, N The followng statements are true (a) If player s not a dummy and player s a dummy, then w w (b) If player s a dummy and w w, then player s also a dummy (c) If players and are symmetrc, then s a dummy s equvalent to s a dummy Proof (a) Let us denote MW k { S MW : k S} for k N It s easy to show that MW s not empty and MW s empty If S MW MW, then w q k S k For coalton T S \{ } t follows that w w q k T k and w q, e T s a losng coalton It s known that player s a dummy; k T k
8 2644 Zdravko D Slavov and Chrstna S Evans therefore, S and T Now let us consder a new coalton P T {} There are two cases: Case 1 Let P be a losng coalton In ths case we have w w q k T k Case 2 Let P be a wnnng coalton From the condton that s a dummy t follows that T P \{ } s a wnnng coalton too Ths leads to a contradcton Fnally, we obtan w w q k T k From the nequaltes w w q k T k and w w q k T k we get w w (b) Let us assume that player s not a dummy From player beng a dummy and part (a) t follows that w w Ths leads to a contradcton wth the condton w w ; therefore, player s a dummy (c) Let player be a dummy and assume that player s not a dummy Hence, there exsts a coalton S MW such that S Consder a new coalton T S \{ } Clearly, T L and, T ; therefore, v( T) v( T { }) v( T { }) v( S) because and are symmetrc, and s a dummy As a result we obtan v( T) v( S), v ( T) 0 and v ( S) 1 Ths s a contradcton; therefore, player s a dummy The theorem s proven Theorem 3 [4 - Theorem 7] Player N s a dummy f and only f the nequalty a w w 1 wn q holds where a max{ w : S {1,2,, 1}, S W} S Note that the two theorems above allow us to count the number of all dummy players and construct the set of all dummy players Now we wll focus our attenton on game L 58 On the basc of nformaton of ths game we generate the frst basc theorem n our paper Theorem 4 If n 4, k 2, 0 w n k wn 1, q 0 modulo k and w 0 modulo k for all { 1,2, n 1}, then player n s a dummy Proof Let p be a postve nteger number between q and, and denote W ( p) { S W : w } and MW ( p) MW W( p) It s easy to show that pq S p W W ( p) and MW MW ( p) pq Of course, f p [ q, ] and W ( p) s nonempty, then ether p wn modulo k or p 0 modulo k From W W ( p) s nonempty t follows that there exsts p [ q, ] pq such that W ( p) s nonempty too Here there are two cases Case 1 Let p w modulo k n
9 Votng games wth postve weghts and dummy players 2645 In ths case we have p q Let us assume that there exsts S W( p), e w p S and p q From w S wn modulo k t follows that n S and p q w n Consder a coalton T S \{ n} It s easy to see that T W( p wn ); therefore, S MW As a result we derve S MW ( p), e MW ( p) s empty Case 2 Let p 0 modulo k In ths case there exsts S W( p) such that w p From S S w 0 modulo k t follows that n S As a result we obtan S W( p) mples n S Let us denote A { p[ q, ]: ns W( p)} Obvously, n S for all S W( p) p A Fnally, we have that n S for all S p A W( p) and MW MW ( p) pq MW ( p) p A W( p) As a result we obtan n S pa for all S p A MW ( p) and MW p A W( p) It s easy to show that n S for all S MW, e player n s a dummy The theorem s proven Corollary 1 [6 Theorem 3] If n 3, w n1 2, 0 w n wn 1, q 0 modulo w n1 and w 0 modulo w n1 for all { 1,2,, n 2}, then player n s a dummy Proof Accordng to Theorem 4 for k w n 1 Lastly, let us analyze both games N 58 and N 64 Usng the knowledge of ths votng paradox we wrte the second basc theorem Theorem 5 Consder a proper game G [ q; w1, w2,, w n 1, wn ] when n 4 (a) If { 2,3} W, then MW {{1,2},{1,3},{2,3 }} In partcular, ths game has no dctator and player 4 s a dummy (b) If game G [ q; w1, w2,, wn ] s decsve, player 1 s not a dctator and player 4 s a dummy, then MW {{1,2},{1,3},{2,3 }} Proof (a) From { 2,3} W t follows that { 1,2},{1,3},{1,2,3} W Game [ q ; w1, w2,, wn ] s proper mples { 1},{2},{3} L So, we fnd that {{ 1,2},{1,3},{2,3}} MW, { 1,2,3} W \ MW and player 1 s not a dctator Now, from {{ 1,2},{1,3},{2,3}} MW and { 1,2,3} W t follows that { 4,, n},{1,4,, n},{2,4,, n},{3,4,, n} L Hence, f S MW and S 2, then S {{ 1,2},{1,3},{2,3 }} MW Let us assume that S MW and S 3 In ths case there exsts a subcoalton T S such that T {,, k} where, {1,2,3 } and k { 4,, n} We know that {, } MW ; therefore, T MW and ths mples S MW Ths leads to a contradcton Thus, we obtan MW {{1,2},{1,3},{2,3 }}
10 2646 Zdravko D Slavov and Chrstna S Evans (b) From player 1 s not a dctator and player 4 s a dummy t follows that { 1},{2},{3}L and { 1,2,3} W, see Theorems 1 and 2 Accordng to Theorem 1 t follows that { 1,4} L ; therefore, { 2,3} MW We also see that { 2,4},{3,4} L Thus, we also obtan { 1,2},{1,3} MW Player 4 s a dummy mples MW {{1,2},{1,3},{2,3}} The theorem s proven References [1] A Laruelle, F Valencano, Votng and Collectve Decson-Makng: Barganng and Power, Cambrdge Unversty Press, [2] D Lppman, Math n Socety, Creatve Commons BY-SA, 2012 [3] N Masser, Decson-Makng n Commttees: Game-Theoretc Analyss, Sprnger Berln Hedelberg, [4] T Matsu, Y Matsu, A Survey of Algorthms for Calculatng Power Indces of Weghted Maorty Games, Journal of the Operatons Research Socety of Japan, 43 (2000), no 1, [5] B Peleg, Chapter 8 Game-Theoretc Analyss of Votng n Commttees Chapter n Handbook of Socal Choce and Welfare, vol 1, Elsever, 2002, [6] Z Slavov, C Evans, On the Votng Paradox of Luxembourg and Decson Power Indces, Mathematcs and Educaton n Mathematcs, 43 (2014), [7] A Taylor, A Pacell, Mathematcs and Poltcs: Strategy, Votng, Power and Proof, Strnger -Verlag New York, [8] J Von Neumann, O Morgenstern, Theory of Game and Economc Behavor, Prnceton Unversty Press, 1944 Receved: July ; Publshed: August 31, 2016
The Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationExistence of Two Conjugate Classes of A 5 within S 6. by Use of Character Table of S 6
Internatonal Mathematcal Forum, Vol. 8, 2013, no. 32, 1591-159 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/mf.2013.3359 Exstence of Two Conjugate Classes of A 5 wthn S by Use of Character Table
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationCase Study of Markov Chains Ray-Knight Compactification
Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationInternational Journal of Algebra, Vol. 8, 2014, no. 5, HIKARI Ltd,
Internatonal Journal of Algebra, Vol. 8, 2014, no. 5, 229-238 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/ja.2014.4212 On P-Duo odules Inaam ohammed Al Had Department of athematcs College of Educaton
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationA CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA
A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes
More informationA note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationResearch Article Relative Smooth Topological Spaces
Advances n Fuzzy Systems Volume 2009, Artcle ID 172917, 5 pages do:10.1155/2009/172917 Research Artcle Relatve Smooth Topologcal Spaces B. Ghazanfar Department of Mathematcs, Faculty of Scence, Lorestan
More informationResearch Article Green s Theorem for Sign Data
Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of
More informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationOn the spectral norm of r-circulant matrices with the Pell and Pell-Lucas numbers
Türkmen and Gökbaş Journal of Inequaltes and Applcatons (06) 06:65 DOI 086/s3660-06-0997-0 R E S E A R C H Open Access On the spectral norm of r-crculant matrces wth the Pell and Pell-Lucas numbers Ramazan
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationFREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,
FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationQuantum Particle Motion in Physical Space
Adv. Studes Theor. Phys., Vol. 8, 014, no. 1, 7-34 HIKARI Ltd, www.-hkar.co http://dx.do.org/10.1988/astp.014.311136 Quantu Partcle Moton n Physcal Space A. Yu. Saarn Dept. of Physcs, Saara State Techncal
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationSharp integral inequalities involving high-order partial derivatives. Journal Of Inequalities And Applications, 2008, v. 2008, article no.
Ttle Sharp ntegral nequaltes nvolvng hgh-order partal dervatves Authors Zhao, CJ; Cheung, WS Ctaton Journal Of Inequaltes And Applcatons, 008, v. 008, artcle no. 5747 Issued Date 008 URL http://hdl.handle.net/07/569
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India February 2008
Game Theory Lecture Notes By Y. Narahar Department of Computer Scence and Automaton Indan Insttute of Scence Bangalore, Inda February 2008 Chapter 10: Two Person Zero Sum Games Note: Ths s a only a draft
More informationMath 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationResearch Article Global Sufficient Optimality Conditions for a Special Cubic Minimization Problem
Mathematcal Problems n Engneerng Volume 2012, Artcle ID 871741, 16 pages do:10.1155/2012/871741 Research Artcle Global Suffcent Optmalty Condtons for a Specal Cubc Mnmzaton Problem Xaome Zhang, 1 Yanjun
More informationAmusing Properties of Odd Numbers Derived From Valuated Binary Tree
IOSR Journal of Mathematcs (IOSR-JM) e-iss: 78-578, p-iss: 19-765X. Volume 1, Issue 6 Ver. V (ov. - Dec.016), PP 5-57 www.osrjournals.org Amusng Propertes of Odd umbers Derved From Valuated Bnary Tree
More informationA Solution of the Harry-Dym Equation Using Lattice-Boltzmannn and a Solitary Wave Methods
Appled Mathematcal Scences, Vol. 11, 2017, no. 52, 2579-2586 HIKARI Ltd, www.m-hkar.com https://do.org/10.12988/ams.2017.79280 A Soluton of the Harry-Dym Equaton Usng Lattce-Boltzmannn and a Soltary Wave
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationP exp(tx) = 1 + t 2k M 2k. k N
1. Subgaussan tals Defnton. Say that a random varable X has a subgaussan dstrbuton wth scale factor σ< f P exp(tx) exp(σ 2 t 2 /2) for all real t. For example, f X s dstrbuted N(,σ 2 ) then t s subgaussan.
More informationResearch Article An Extension of Stolarsky Means to the Multivariable Case
Internatonal Mathematcs and Mathematcal Scences Volume 009, Artcle ID 43857, 14 pages do:10.1155/009/43857 Research Artcle An Extenson of Stolarsky Means to the Multvarable Case Slavko Smc Mathematcal
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationAxiomatizations of Pareto Equilibria in Multicriteria Games
ames and Economc Behavor 28, 146154 1999. Artcle ID game.1998.0680, avalable onlne at http:www.dealbrary.com on Axomatzatons of Pareto Equlbra n Multcrtera ames Mark Voorneveld,* Dres Vermeulen, and Peter
More informationGames of Threats. Elon Kohlberg Abraham Neyman. Working Paper
Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017
More informationThe Pseudoblocks of Endomorphism Algebras
Internatonal Mathematcal Forum, 4, 009, no. 48, 363-368 The Pseudoblocks of Endomorphsm Algebras Ahmed A. Khammash Department of Mathematcal Scences, Umm Al-Qura Unversty P.O.Box 796, Makkah, Saud Araba
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationGeometry of Müntz Spaces
WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More informationDouble Layered Fuzzy Planar Graph
Global Journal of Pure and Appled Mathematcs. ISSN 0973-768 Volume 3, Number 0 07), pp. 7365-7376 Research Inda Publcatons http://www.rpublcaton.com Double Layered Fuzzy Planar Graph J. Jon Arockaraj Assstant
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationP.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen
Internatonal Electronc Journal of Algebra Volume 3 2008 7-24 P.P. PROPERTIES OF GROUP RINGS Lbo Zan and Janlong Chen Receved: May 2007; Revsed: 24 October 2007 Communcated by John Clark Abstract. A rng
More informationSubset Topological Spaces and Kakutani s Theorem
MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationA Note on Bound for Jensen-Shannon Divergence by Jeffreys
OPEN ACCESS Conference Proceedngs Paper Entropy www.scforum.net/conference/ecea- A Note on Bound for Jensen-Shannon Dvergence by Jeffreys Takuya Yamano, * Department of Mathematcs and Physcs, Faculty of
More informationRoot Structure of a Special Generalized Kac- Moody Algebra
Mathematcal Computaton September 04, Volume, Issue, PP8-88 Root Structu of a Specal Generalzed Kac- Moody Algebra Xnfang Song, #, Xaox Wang Bass Department, Bejng Informaton Technology College, Bejng,
More informationON SEPARATING SETS OF WORDS IV
ON SEPARATING SETS OF WORDS IV V. FLAŠKA, T. KEPKA AND J. KORTELAINEN Abstract. Further propertes of transtve closures of specal replacement relatons n free monods are studed. 1. Introducton Ths artcle
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationWeighted Voting Systems
Weghted Votng Systems Elssa Brown Chrssy Donovan Charles Noneman June 5, 2009 Votng systems can be deceptve. For nstance, a votng system mght consst of four people, n whch three of the people have 2 votes,
More informationMonotonic Interpolating Curves by Using Rational. Cubic Ball Interpolation
Appled Mathematcal Scences, vol. 8, 204, no. 46, 7259 7276 HIKARI Ltd, www.m-hkar.com http://dx.do.org/0.2988/ams.204.47554 Monotonc Interpolatng Curves by Usng Ratonal Cubc Ball Interpolaton Samsul Arffn
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationValuated Binary Tree: A New Approach in Study of Integers
Internatonal Journal of Scentfc Innovatve Mathematcal Research (IJSIMR) Volume 4, Issue 3, March 6, PP 63-67 ISS 347-37X (Prnt) & ISS 347-34 (Onlne) wwwarcournalsorg Valuated Bnary Tree: A ew Approach
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationModulo Magic Labeling in Digraphs
Gen. Math. Notes, Vol. 7, No., August, 03, pp. 5- ISSN 9-784; Copyrght ICSRS Publcaton, 03 www.-csrs.org Avalable free onlne at http://www.geman.n Modulo Magc Labelng n Dgraphs L. Shobana and J. Baskar
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationChristian Aebi Collège Calvin, Geneva, Switzerland
#A7 INTEGERS 12 (2012) A PROPERTY OF TWIN PRIMES Chrstan Aeb Collège Calvn, Geneva, Swtzerland chrstan.aeb@edu.ge.ch Grant Carns Department of Mathematcs, La Trobe Unversty, Melbourne, Australa G.Carns@latrobe.edu.au
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More information10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)
0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes
More informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationA Solution of Porous Media Equation
Internatonal Mathematcal Forum, Vol. 11, 016, no. 15, 71-733 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/mf.016.6669 A Soluton of Porous Meda Equaton F. Fonseca Unversdad Naconal de Colomba Grupo
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationThe Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices
Internatonal Mathematcal Forum, Vol. 6, 2011, no. 15, 713-721 The Degrees of Nlpotency of Nlpotent Dervatons on the Rng of Matrces Homera Pajoohesh Department of of Mathematcs Medgar Evers College of CUNY
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationSUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION
talan journal of pure appled mathematcs n. 33 2014 (63 70) 63 SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION M.R. Farhangdoost Department of Mathematcs College of Scences Shraz Unversty Shraz, 71457-44776
More information