Fuzzy Measures and integrals for evaluating strategies

Size: px
Start display at page:

Download "Fuzzy Measures and integrals for evaluating strategies"

Transcription

1 Fuzzy Measures and integrals for evaluating strategies Yasuo Narukawa Toho Gakuen, Naka, Kunitachi, Tokyo, Japan Vicenç Torra IIIA-CSIC, Campus UAB s/n Bellaterra, Catalonia, Spain Abstract AI techniques have been applied in games since the beginning of the field. Fuzzy measures and fuzzy integrals, a powerful tool for decision making, have potentiality in games for the evaluation of strategies. In this paper we will explore the use of such soft computing techniques and show their interest in decision making and modeling auctions. The paper describes the role of fuzzy measures and integrals in decision making and reviews some computational aspects that are important for the application of such methods in real applications. The paper also gives a short overview on the methods for learning the parameters for these integrals from examples. Keywords: Games, decision making, auctions, soft computing, fuzzy sets, fuzzy theory, model building, Sugeno and Choquet integrals. 1 Introduction Games have been a testbed for artificial intelligence since its inception, being Kasparov defeat against Deep Blue the most famous achievement. Nevertheless, although computer progams have already proven [14] their superiority in several other games (e.g. Othello, checkers) there are some games where further research is needed. Probably is Go [2] one of the current major goals. The current state of computer technology has increased even more the interest of AI techniques in gaming. While previous AI work was mostly oriented on solving the game and, thus, on finding the appropriate decisions so that the computer, as a player, wins the game (See [2] for details on present AI techniques for games following this approach); current trends in the field consider a completely different perspective. It is well known that, nowadays, computer games heavily rely on virtual worlds and synthetic characters. Due to this, ongoing research is on the development of synthetic characters that behave in an intelligent way and with a credible/plausible behavior. An important aspect for demonstrating a credible behavior of the characters is their ability in making decisions. Making an appropriate and on time decision is essential for the credibility of such syntetic characters. In recent years, several tools have been developed in the areas of soft computing and decision theory for decision making. In Section 2 we will review some of these tools, focusing on fuzzy measures and fuzzy integrals. Fuzzy measures and fuzzy integrals are versatile operators that can be used in other contexts than decision making. For example, they have a broad use in aspects related with information fusion. In games, as well as in electronic auctions, they can be used to model coalitions, or participants. In Section 3 we will review this application. An important aspect for building real applications in the context of games and auctions is the computational cost of the algorithms required for making a decision. Due to this, in Section 4 we study the computational cost of two different fuzzy integrals: the Choquet and the Sugeno ones. We will see that their cost is acceptable for most applications as it is just slightly worse than the weighted mean. 2 Decision making Decision making problems are defined in terms of a set of alternatives (say ). Then, a decision maker has to select one alternative from the set (one Ü from ). The simplest case corresponds to the case in which there exists a univariate function that measures the utility of selecting a particular alternative. Then, selection is done so that this function is maximized (select Ü such that ܵ Ñ Ü Ü¾ ܵ, or, equivalently, Ü Ö Ñ Ü Üµ). Alternatively, a preference relation can be built from the function (Ü ½ is preferred to Ü ¾ if when Ü ½ µ Ü ¾ µ) and the most preferred alternative is selected (Ü is selected if Ü is preferred to all Ý in Ò Ü). A multicriteria decision corresponds to the case that instead of a univariate function a multi-valuated one is considered. I.e., ½ ¾ Å µ. In this situation, there are cases in which there is not a unique maximizing solu-

2 ¾ 2.1 Aggregation of ¾ Ü ¾µ Ü ¾ In this case, a value is defined in terms of the other values. This is, in terms of ½ Æ, or with the condition of independence of irrelevant alternatives: Ü µ ½ Ü µ Æ Ü µµ ¾ Ü ½µ Ü ½ ½ Ü ½µ ½ Ü ¾µ Figure 1. Pareto efficient solutions: ܽ, ܾ tion. For example, for ½ ¾µ we have a non optimal case when ܽ ܾ and ½ ܽµ ½ ܾµ but ¾ ܽµ ¾ ܾµ. Figure 1 illustrates this example. This situation raises the concept of Pareto efficiency: Definition 1 An alternative is Pareto efficient if and only if there is no other alternative that is better for all criteria. Definition 2 The Pareto set is the set of alternatives that are Pareto efficient. In the example above, ܽ (and also ܾ) is Pareto efficient because there is no other alternative that is better for all criteria. Naturally, the set ܽ ܾ define the Pareto set. Multicriteria decision problems have been studied by two major schools. On the one hand, the researchers under the umbrella of multicriteria decision aid (MCDA) are mainly devoted to the development of tools that help users to understand their preferences. On the other hand, researchers in multicriteria decision making (MCDM) are more interested on building descriptive approaches. In this latter case, the goal is to build a model of the behavior of the decision makers and, then, apply this model to new problems. According to this distinction, the second approach is more suitable in games as the main concern is the construction of software for making actual decisions. Therefore, model building is the main interest. Two main approaches can be distinguished for multicriteria decision problems: Aggregate the functions ½ Æ into a new function and then use this aggregated function for selecting the best alternative (or for building its corresponding preference relation and then selecting the alternative). Compute a preference relation Ê for each and then aggregate the preference relations into a Ê. Select the best alternative according to the aggregated preference relation. ½ Recall that the condition of independence of irrelevant alternatives states that the aggregation of several functions for a particular object Ó can be directly expressed in terms of an aggregation of the values of the functions for that object. In our context this corresponds to the following equation (where ¼ is the function to aggregate the functions): ¼ ½ Æ µ Ü µ ½ Ü µ Æ Ü µµ Here, is a function that combines Æ values in a given range (or domain following AI and Machine Learning terminology) and yields to another value in the same range. Usually, is one of the so-called aggregation operators. This is, is a function that satisfies (for simplicity we consider the range of equal to the unit interval) the following conditions: 1. Ü Üµ Ü (unanimity) 2. Ñ Ò Ü Ü ½ Ü Æ µ Ñ Ü Ü (compensation) 3. Ü ½ Ü Æ µ Ü ¼ ½ Ü Æ µ when Ü Ü ¼ (monotonicity) Arithmetic mean and weighted mean are well-known examples of aggregation operators. Choquet and Sugeno integrals are more complex and powerful aggregation operators. Their main characteristic is that they can be used to model situations in which the values Ü are not independent but there are dependences among them. I.e., some of the values are redundant or correlated with other of the values. Dependences between the values are expressed in terms of the so-called fuzzy measures. We define them below (see e.g. [9] for details): Definition 3 [8] A set function Ð µ ¼ ½ is a fuzzy measure (or a game) if it satisfies the following axioms: 1. µ ¼, µ ½ (boundary conditions) 2. implies µ µ (monotonicity) In this paper, we assume that is a finite set, that is, ½. Choquet and Sugeno integrals ( Á and ËÁ)aredefined as an integral of a function ¼ ½ with respect to a fuzzy measure on. Their definition are as follows: Definition 4 [3] Let be a fuzzy measure on Ð µµ then the Choquet integral of a function Ê with respect to the fuzzy measure is defined by: Á µ Æ ½ Þ µ µ Þ ½µµ µ µ (1)

