Evolutionary Game Theory
|
|
|
- Shanna Banks
- 9 years ago
- Views:
Transcription
1 Evolutionary Game Theory James Holland Jones Department of Anthropology Stanford University December 1, The Evolutionarily Stable Strategy (ESS) An evolutionarily stable strategy (ESS) is a strategy that, if adopted by nearly all members of a population, can not be invaded by a rare mutant strategy. Consider a game in which D is an ESS. If a rare mutant H with very low frequency (p 1) were to enter the population, would it invade? We can write the fitness of the two strategies as follows: W (D) = C + (1 p)ie(d, D, ) + pie(d, H) W (H) = C + (1 p)ie(h, D) + pie(h, H) where C is the fitness of an individual before the encounter. If D is an ESS, this means that W (D) > W (H) Solving the inequality W (D) > W (H), we get: IE(D, D) IE(H, D) IE(H, H) IE(D, H) > p 1 p We assumed that p 1 so the fraction on the right-hand side of the inequality is essentially equal to zero. Thus for the left-hand side to be greater than zero means that the numerator on the right-hand side must be positive. This yields the condition: IE(D, D) > IE(H, D). This is the Nash Equilibrium solution. However, an ESS can arise even when this condition is not met. If IE(D, D) = IE(H, D) and IE(D, H) > IE(H, D), then D is still an ESS. That is, while H mutants are not at a disadvantage when playing D s, D nonetheless shares an advantage in the population because it does better against H than H does against itself. The Hawk-Dove game was originally developed by Maynard Smith and Price to describe animal conflict. Animals playing the Dove strategy (i.e., Doves ) avoid conflict. When faced Correspondence Address: Department of Anthropology, 450 Serra Mall, Building 50, Stanford, CA ; phone: , fax: ; [email protected] 1
2 with competition over a resource, two doves will split the benefit of the resource v. In contrast, Hawks always escalate conflicts and fight over resources. When a Hawk plays a dove, it always takes the full value of the resource, however, when a Hawk plays another Hawk, there is a 50% chance either will win. These fights between Hawks are costly, incurring a cost c on Hawks during each encounter. Figure 1 presents the payoff matrix for the Hawk-Dove game. Each cell of the matrix contains to entries. The first is the payoff to the row player. The second is the payoff to the column player. Frequently, payoff matrices will simply list the payoff to the row player, since if the game is symmetric, the payoffs to the row players and column players will be identical when facing the same type of opponent. H D H (v c)/2, (v c)/2 v, 0 D 0, v v/2, v/2 Figure 1: Maynard Smith and Price s Hawk-Dove game. Row player s payoffs given first in each cell. 2 Evolutionary Game Theory Evolutionary game theory (EGT) focuses on evolutionary dynamics that are frequency dependent. The fitness payoff for a particular phenotype depends on the population composition. Classical game theory focuses largely on the properties of the equilibria of games. One of the central defining features of EGT is the focus on the dynamics of strategies and their composition in a population rather than on the properties of equilibria. The approach is to study replicator equations. The attractors of these dynamical equations are the evolutionary stable strategies (ESSs) or the Nash Equilibria of the game. Consider the Prisoner s Dilemma game. This game is defined by two strategies: Cooperate and Defect. The prisoner s dilemma game is defined such that the payoff to a defector playing against a cooperator is greatest; the payoff of mutual cooperation is next greatest; the payoff for mutual defection is next greatest; and the payoff to cooperating when the opponent defects is least. These features can be economically summarized in a payoff matrix that lists the payoff to the row strategy when playing the column strategy (figure 2). We can name the payoffs in game 2 T > R > P > S, where T is the temptation, R is the reward for mutual cooperation, P is the punishment for mutual defection, and S is the sucker s payoff. It is conventional to also assume that R > (T + P )/2. Without this, then alternating rounds between cooperation and defection leads to a greater payoff than pure cooperation. C D C R S D T P Figure 2: Prisoner s Dilemma. T > R > P > S and R > (T + P )/2. 2
3 We assume a large population (effectively infinite) so that we can reasonably model the proportions of the two strategies, x c and x d. If the population were sufficiently small, we would need to worry about things like the random extinction of strategies at low frequency (this is the so-called finite population model). Let w c and w d be the fitnesses of cooperators and defectors respectively. Further, let w(s 1, s 2 ) denote the change in fitness for an s 1 individual against an s 2 opponent. Fitness is a function of the proportions of strategies d and c: w c = W c,0 + x c w(c, C) + x d w(c, D) (1) w d = W d,0 + x c w(d, C) + x d w(d, D) w = x c w c + x d w d where W i,0 is the initial fitness of strategy i and w is mean fitness. The change in frequencies from one generation to the next will be a function of the current proportions and the relative fitnesses. For example, the proportion of strategy c in the next generation will be x c = x c w c / w, the proportion of strategy d will be x d = x dw d / w. The change from one generation to the next for the c strategy will be: x c = x c x c = x c(w c w) w For small change, and where reproduction is continuous, we can approximate this equation with the differential equation, ẋ c = x c(w c w). w Since by definition of the Prisoner s Dilemma (w c w)/ w < 0, it is clear that the c strategy will decay exponentially at a rate equal to (w c w)/ w. The general replicator dynamic equation for n strategies is ẋ i = x i [w i (x) w] (2) where ẋ i is the time derivative of the proportion playing the ith strategy, w i (x) is the fitness of strategy i when played against the current state vector x = (x 1, x 2,..., x n ). This fitness of strategy i comes from the payoff matrix W = [w ij ]. Fitness for the i strategy is w i (x) = j x iw i,j. Note that this is just the expected fitness for strategy i: multiply the frequency of strategy i times the fitnesses of i against itself and all other strategies in the population. This sum is its expected fitness. The system of differential equations in 2 is generally much easier to analyze than the corresponding system of difference equations. For continuously breeding, age-structured populations, the assumption of continuous change is not that bad as long as the change per unit time is not too great. Assuming that the population size is very large means that we don t have to worry about stochastic variation in strategies due to drift. 3
4 2.1 An Example: Hawk-Dove-Retaliator Hawk-Dove-Retaliator is another game described by Maynard Smith and Price. Like Hawk- Dove, Hawks always fight and Doves always concede to a fight. The game introduces a third strategy, Retaliator, which escalate only if its adversary escalates. That is, Retaliator normally plays Dove but plays Hawk against other Hawks. The payoff to Retaliator is thus equal to that of a Hawk when playing a Hawk and a Dove when playing Doves or itself. These payoffs are summarized in figure 3. H D R H (v c)/2 v (v c)/2 D 0 v/2 v/2 R (v c)/2 v/2 v/2 Figure 3: Maynard Smith and Price s Hawk-Dove-Retaliator game. Row player s payoffs given first in each cell. v is the payoff for victory in a conflict. c is the cost of fighting (e.g., wounding). The trajectories of the dynamics of this game are plotted in the three-sided simplex of figure 4. In this plot, each vertex of the triangle represents the pure strategy. A point in the interior represents a mixture of strategies. The sum of the distances from each vertex is always one. 4
5 Retaliator Dove Hawk Figure 4: Evolutionary trajectories for the Hawk-Dove-Retaliator game with different starting values. The initial values are x (1) 0 = (1/3, 1/3, 1/3) and x (2) 0 = (1/3, 1/2, 1/6). Initial values x (1) 0 leads to a mixed equilibrium that is 2/3 Doves and 1/3 Hawks, while x (2) 0 leads to a mixed equilibrium that is 69% Retaliator and 31% Dove. 5
10 Evolutionarily Stable Strategies
10 Evolutionarily Stable Strategies There is but a step between the sublime and the ridiculous. Leo Tolstoy In 1973 the biologist John Maynard Smith and the mathematician G. R. Price wrote an article in
ECO 199 B GAMES OF STRATEGY Spring Term 2004 PROBLEM SET 4 B DRAFT ANSWER KEY 100-3 90-99 21 80-89 14 70-79 4 0-69 11
The distribution of grades was as follows. ECO 199 B GAMES OF STRATEGY Spring Term 2004 PROBLEM SET 4 B DRAFT ANSWER KEY Range Numbers 100-3 90-99 21 80-89 14 70-79 4 0-69 11 Question 1: 30 points Games
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
From the probabilities that the company uses to move drivers from state to state the next year, we get the following transition matrix:
MAT 121 Solutions to Take-Home Exam 2 Problem 1 Car Insurance a) The 3 states in this Markov Chain correspond to the 3 groups used by the insurance company to classify their drivers: G 0, G 1, and G 2
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation Daron Acemoglu and Asu Ozdaglar MIT November 2, 2009 1 Introduction Outline The problem of cooperation Finitely-repeated prisoner s dilemma
Mistakes Allow Evolutionary Stability in the Repeated Prisoner's Dilemma Game. I. Introduction
J. theor. Biol. (1989) 136, 47-56 Mistakes Allow Evolutionary Stability in the Repeated Prisoner's Dilemma Game ROBERT BOYD Department of Anthropology, University of California, Los Angeles, California
ECON 40050 Game Theory Exam 1 - Answer Key. 4) All exams must be turned in by 1:45 pm. No extensions will be granted.
1 ECON 40050 Game Theory Exam 1 - Answer Key Instructions: 1) You may use a pen or pencil, a hand-held nonprogrammable calculator, and a ruler. No other materials may be at or near your desk. Books, coats,
Chapter 7. Evolutionary Game Theory
From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/kleinber/networks-book/
How to Solve Strategic Games? Dominant Strategies
How to Solve Strategic Games? There are three main concepts to solve strategic games: 1. Dominant Strategies & Dominant Strategy Equilibrium 2. Dominated Strategies & Iterative Elimination of Dominated
1 Nonzero sum games and Nash equilibria
princeton univ. F 14 cos 521: Advanced Algorithm Design Lecture 19: Equilibria and algorithms Lecturer: Sanjeev Arora Scribe: Economic and game-theoretic reasoning specifically, how agents respond to economic
The Basics of Game Theory
Sloan School of Management 15.010/15.011 Massachusetts Institute of Technology RECITATION NOTES #7 The Basics of Game Theory Friday - November 5, 2004 OUTLINE OF TODAY S RECITATION 1. Game theory definitions:
FINAL EXAM, Econ 171, March, 2015, with answers
FINAL EXAM, Econ 171, March, 2015, with answers There are 9 questions. Answer any 8 of them. Good luck! Problem 1. (True or False) If a player has a dominant strategy in a simultaneous-move game, then
6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games
6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games Asu Ozdaglar MIT February 4, 2009 1 Introduction Outline Decisions, utility maximization Strategic form games Best responses
Online Appendix to Stochastic Imitative Game Dynamics with Committed Agents
Online Appendix to Stochastic Imitative Game Dynamics with Committed Agents William H. Sandholm January 6, 22 O.. Imitative protocols, mean dynamics, and equilibrium selection In this section, we consider
Game Theory 1. Introduction
Game Theory 1. Introduction Dmitry Potapov CERN What is Game Theory? Game theory is about interactions among agents that are self-interested I ll use agent and player synonymously Self-interested: Each
12 Evolutionary Dynamics
12 Evolutionary Dynamics Through the animal and vegetable kingdoms, nature has scattered the seeds of life abroad with the most profuse and liberal hand; but has been comparatively sparing in the room
Sequential lmove Games. Using Backward Induction (Rollback) to Find Equilibrium
Sequential lmove Games Using Backward Induction (Rollback) to Find Equilibrium Sequential Move Class Game: Century Mark Played by fixed pairs of players taking turns. At each turn, each player chooses
9 Repeated Games. Tomorrow, and tomorrow, and tomorrow, Creeps in this petty pace from day to day To the last syllable of recorded time Shakespeare
9 Repeated Games Tomorrow, and tomorrow, and tomorrow, Creeps in this petty pace from day to day To the last syllable of recorded time Shakespeare When a game G is repeated an indefinite number of times
COMP310 MultiAgent Systems. Chapter 11 - Multi-Agent Interactions
COMP310 MultiAgent Systems Chapter 11 - Multi-Agent Interactions What are Multi-Agent Systems? KEY organisational relationship interaction agent Environment sphere of influence 2 What are Multi-Agent Systems?
6.254 : Game Theory with Engineering Applications Lecture 1: Introduction
6.254 : Game Theory with Engineering Applications Lecture 1: Introduction Asu Ozdaglar MIT February 2, 2010 1 Introduction Optimization Theory: Optimize a single objective over a decision variable x R
Week 7 - Game Theory and Industrial Organisation
Week 7 - Game Theory and Industrial Organisation The Cournot and Bertrand models are the two basic templates for models of oligopoly; industry structures with a small number of firms. There are a number
Infinitely Repeated Games with Discounting Ù
Infinitely Repeated Games with Discounting Page 1 Infinitely Repeated Games with Discounting Ù Introduction 1 Discounting the future 2 Interpreting the discount factor 3 The average discounted payoff 4
Algebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.
Linear Programming: Chapter 11 Game Theory
Linear Programming: Chapter 11 Game Theory Robert J. Vanderbei October 17, 2007 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544 http://www.princeton.edu/ rvdb Rock-Paper-Scissors
Course Outline. Parental care and sexual conflict. Papers for 22 October. What is sexual conflict? 10/19/2009
Parental and sexual conflict Course Outline 1. Sexual selection * 2. Parent offspring conflict * 3. Sexual conflict over parental René van Dijk Email: [email protected] 19 October 2009 4. Genomic
Parental care and sexual conflict. Email: [email protected]
Parental care and sexual conflict René van Dijk Email: [email protected] Papers for 15 November Team 1 Royle,, N. J., I. R. Hartley & G. A. Parker. 2002. Sexual conflict reduces offspring fitness
Cournot s model of oligopoly
Cournot s model of oligopoly Single good produced by n firms Cost to firm i of producing q i units: C i (q i ), where C i is nonnegative and increasing If firms total output is Q then market price is P(Q),
Principled Negotiation and the Negotiator s Dilemma is the Getting to Yes -approach too soft?
Principled Negotiation and the Negotiator s Dilemma is the Getting to Yes -approach too soft? Paper presented at the Interdisciplinary Research Seminar on Negotiation, Harvard University, May 2001 by Rasmus
Question 2: How do you solve a matrix equation using the matrix inverse?
Question : How do you solve a matrix equation using the matrix inverse? In the previous question, we wrote systems of equations as a matrix equation AX B. In this format, the matrix A contains the coefficients
When Machine Learning Meets AI and Game Theory
1 When Machine Learning Meets AI and Game Theory Anurag Agrawal, Deepak Jaiswal Abstract We study the problem of development of intelligent machine learning applications to exploit the problems of adaptation
1. Write the number of the left-hand item next to the item on the right that corresponds to it.
1. Write the number of the left-hand item next to the item on the right that corresponds to it. 1. Stanford prison experiment 2. Friendster 3. neuron 4. router 5. tipping 6. small worlds 7. job-hunting
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
DATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
A Game Theoretical Framework for Adversarial Learning
A Game Theoretical Framework for Adversarial Learning Murat Kantarcioglu University of Texas at Dallas Richardson, TX 75083, USA muratk@utdallas Chris Clifton Purdue University West Lafayette, IN 47907,
Chapter 9 Experience rating
0 INTRODUCTION 1 Chapter 9 Experience rating 0 Introduction The rating process is the process of deciding on an appropriate level of premium for a particular class of insurance business. The contents of
CPC/CPA Hybrid Bidding in a Second Price Auction
CPC/CPA Hybrid Bidding in a Second Price Auction Benjamin Edelman Hoan Soo Lee Working Paper 09-074 Copyright 2008 by Benjamin Edelman and Hoan Soo Lee Working papers are in draft form. This working paper
3.2 Roulette and Markov Chains
238 CHAPTER 3. DISCRETE DYNAMICAL SYSTEMS WITH MANY VARIABLES 3.2 Roulette and Markov Chains In this section we will be discussing an application of systems of recursion equations called Markov Chains.
1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.
Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S
Stochastic dynamics of invasion and fixation
Stochastic dynamics of invasion and fixation Arne Traulsen, 1 Martin A. Nowak, 1,2 and Jorge M. Pacheco 1,3 1 Program for Evolutionary Dynamics, Harvard University, Cambridge, Massachusetts 02138, USA
Oligopoly: How do firms behave when there are only a few competitors? These firms produce all or most of their industry s output.
Topic 8 Chapter 13 Oligopoly and Monopolistic Competition Econ 203 Topic 8 page 1 Oligopoly: How do firms behave when there are only a few competitors? These firms produce all or most of their industry
Compact Representations and Approximations for Compuation in Games
Compact Representations and Approximations for Compuation in Games Kevin Swersky April 23, 2008 Abstract Compact representations have recently been developed as a way of both encoding the strategic interactions
MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
A simple analysis of the TV game WHO WANTS TO BE A MILLIONAIRE? R
A simple analysis of the TV game WHO WANTS TO BE A MILLIONAIRE? R Federico Perea Justo Puerto MaMaEuSch Management Mathematics for European Schools 94342 - CP - 1-2001 - DE - COMENIUS - C21 University
Bonus Maths 2: Variable Bet Sizing in the Simplest Possible Game of Poker (JB)
Bonus Maths 2: Variable Bet Sizing in the Simplest Possible Game of Poker (JB) I recently decided to read Part Three of The Mathematics of Poker (TMOP) more carefully than I did the first time around.
If, under a given assumption, the of a particular observed is extremely. , we conclude that the is probably not
4.1 REVIEW AND PREVIEW RARE EVENT RULE FOR INFERENTIAL STATISTICS If, under a given assumption, the of a particular observed is extremely, we conclude that the is probably not. 4.2 BASIC CONCEPTS OF PROBABILITY
How To Understand And Solve A Linear Programming Problem
At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,
Oligopoly. Oligopoly is a market structure in which the number of sellers is small.
Oligopoly Oligopoly is a market structure in which the number of sellers is small. Oligopoly requires strategic thinking, unlike perfect competition, monopoly, and monopolistic competition. Under perfect
Introduction. Bargaining - whether over arms control, the terms of a peace settlement, exchange rate
Bargaining in International Relations Introduction Bargaining - whether over arms control, the terms of a peace settlement, exchange rate coordination, alliances, or trade agreements - is a central feature
Linear-Quadratic Optimal Controller 10.3 Optimal Linear Control Systems
Linear-Quadratic Optimal Controller 10.3 Optimal Linear Control Systems In Chapters 8 and 9 of this book we have designed dynamic controllers such that the closed-loop systems display the desired transient
1 Portfolio Selection
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture # Scribe: Nadia Heninger April 8, 008 Portfolio Selection Last time we discussed our model of the stock market N stocks start on day with
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
Minimax Strategies. Minimax Strategies. Zero Sum Games. Why Zero Sum Games? An Example. An Example
Everyone who has studied a game like poker knows the importance of mixing strategies With a bad hand, you often fold But you must bluff sometimes Lectures in Microeconomics-Charles W Upton Zero Sum Games
Linear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
Econ 430 Lecture 9: Games on Networks
Alper Duman Izmir University Economics, May 10, 2013 Semi-Anonymous Graphical Games refer to games on networks in which agents observe what their neighbours do The number of agents taking a specific action
Local stability under evolutionary game dynamics
Theoretical Economics 5 (2010), 27 50 1555-7561/20100027 Local stability under evolutionary game dynamics William H. Sandholm Department of Economics, University of Wisconsin We prove that any regular
Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013
Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,
Linear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
Solving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
Game Theory: Supermodular Games 1
Game Theory: Supermodular Games 1 Christoph Schottmüller 1 License: CC Attribution ShareAlike 4.0 1 / 22 Outline 1 Introduction 2 Model 3 Revision questions and exercises 2 / 22 Motivation I several solution
Games and Strategic Behavior. Chapter 9. Learning Objectives
Games and Strategic Behavior Chapter 9 McGraw-Hill/Irwin Copyright 2013 by The McGraw-Hill Companies, Inc. All rights reserved. Learning Objectives 1. List the three basic elements of a game. Recognize
6.042/18.062J Mathematics for Computer Science. Expected Value I
6.42/8.62J Mathematics for Computer Science Srini Devadas and Eric Lehman May 3, 25 Lecture otes Expected Value I The expectation or expected value of a random variable is a single number that tells you
Section 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.
Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than
Congestion Games with Player-Specific Payoff Functions
GAMES AND ECONOMIC BEHAVIOR 13, 111 124 (1996) ARTICLE NO. 0027 Congestion Games with Player-Specific Payoff Functions Igal Milchtaich Department of Mathematics, The Hebrew University of Jerusalem, Jerusalem
ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015
ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2015 These notes have been used before. If you can still spot any errors or have any suggestions for improvement, please let me know. 1
Answer: The relationship cannot be determined.
Question 1 Test 2, Second QR Section (version 3) In City X, the range of the daily low temperatures during... QA: The range of the daily low temperatures in City X... QB: 30 Fahrenheit Arithmetic: Ranges
SOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
Section 8.2 Solving a System of Equations Using Matrices (Guassian Elimination)
Section 8. Solving a System of Equations Using Matrices (Guassian Elimination) x + y + z = x y + 4z = x 4y + z = System of Equations x 4 y = 4 z A System in matrix form x A x = b b 4 4 Augmented Matrix
Dynamics and Equilibria
Dynamics and Equilibria Sergiu Hart Presidential Address, GAMES 2008 (July 2008) Revised and Expanded (November 2009) Revised (2010, 2011, 2012, 2013) SERGIU HART c 2008 p. 1 DYNAMICS AND EQUILIBRIA Sergiu
6.3 Conditional Probability and Independence
222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model 1 September 004 A. Introduction and assumptions The classical normal linear regression model can be written
Oligopoly and Strategic Pricing
R.E.Marks 1998 Oligopoly 1 R.E.Marks 1998 Oligopoly Oligopoly and Strategic Pricing In this section we consider how firms compete when there are few sellers an oligopolistic market (from the Greek). Small
Market Structure: Duopoly and Oligopoly
WSG10 7/7/03 4:24 PM Page 145 10 Market Structure: Duopoly and Oligopoly OVERVIEW An oligopoly is an industry comprising a few firms. A duopoly, which is a special case of oligopoly, is an industry consisting
Do not open this exam until told to do so.
Do not open this exam until told to do so. Department of Economics College of Social and Applied Human Sciences K. Annen, Winter 004 Final (Version ): Intermediate Microeconomics (ECON30) Solutions Final
0.0.2 Pareto Efficiency (Sec. 4, Ch. 1 of text)
September 2 Exercises: Problem 2 (p. 21) Efficiency: p. 28-29: 1, 4, 5, 6 0.0.2 Pareto Efficiency (Sec. 4, Ch. 1 of text) We discuss here a notion of efficiency that is rooted in the individual preferences
7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
Algebra 1 Course Title
Algebra 1 Course Title Course- wide 1. What patterns and methods are being used? Course- wide 1. Students will be adept at solving and graphing linear and quadratic equations 2. Students will be adept
F Matrix Calculus F 1
F Matrix Calculus F 1 Appendix F: MATRIX CALCULUS TABLE OF CONTENTS Page F1 Introduction F 3 F2 The Derivatives of Vector Functions F 3 F21 Derivative of Vector with Respect to Vector F 3 F22 Derivative
Markov Chains for the RISK Board Game Revisited. Introduction. The Markov Chain. Jason A. Osborne North Carolina State University Raleigh, NC 27695
Markov Chains for the RISK Board Game Revisited Jason A. Osborne North Carolina State University Raleigh, NC 27695 Introduction Probabilistic reasoning goes a long way in many popular board games. Abbott
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
Introduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
Torgerson s Classical MDS derivation: 1: Determining Coordinates from Euclidean Distances
Torgerson s Classical MDS derivation: 1: Determining Coordinates from Euclidean Distances It is possible to construct a matrix X of Cartesian coordinates of points in Euclidean space when we know the Euclidean
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections
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
Power Rankings: Math for March Madness
Power Rankings: Math for March Madness James A. Swenson University of Wisconsin Platteville [email protected] March 5, 2011 Math Club Madison Area Technical College James A. Swenson (UWP) Power Rankings:
Extreme cases. In between cases
CHAPTER 16 OLIGOPOLY FOUR TYPES OF MARKET STRUCTURE Extreme cases PERFECTLY COMPETITION Many firms No barriers to entry Identical products MONOPOLY One firm Huge barriers to entry Unique product In between
13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms
Evolution leads to Kantian morality
Evolution leads to Kantian morality Ingela Alger (Toulouse School of Economics and IAST) Jörgen Weibull (Stockholm School of Economics and IAST) Oslo, 6 October 6, 2015 Introduction For decades economics
Higher Education Math Placement
Higher Education Math Placement Placement Assessment Problem Types 1. Whole Numbers, Fractions, and Decimals 1.1 Operations with Whole Numbers Addition with carry Subtraction with borrowing Multiplication