3 where Þ µµ indicates that the indices have been permuted so that ¼ Þ ½µµ Þ Òµµ ½, µ Þ µ Þ Æµ and Þ ¼µµ ¼. ¼ ½ possibility fuzzy measures are an interesting family of fuzzy measures for modeling auctions. We define them below and we will show their interest in Section 3. Definition 5 Let A be a non empty subset of. A set function ÈÓ defined as: ÈÓ µ ½if ÈÓ µ ¼if is called the 0-1 possibility measure focused on. A set function Æ defined as: Æ µ ½if Æ µ ¼if is called the 0-1 necessity measure focused on. The next proposition follows from the definition of Choquet integral. Proposition 1 Let be a non-empty subset of and a function on. 1. Á ÈÓ µ Ñ Ü Ü¾ ܵ 2. Á Æ µ Ñ Ò Ü¾ ܵ 3. For every fuzzy measure, Ñ Ò Ü¾ ܵ Á Ñ Ü Üµ ܾ Definition 6 [8] The Sugeno integral Ë µ of a function ¼ ½ with respect to is defined by Ë µ Æ ½ Þ µ µ µ µ (2) where Þ µµ indicates that the indices have been permuted so that ¼ Þ ½µµ Þ Òµµ ½, µ Þ µ Þ Æµ, Æ ½µ. The next proposition follows from the definition above and Proposition 1. Proposition 2 Let be a fuzzy measure and ¼ ½. 1. If is 0-1 valued, then Á µ Ë µ 2. For every f.m., Ñ Ò Ü¾ ܵ Ë µ Ñ Ü Ü¾ ܵ In our context, the set corresponds to the set of criteria (or functions ½ Æ ). Accordingly, the fuzzy measure can be defined over the set ½ Æ (i.e., ½ Æ ). Then, for each Ü we define the function Ü as Ü µ Ü µ. Therefore, is computed as: or: Ü µ ½ Ü µ Æ Ü µµ Ü µ Á Ü ½µ Ü Æµµ Ü µ Ë Ü ½µ Ü Æµµ 2.2 Aggregation of preference relations The general approach is to build a new preference relation from the preference relations corresponding to each attribute. This is, for each a relation Ê is built and, then, from all these relations a relation Ê is constructed. Again, the condition of independence of irrelevant alternatives described in Section 2.1 can take a role. Here, such condition stands that the relation Ê for two objects Ü Ü does only depend on the values Ê for these same objects. This can be formulated as follows: ¼ ʽ Æ µ Ü Ü µ ʽ Ü Ü µ Ê Æ Ü Ü µµ Methods for aggregation of preference relations have been studied for a long time (e.g. by Ramon Llull [15, 5] (S. XIII) or, more recently, Borda and Condorcet (S. XVIII)). A well known result is Arrow s impossibility theorem [1]. See e.g. [4] for a state-of-the art description of the field. 3 Modeling auctions In this section we review the use of fuzzy measures and integrals for modeling auctions. We will present first the general theory and then its application to auctions. 3.1 Fuzzy measure with parameter: General theory Let Ø be a real number. We consider a family of fuzzy measures Ø Ø¾Ì with parameter Ø where Ì Ê. Denote Ø Ð µµ as Ø «if µ Ð Ñ Ø «Ø µ for all ¾ Ð µ and Ø Áµ as Ø «if Á µ Ð Ñ Ø «Á Ø µ for all ¼ ½. We have the next fundamental theorem for convergence. The detailed proof is in [6]. Theorem 1 Let Ø be a family of fuzzy measures with parameter Ø on a finite set Ð µµ and is a fuzzy measure on Ð µµ. Ø Áµ if and only if Ø Ð µµ A concrete example of a fuzzy measure with parameter can be obtained by using distorted probabilities. We say that a fuzzy measure on Ð µµ is a distorted probability if there exist a probability È on Ð µµ and a function ¼ ½ ¼ ½ such that Æ È. Definition 7 Let Ø be a positive real number, and a family of functions Ø ¼ ½ ¼ ½ defined as Ø Üµ Ü Ø for Ü ¾ ¼ ½. We say that a fuzzy measure Ø is a basic distorted probability generated by a probability È if Ø Ø Æ È

4 The next lemma follows immediately from the definition above. Lemma 1 Let È be a probability on Ð µµ satisfying È µ ½only if and È µ ¼only if and Ø a basic distorted probability generated by È. Then we have: 1. Ø Æ Ð µµ as Ø ½, 2. Ø ÈÓ Ð µµ as Ø ¼. The next proposition follows from Theorem 1. Proposition 3 Let È be a probability on Ð µµ satisfying È µ ½only if and È µ ¼only if and Ø a basic distorted probability generated by È. Then we have: 1. Ð Ñ Ø ½ Á Ø µ Ñ Ò Ü¾ ܵ, 2. Ð Ñ Ø ¼ Á Ø µ Ñ Ü Ü¾ ܵ, for every real-valued function on. According to the previous results, a single parameter permits to cover the whole range between the minimum and the maximum. Therefore, changing the parameter Ø, we can obtain a suitable fuzzy measure. 3.2 Application Fuzzy measures and integrals can be used for modeling auctions. In this case, we have that the reference set corresponds to the list of participants. This is, is the set of individuals that participate in a particular auction. Then, fuzzy measures can be used to model whether a certain participant is participating or not in a particular time instant. In this case, modelization is based on 0-1 possibility measures (i.e., measures that take values in ¼ ½ instead on ¼ ½ ). Then, we define Ø over as a function of Ø, where Ø is a variable used to denote time instants. In this case, Ø is to express which members of take part in the auction. Formally speaking, when Å Ø is the set of participants in the auction at time Ø, then Ø µ ½if Å Ø Ø µ ¼if Å Ø. Therefore, when the participant in participates in the auction in the instant Ø ½ then, ¾ Å Ø and the 0-1 possibility measure is such that ؽ Å Ø µ ½. Then, we consider a function Ø Ê that modelizes the price that participants have attached to instant Ø. Under this interpretation, the Choquet integral Á Ø Ø µ is equivalent to Ñ Ü Ü¾Å Ø Ø Üµµ, that is the highest price that could be achieved in instant Ø. Then, ؽ corresponds to the termination instant. When Ê is the amount of money that participants can pay, then Á ؽ µ Ð Ñ Ø ½ Á Ø µ becomes the price of the final bid accepted. Using this construction, it is clear that various auctions models can be defined in terms of Ø and Ø. 4 Computational aspects An important element for the use of Choquet and Sugeno integrals in real applications is their computational requirements. In this section we evaluate the computational cost of Choquet and Sugeno integrals. It is easy to see that the order of the computational cost of applying a Choquet integral to a function on with respect to a fuzzy measure is equivalent to the cost of ordering the elements of in terms of ܵ. This is, the cost of applying the Choquet integral is Æ ÐÓ Æ where Æ. We give below an algorithm with this cost. In the first step, the function is ordered and at the same time the permutation is constructed. The cost of this step is Æ ÐÓ Æ where Æ as said before. Then, if the fuzzy measure is stored in a look-up table (¾ Æ positions are needed) we have that we can use a binary representation for the sets µ. In this case, removing an element Ü µ from the set is just changing the µ bit from ½ into ¼ (assigning the corresponding bit to zero). Under this representation accessing µµ requires a constant time. Therefore, the whole Step 3 process takes Ç Æ µ steps. For all this, the whole process is bounded by the time Step 1 takes. Step 1: order and define accordingly Step 2: ØÓØ Ð ¼ Step 3: Ø ½ ½µ Step 3: for ½ to Æ Step 3.1: Ü µµ Ü ½µµ Step 3.2: ÑÑ Ø Øµ Step 3.3: ØÓØ Ð ØÓØ Ð ÑÑ Step 3.4: Ø Ø Ò µ Step 4: return ØÓØ Ð Note that this computational time is the same than the time required by the OWA operator (this operator also requires the ordering of the elements) and only slightly worse than the time required by the weighted mean (recall that the weighted mean is linear Ç Æ µ). Therefore, with respect to the computational cost, the Choquet integral is a competitive alternative to simpler aggregation methods. Similarly, the computational cost of the Sugeno integral is also Ç Æ ÐÓ Æ µ. Note that in this case, the outline of the previous algorithm is also appropriate with some minor modifications. In particular, in this case, equals to Ü µµ and for computing the new ØÓØ Ð instead of multiplying by ÑÑ and adding it to previous ØÓØ Ð the max-min composition should be applied. I.e., ØÓØ Ð Ñ Ü ØÓØ Ð Ñ Ò Ñѵµ. This is illustrated below:

5 Step 1: order and define accordingly Step 2: ØÓØ Ð ¼ Step 3: Ø ½ ½µ Step 3: for ½ to Æ Step 3.1: Ü µµ Step 3.2: ÑÑ Ø Øµ Step 3.3: ØÓØ Ð Ñ Ü ØÓØ Ð Ñ Ò Ñѵµ Step 3.4: Ø Ø Ò µ Step 4: return ØÓØ Ð As said, the cost of this algorithm is also Ç Æ ÐÓ Æ µ but as now addition and multiplication is replaced by maximum and minimum the effective cost is decreased. 4.1 Fuzzy measures The calculation of the computational cost of the Choquet and Sugeno integrals above is based on the fact that the determination of the fuzzy measure for a particular set can be done using a look-up table. Therefore, an initialization step is required for establishing such look-up table. By the way, for real applications, the definition of a suitable fuzzy measure is the cornerstone of the system. As can be deduced from its definition, a fuzzy measure requires ¾ Æ values. Therefore, for situations in which the cardinality of the reference set is large, such definition becames awkward. To avoid such general definition, fuzzy measures with reduced complexity have been defined so that less than ¾ Æ parameters are required. Decomposable fuzzy measures, k- additive and Ò-dimensional distorted probabilities are some of the existing fuzzy measures with reduced complexity. See [13] for detailed references. In applications, fuzzy measures are usually defined by the system developer or by a domain expert. An alternative is to obtain (learn/determine) from examples. The first study of this subject, for fuzzy integrals, that included some empirical results were obtained by Tanaka and Murofushi [12] in 1989 for the Choquet integral. Since then several algorithms (e.g. based on operation research algorithms and genetic algorithms) have been proposed. Chapter 2 (p. 22) in [13] briefly reviews main results on model building for fuzzy integrals. Two chapters also in [13] (Grabisch, and Imai, Asano and Sato) review and describe state-of-the-art methods for this purpose. 5 Conclusion In this paper we have reviewed the use of fuzzy measures and integrals (Choquet and Sugeno integrals) and their application in state-of-the-art applications. We have also considered their computational cost showing that it is not much larger than the straightforward information fusion methods (e.g. the arithmetic mean and the weighted mean) usually used in most applications. In particular, we have shown that the computational cost of the integrals is Ç Æ ÐÓ Æ µ instead of being Ç Æ µ in the weighted mean. Acknowledgments This work was partly supported by the Spanish Ministry of Science and Technology Fund through project no. TIC C03-02 STREAMOBILE and by Generalitat de Catalunya AGAUR, 2002XT References [1] K. J. Arrow, Social choice and individual values, Wiley, [2] B. Bouzy, T. Cazenave, Computer Go: An AI oriented survey, Artif. Intel. 132 (2001) [3] G. Choquet, Theory of Capacities, Ann. Inst. Fourier 5 (1954) [4] J. Fodor, M. Roubens, Fuzzy preference modelling and multicriteria decision support, Kluwer Academic Publishers, [5] G. Hägele, F. Pukelsheim, Llull s writings on electoral systems,studia Lulliana 41 (2001) 3-38 [6] Y. Narukawa, T. Murofushi, and M. Sugeno: Space of fuzzy measures and convergence, Fuzzy Sets and Systems, vol. 138, no. 3 (2003) pp [7] E. Pap, (Ed.), Handbook of Measure Theory, North-Holland, [8] M. Sugeno, Theory of fuzzy integrals and its application, Thesis, Tokyo Institute of Technology, [9] M. Sugeno, T. Murofushi, Fuzzy Measure, Tokyo, Nikkan Kogyo Shinbunsha (in Japanese), [10] J. Schaeffer, H. J. van den Herik, Games, computers, and artificial intelligence, Artif. Intel. 134 (2002) 1-7. [11] M. Sugeno, K. Fujimoto, and T. Murofushi, Hierarchical decomposition of Choquet integral models, Intl. J. Unc., Fuzz. and KBS, 3, (1995) [12] A. Tanaka, T. Murofushi, A learning model using fuzzy measures and the Choquet integral, 5th Fuzzy System Symposium, Kobe, Japan, (in japanese), [13] V. Torra, On some aggregation operators for numerical information, in V. Torra (Ed.), Information fusion in data mining, Springer, 2003, [14] H. J. van den Herik, J. W. H. M. Uiterwijk, J. van Rijswijck, Games solved: Now and in the future, Artif. Intel. 134 (2002) [15]

CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

More information

Efficient Recovery of Secrets

Efficient Recovery of Secrets Efficient Recovery of Secrets Marcel Fernandez Miguel Soriano, IEEE Senior Member Department of Telematics Engineering. Universitat Politècnica de Catalunya. C/ Jordi Girona 1 i 3. Campus Nord, Mod C3,

More information

A Load Balancing Mechanism with Verification

A Load Balancing Mechanism with Verification A Load Balancing Mechanism with Verification Daniel Grosu and Anthony T. Chronopoulos Department of Computer Science, University of Texas at San Antonio, 6900 N. Loop 1604 West, San Antonio, TX 78249 dgrosu,

More information

Fuzzy Probability Distributions in Bayesian Analysis

Fuzzy Probability Distributions in Bayesian Analysis Fuzzy Probability Distributions in Bayesian Analysis Reinhard Viertl and Owat Sunanta Department of Statistics and Probability Theory Vienna University of Technology, Vienna, Austria Corresponding author:

More information

These axioms must hold for all vectors ū, v, and w in V and all scalars c and d.

These axioms must hold for all vectors ū, v, and w in V and all scalars c and d. DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms

More information

Soft Computing in Economics and Finance

Soft Computing in Economics and Finance Ludmila Dymowa Soft Computing in Economics and Finance 4y Springer 1 Introduction 1 References 5 i 2 Applications of Modern Mathematics in Economics and Finance 7 2.1 Fuzzy'Set Theory and Applied Interval

More information

Large Margin DAGs for Multiclass Classification

Large Margin DAGs for Multiclass Classification S.A. Solla, T.K. Leen and K.-R. Müller (eds.), 57 55, MIT Press (000) Large Margin DAGs for Multiclass Classification John C. Platt Microsoft Research Microsoft Way Redmond, WA 9805 jplatt@microsoft.com

More information

3. Mathematical Induction

3. Mathematical Induction 3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

More information

Follow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu

Follow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part

More information

Convex analysis and profit/cost/support functions

Convex analysis and profit/cost/support functions CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m

More information

arxiv:1112.0829v1 [math.pr] 5 Dec 2011

arxiv:1112.0829v1 [math.pr] 5 Dec 2011 How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

Linguistic Preference Modeling: Foundation Models and New Trends. Extended Abstract

Linguistic Preference Modeling: Foundation Models and New Trends. Extended Abstract Linguistic Preference Modeling: Foundation Models and New Trends F. Herrera, E. Herrera-Viedma Dept. of Computer Science and Artificial Intelligence University of Granada, 18071 - Granada, Spain e-mail:

More information

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing

More information

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT

More information

Alok Gupta. Dmitry Zhdanov

Alok Gupta. Dmitry Zhdanov RESEARCH ARTICLE GROWTH AND SUSTAINABILITY OF MANAGED SECURITY SERVICES NETWORKS: AN ECONOMIC PERSPECTIVE Alok Gupta Department of Information and Decision Sciences, Carlson School of Management, University

More information

Games Manipulators Play

Games Manipulators Play Games Manipulators Play Umberto Grandi Department of Mathematics University of Padova 23 January 2014 [Joint work with Edith Elkind, Francesca Rossi and Arkadii Slinko] Gibbard-Satterthwaite Theorem All

More information

Numerical Research on Distributed Genetic Algorithm with Redundant

Numerical Research on Distributed Genetic Algorithm with Redundant Numerical Research on Distributed Genetic Algorithm with Redundant Binary Number 1 Sayori Seto, 2 Akinori Kanasugi 1,2 Graduate School of Engineering, Tokyo Denki University, Japan 10kme41@ms.dendai.ac.jp,

More information

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013 FACTORING CRYPTOSYSTEM MODULI WHEN THE CO-FACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II Mohammedia-Casablanca,

More information

An example of a computable

An example of a computable An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

More information

Two classes of ternary codes and their weight distributions

Two classes of ternary codes and their weight distributions Two classes of ternary codes and their weight distributions Cunsheng Ding, Torleiv Kløve, and Francesco Sica Abstract In this paper we describe two classes of ternary codes, determine their minimum weight

More information

Computational Learning Theory Spring Semester, 2003/4. Lecture 1: March 2

Computational Learning Theory Spring Semester, 2003/4. Lecture 1: March 2 Computational Learning Theory Spring Semester, 2003/4 Lecture 1: March 2 Lecturer: Yishay Mansour Scribe: Gur Yaari, Idan Szpektor 1.1 Introduction Several fields in computer science and economics are

More information

Big Data - Lecture 1 Optimization reminders

Big Data - Lecture 1 Optimization reminders Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Schedule Introduction Major issues Examples Mathematics

More information

EFFICIENT KNOWLEDGE BASE MANAGEMENT IN DCSP

EFFICIENT KNOWLEDGE BASE MANAGEMENT IN DCSP EFFICIENT KNOWLEDGE BASE MANAGEMENT IN DCSP Hong Jiang Mathematics & Computer Science Department, Benedict College, USA jiangh@benedict.edu ABSTRACT DCSP (Distributed Constraint Satisfaction Problem) has

More information

6.2.8 Neural networks for data mining

6.2.8 Neural networks for data mining 6.2.8 Neural networks for data mining Walter Kosters 1 In many application areas neural networks are known to be valuable tools. This also holds for data mining. In this chapter we discuss the use of neural

More information

KNOWLEDGE-BASED IN MEDICAL DECISION SUPPORT SYSTEM BASED ON SUBJECTIVE INTELLIGENCE

KNOWLEDGE-BASED IN MEDICAL DECISION SUPPORT SYSTEM BASED ON SUBJECTIVE INTELLIGENCE JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 22/2013, ISSN 1642-6037 medical diagnosis, ontology, subjective intelligence, reasoning, fuzzy rules Hamido FUJITA 1 KNOWLEDGE-BASED IN MEDICAL DECISION

More information

Data Mining Solutions for the Business Environment

Data Mining Solutions for the Business Environment Database Systems Journal vol. IV, no. 4/2013 21 Data Mining Solutions for the Business Environment Ruxandra PETRE University of Economic Studies, Bucharest, Romania ruxandra_stefania.petre@yahoo.com Over

More information

CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

More information

Generalized Widening

Generalized Widening Generalized Widening Tristan Cazenave Abstract. We present a new threat based search algorithm that outperforms other threat based search algorithms and selective knowledge-based for open life and death

More information

KNOWLEDGE FACTORING USING NORMALIZATION THEORY

KNOWLEDGE FACTORING USING NORMALIZATION THEORY KNOWLEDGE FACTORING USING NORMALIZATION THEORY J. VANTHIENEN M. SNOECK Katholieke Universiteit Leuven Department of Applied Economic Sciences Dekenstraat 2, 3000 Leuven (Belgium) tel. (+32) 16 28 58 09

More information

Notes on Factoring. MA 206 Kurt Bryan

Notes on Factoring. MA 206 Kurt Bryan The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

More information

University of Miskolc

University of Miskolc University of Miskolc The Faculty of Mechanical Engineering and Information Science The role of the maximum operator in the theory of measurability and some applications PhD Thesis by Nutefe Kwami Agbeko

More information

Artificial Intelligence in Knowledge-based Technologies and Systems

Artificial Intelligence in Knowledge-based Technologies and Systems Computer Science and Information Technology 4(1): 27-32, 2016 DOI: 10.13189/csit.2016.040105 http://www.hrpub.org Artificial Intelligence in Knowledge-based Technologies and Systems Viktor Krasnoproshin

More information

Application of Game Theory in Inventory Management

Application of Game Theory in Inventory Management Application of Game Theory in Inventory Management Rodrigo Tranamil-Vidal Universidad de Chile, Santiago de Chile, Chile Rodrigo.tranamil@ug.udechile.cl Abstract. Game theory has been successfully applied

More information

Determination of the normalization level of database schemas through equivalence classes of attributes

Determination of the normalization level of database schemas through equivalence classes of attributes Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,

More information

Fuzzy Cognitive Map for Software Testing Using Artificial Intelligence Techniques

Fuzzy Cognitive Map for Software Testing Using Artificial Intelligence Techniques Fuzzy ognitive Map for Software Testing Using Artificial Intelligence Techniques Deane Larkman 1, Masoud Mohammadian 1, Bala Balachandran 1, Ric Jentzsch 2 1 Faculty of Information Science and Engineering,

More information

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

More information

Load Balancing with Memory

Load Balancing with Memory Load Balancing with Memory Michael Mitzenmacher Harvard University michaelm@eecs.harvard.edu Balaji Prabhakar Stanford University balaji@stanford.edu Devavrat Shah Stanford University devavrat@cs.stanford.edu

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

Induced Choquet Ordered Averaging Operator and Its Application to Group Decision Making

Induced Choquet Ordered Averaging Operator and Its Application to Group Decision Making Induced Choquet Ordered Averaging Operator and Its Application to Group Decision Making Chunqiao Tan, Xiaohong Chen School of Business, Central South University, Changsha 410083, People s Republic of China

More information

Relational Learning for Football-Related Predictions

Relational Learning for Football-Related Predictions Relational Learning for Football-Related Predictions Jan Van Haaren and Guy Van den Broeck jan.vanhaaren@student.kuleuven.be, guy.vandenbroeck@cs.kuleuven.be Department of Computer Science Katholieke Universiteit

More information

Extending Semantic Resolution via Automated Model Building: applications

Extending Semantic Resolution via Automated Model Building: applications Extending Semantic Resolution via Automated Model Building: applications Ricardo Caferra Nicolas Peltier LIFIA-IMAG L1F1A-IMAG 46, Avenue Felix Viallet 46, Avenue Felix Viallei 38031 Grenoble Cedex FRANCE

More information

2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering

2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering 2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering Compulsory Courses IENG540 Optimization Models and Algorithms In the course important deterministic optimization

More information

Lyapunov Stability Analysis of Energy Constraint for Intelligent Home Energy Management System

Lyapunov Stability Analysis of Energy Constraint for Intelligent Home Energy Management System JAIST Reposi https://dspace.j Title Lyapunov stability analysis for intelligent home energy of energ manageme Author(s)Umer, Saher; Tan, Yasuo; Lim, Azman Citation IEICE Technical Report on Ubiquitous

More information

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

More information

Optimal shift scheduling with a global service level constraint

Optimal shift scheduling with a global service level constraint Optimal shift scheduling with a global service level constraint Ger Koole & Erik van der Sluis Vrije Universiteit Division of Mathematics and Computer Science De Boelelaan 1081a, 1081 HV Amsterdam The

More information

About the inverse football pool problem for 9 games 1

About the inverse football pool problem for 9 games 1 Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute

More information

Removing Partial Inconsistency in Valuation- Based Systems*

Removing Partial Inconsistency in Valuation- Based Systems* Removing Partial Inconsistency in Valuation- Based Systems* Luis M. de Campos and Serafín Moral Departamento de Ciencias de la Computación e I.A., Universidad de Granada, 18071 Granada, Spain This paper

More information

LOOKING FOR A GOOD TIME TO BET

LOOKING FOR A GOOD TIME TO BET LOOKING FOR A GOOD TIME TO BET LAURENT SERLET Abstract. Suppose that the cards of a well shuffled deck of cards are turned up one after another. At any time-but once only- you may bet that the next card

More information

Bayesian Estimation of Joint Survival Functions in Life Insurance

Bayesian Estimation of Joint Survival Functions in Life Insurance ISBA 2, Proceedings, pp. ISBA and Eurostat, 21 Bayesian Estimation of Joint Survival Functions in Life Insurance ARKADY SHEMYAKIN and HEEKYUNG YOUN University of St. Thomas, Saint Paul, MN, USA Abstract:

More information

Working Paper Series ISSN 1424-0459. Working Paper No. 238. Stability for Coalition Formation Games. Salvador Barberà and Anke Gerber

Working Paper Series ISSN 1424-0459. Working Paper No. 238. Stability for Coalition Formation Games. Salvador Barberà and Anke Gerber Institute for Empirical Research in Economics University of Zurich Working Paper Series ISSN 1424-0459 Working Paper No. 238 A Note on the Impossibility of a Satisfactory Concept of Stability for Coalition

More information

On the Interaction and Competition among Internet Service Providers

On the Interaction and Competition among Internet Service Providers On the Interaction and Competition among Internet Service Providers Sam C.M. Lee John C.S. Lui + Abstract The current Internet architecture comprises of different privately owned Internet service providers

More information

ISSN: 2277-3754 ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 3, September 2013

ISSN: 2277-3754 ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 3, September 2013 Performance Appraisal using Fuzzy Evaluation Methodology Nisha Macwan 1, Dr.Priti Srinivas Sajja 2 Assistant Professor, SEMCOM 1 and Professor, Department of Computer Science 2 Abstract Performance is

More information

Numerical Matrix Analysis

Numerical Matrix Analysis Numerical Matrix Analysis Lecture Notes #10 Conditioning and / Peter Blomgren, blomgren.peter@gmail.com Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research

More information

Regret and Rejoicing Effects on Mixed Insurance *

Regret and Rejoicing Effects on Mixed Insurance * Regret and Rejoicing Effects on Mixed Insurance * Yoichiro Fujii, Osaka Sangyo University Mahito Okura, Doshisha Women s College of Liberal Arts Yusuke Osaki, Osaka Sangyo University + Abstract This papers

More information

Two-Sided Matching Theory

Two-Sided Matching Theory Two-Sided Matching Theory M. Utku Ünver Boston College Introduction to the Theory of Two-Sided Matching To see which results are robust, we will look at some increasingly general models. Even before we

More information

Software project cost estimation using AI techniques

Software project cost estimation using AI techniques Software project cost estimation using AI techniques Rodríguez Montequín, V.; Villanueva Balsera, J.; Alba González, C.; Martínez Huerta, G. Project Management Area University of Oviedo C/Independencia

More information

EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set

EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set Amhmed A. Bhih School of Electrical and Electronic Engineering Princy Johnson School of Electrical and Electronic Engineering Martin

More information

Computer Science 281 Binary and Hexadecimal Review

Computer Science 281 Binary and Hexadecimal Review Computer Science 281 Binary and Hexadecimal Review 1 The Binary Number System Computers store everything, both instructions and data, by using many, many transistors, each of which can be in one of two

More information

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that

More information

Using Generalized Forecasts for Online Currency Conversion

Using Generalized Forecasts for Online Currency Conversion Using Generalized Forecasts for Online Currency Conversion Kazuo Iwama and Kouki Yonezawa School of Informatics Kyoto University Kyoto 606-8501, Japan {iwama,yonezawa}@kuis.kyoto-u.ac.jp Abstract. El-Yaniv

More information

CS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing

CS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing CS Master Level Courses and Areas The graduate courses offered may change over time, in response to new developments in computer science and the interests of faculty and students; the list of graduate

More information

Operations Research and Knowledge Modeling in Data Mining

Operations Research and Knowledge Modeling in Data Mining Operations Research and Knowledge Modeling in Data Mining Masato KODA Graduate School of Systems and Information Engineering University of Tsukuba, Tsukuba Science City, Japan 305-8573 koda@sk.tsukuba.ac.jp

More information

MINIMAL BOOKS OF RATIONALES

MINIMAL BOOKS OF RATIONALES MINIMAL BOOKS OF RATIONALES José Apesteguía Miguel A. Ballester D.T.2005/01 MINIMAL BOOKS OF RATIONALES JOSE APESTEGUIA AND MIGUEL A. BALLESTER Abstract. Kalai, Rubinstein, and Spiegler (2002) propose

More information

On characterization of a class of convex operators for pricing insurance risks

On characterization of a class of convex operators for pricing insurance risks On characterization of a class of convex operators for pricing insurance risks Marta Cardin Dept. of Applied Mathematics University of Venice e-mail: mcardin@unive.it Graziella Pacelli Dept. of of Social

More information

Types of Degrees in Bipolar Fuzzy Graphs

Types of Degrees in Bipolar Fuzzy Graphs pplied Mathematical Sciences, Vol. 7, 2013, no. 98, 4857-4866 HIKRI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.37389 Types of Degrees in Bipolar Fuzzy Graphs Basheer hamed Mohideen Department

More information

The Banach-Tarski Paradox

The Banach-Tarski Paradox University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible

More information

Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines

Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Maher Rebai University of Technology of Troyes Department of Industrial Systems 12 rue Marie Curie, 10000 Troyes France maher.rebai@utt.fr

More information

On the representability of the bi-uniform matroid

On the representability of the bi-uniform matroid On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large

More information

Separation Properties for Locally Convex Cones

Separation Properties for Locally Convex Cones Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam

More information

How To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)

How To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl) Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

More information

Regular Languages and Finite Automata

Regular Languages and Finite Automata Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a

More information

Genetic Algorithm Evolution of Cellular Automata Rules for Complex Binary Sequence Prediction

Genetic Algorithm Evolution of Cellular Automata Rules for Complex Binary Sequence Prediction Brill Academic Publishers P.O. Box 9000, 2300 PA Leiden, The Netherlands Lecture Series on Computer and Computational Sciences Volume 1, 2005, pp. 1-6 Genetic Algorithm Evolution of Cellular Automata Rules

More information

JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004

JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004 Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February

More information

The sum of digits of polynomial values in arithmetic progressions

The sum of digits of polynomial values in arithmetic progressions The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France E-mail: stoll@iml.univ-mrs.fr

More information

MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

More information

Integer Factorization using the Quadratic Sieve

Integer Factorization using the Quadratic Sieve Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give

More information

Chapter 21: The Discounted Utility Model

Chapter 21: The Discounted Utility Model Chapter 21: The Discounted Utility Model 21.1: Introduction This is an important chapter in that it introduces, and explores the implications of, an empirically relevant utility function representing intertemporal

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

More information

Basics of Polynomial Theory

Basics of Polynomial Theory 3 Basics of Polynomial Theory 3.1 Polynomial Equations In geodesy and geoinformatics, most observations are related to unknowns parameters through equations of algebraic (polynomial) type. In cases where

More information

Gerard Mc Nulty Systems Optimisation Ltd gmcnulty@iol.ie/0876697867 BA.,B.A.I.,C.Eng.,F.I.E.I

Gerard Mc Nulty Systems Optimisation Ltd gmcnulty@iol.ie/0876697867 BA.,B.A.I.,C.Eng.,F.I.E.I Gerard Mc Nulty Systems Optimisation Ltd gmcnulty@iol.ie/0876697867 BA.,B.A.I.,C.Eng.,F.I.E.I Data is Important because it: Helps in Corporate Aims Basis of Business Decisions Engineering Decisions Energy

More information

A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number

A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, 07ee055@ms.dendai.ac.jp

More information

Generating models of a matched formula with a polynomial delay

Generating models of a matched formula with a polynomial delay Generating models of a matched formula with a polynomial delay Petr Savicky Institute of Computer Science, Academy of Sciences of Czech Republic, Pod Vodárenskou Věží 2, 182 07 Praha 8, Czech Republic

More information

Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems. Matrix Factorization Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

More information

Bargaining Solutions in a Social Network

Bargaining Solutions in a Social Network Bargaining Solutions in a Social Network Tanmoy Chakraborty and Michael Kearns Department of Computer and Information Science University of Pennsylvania Abstract. We study the concept of bargaining solutions,

More information

Factoring General Games using Propositional Automata

Factoring General Games using Propositional Automata Factoring General Games using Propositional Automata Evan Cox, Eric Schkufza, Ryan Madsen and Michael R. Genesereth Stanford University, CA, USA Abstract In this paper we propose the design of a more robust

More information

METHODOLOGICAL CONSIDERATIONS OF DRIVE SYSTEM SIMULATION, WHEN COUPLING FINITE ELEMENT MACHINE MODELS WITH THE CIRCUIT SIMULATOR MODELS OF CONVERTERS.

METHODOLOGICAL CONSIDERATIONS OF DRIVE SYSTEM SIMULATION, WHEN COUPLING FINITE ELEMENT MACHINE MODELS WITH THE CIRCUIT SIMULATOR MODELS OF CONVERTERS. SEDM 24 June 16th - 18th, CPRI (Italy) METHODOLOGICL CONSIDERTIONS OF DRIVE SYSTEM SIMULTION, WHEN COUPLING FINITE ELEMENT MCHINE MODELS WITH THE CIRCUIT SIMULTOR MODELS OF CONVERTERS. Áron Szûcs BB Electrical

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

Equilibrium computation: Part 1

Equilibrium computation: Part 1 Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium

More information

Lecture 7: Finding Lyapunov Functions 1

Lecture 7: Finding Lyapunov Functions 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1

More information

ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska

ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four

More information

o-minimality and Uniformity in n 1 Graphs

o-minimality and Uniformity in n 1 Graphs o-minimality and Uniformity in n 1 Graphs Reid Dale July 10, 2013 Contents 1 Introduction 2 2 Languages and Structures 2 3 Definability and Tame Geometry 4 4 Applications to n 1 Graphs 6 5 Further Directions

More information

The Simple Dependency Ranking System A novel method for defence capability prioritisation

The Simple Dependency Ranking System A novel method for defence capability prioritisation 20th International Congress on Modelling and Simulation, Adelaide, Australia, 1 6 December 2013 www.mssanz.org.au/modsim2013 The Simple Dependency ing System A novel method for defence capability prioritisation

More information

Mechanisms for Fair Attribution

Mechanisms for Fair Attribution Mechanisms for Fair Attribution Eric Balkanski Yaron Singer Abstract We propose a new framework for optimization under fairness constraints. The problems we consider model procurement where the goal is

More information

15.062 Data Mining: Algorithms and Applications Matrix Math Review

15.062 Data Mining: Algorithms and Applications Matrix Math Review .6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

More information

Local periods and binary partial words: An algorithm

Local periods and binary partial words: An algorithm Local periods and binary partial words: An algorithm F. Blanchet-Sadri and Ajay Chriscoe Department of Mathematical Sciences University of North Carolina P.O. Box 26170 Greensboro, NC 27402 6170, USA E-mail:

More information

Useful Number Systems

Useful Number Systems Useful Number Systems Decimal Base = 10 Digit Set = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} Binary Base = 2 Digit Set = {0, 1} Octal Base = 8 = 2 3 Digit Set = {0, 1, 2, 3, 4, 5, 6, 7} Hexadecimal Base = 16 = 2

More information

Load Balancing and Switch Scheduling

Load Balancing and Switch Scheduling EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

More information

MODIFIED RECONSTRUCTABILITY ANALYSIS FOR MANY-VALUED FUNCTIONS AND RELATIONS

MODIFIED RECONSTRUCTABILITY ANALYSIS FOR MANY-VALUED FUNCTIONS AND RELATIONS MODIIED RECONSTRUCTABILITY ANALYSIS OR MANY-VALUED UNCTIONS AND RELATIONS Anas N. Al-Rabadi (1), and Martin Zwick (2) (1) ECE Department (2) Systems Science Ph.D. Program @Portland State University [alrabadi@ece.pdx.edu]

More information