CH 6 Problems
Answers
1. Below is a constant-sum simultaneous move game.
Navratilova
Evert
DL CC
DL 50 80
CC 90 20
Lob 70 60
Draw this game in an extensive form using information sets in two ways. First, make Evert the
first one to go. Second, make Navrat
LaunchPad Instructor's Manual
Goolsbee, Levitt, and Syverson,
Microeconomics
LaunchPad contains resources for you and your students. In this tutorial, we'll take a
detailed look at both types separately. Let's begin with student resources. Click here to
g
Counting Techniques:
Permutations of Selected
Elements
Addition Rule,
Difference Rule,
Inclusion/Exclusion Rule
1
Permutations of Selected Elements
Typical situation: A chairman, a secretary and a
treasurer are to be chosen in a committee of 7 people.
Q
Counting Techniques:
r-combinations with
repetition allowed,
Binomial theorem
1
Number of iterations of a nested loop
(First Situation)
Consider the following nested loop:
for i:=1 to n
for j:=1 to i-1
for k:=1 to j-1
[ Statements]
next k
next j
next i
Counting Techniques:
r-combinations with
repetition allowed,
Binomial theorem
1
Number of iterations of a nested loop
(First Situation)
Consider the following nested loop:
for i:=1 to n
for j:=1 to i-1
for k:=1 to j-1
[ Statements]
next k
next j
next i
Counting
Techniques:
Combinations
1
Combinations
Typical situation: How many 5-card hands
can be made from a deck of 52 cards?
Definition: r-combination of a set of n elements
is a subset of r of the n elements.
The number of all r-combinations
n
, C
Counting Techniques:
r-combinations with
repetition allowed,
Binomial theorem
1
Number of iterations of a nested loop
(First Situation)
Consider the following nested loop:
for i:=1 to n
for j:=1 to i-1
for k:=1 to j-1
[ Statements]
next k
next j
next i
Counting Techniques:
r-combinations with
repetition allowed,
Binomial theorem
1
Number of iterations of a nested loop
(First Situation)
Consider the following nested loop:
for i:=1 to n
for j:=1 to i-1
for k:=1 to j-1
[ Statements]
next k
next j
next i
Counting Techniques:
r-combinations with
repetition allowed,
Binomial theorem
1
Number of iterations of a nested loop
(First Situation)
Consider the following nested loop:
for i:=1 to n
for j:=1 to i-1
for k:=1 to j-1
[ Statements]
next k
next j
next i
Nom_
Make two complete and logical sentence by reorganizing these sentence parts.
Ex. Serge et Martin / librairie / lire (read) Serge et Martin vont la librairie. Ils vont lire.
1. Nous / parc / explorer le parc
_
2. Vronique / gymnase / patiner
_
3. Hlne
Below are seven functions of integer variable n. Sort these functions in increasing order
of their running times.
( a ) n 2 2 n n 3 (b) 0.1 5.5
log
n
(e) 7 log 2 n
3
(f)
(1.5) n
1500
(c) n 1.5
1
n!
4
( g ) 3n log 2 n
(d ) log 2 n 7 n
Suppose that in a particular quarter there are students taking each of the following
combinations of courses:
Math, English, Biology
Math, French, Computer Science
Biology, Computer Science, History
Biology, Psychology
What is the minimum number of ex
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
Molecular Evolution
An Introduction to Bioinformatics Algorithms
Outline
Evolutionary Tree Reconstruction
Out of Africa hypothesis
Did we evolve from Neanderthals?
Distance Based Phylogen
ECON 3040: Intermediate Macroeconomics
Spring 2016
Ohio University
Macroeconomic Issues
Macroeconomics, the study of the economy as a
whole, addresses many topical issues, e.g.:
What causes recessions?
What is the government budget deficit ? How does it
Determinants of National Income
IN THIS CHAPTER, YOU WILL LEARN:
what determines the economys total output/income
how the prices of the factors of production are
determined
how total income is distributed
what determines the demand for goods and se
Counting
Techniques:
Combinations
1
Combinations
Typical situation: How many 5-card hands
can be made from a deck of 52 cards?
Definition: r-combination of a set of n elements
is a subset of r of the n elements.
The number of all r-combinations
n
, C
Counting Techniques:
Possibility Trees,
Multiplication Rule,
Permutations
1
Possibility Trees
In a tennis match, the first player to win two sets, wins the game.
Question: What is the probability that player A will win
the game in 3 sets?
Construct poss
Counting Techniques:
Permutations of Selected
Elements
Addition Rule,
Difference Rule,
Inclusion/Exclusion Rule
1
Permutations of Selected Elements
Typical situation: A chairman, a secretary and a
treasurer are to be chosen in a committee of 7 people.
Q
Ch 5 Problems
Answers
1. Two companies, X and Y, that are in the same market face the following demand curves:
QX=14-PX+PY and QY=8-2PY+PX. X has a per unit cost of $4 and Y has a per unit cost of $2.
a. Are the companies products substitutes or complemen
Ch 7 Problems
Answers
1. Find Nash equilibria in mixed strategies for the following zero-sum games. Denote Rows
mixture by p and columns mixture by q. Do the following steps: (i) For each player, show her
expected payoffs from each of her pure strategies
Ch. 9, Part 1
Problem Answers
1. Consider the following Assurance game:
Hunter 2
Hunter 1
Hunt a deer Hunt a hare
Hunt a deer 10, 10
0, 4
Hunt a hare 4, 0
4, 4
Assume this game is played in two stages. In stage 1, Hunter 1 can send a cheap message that
sp
Chapter 6
Combining Sequential and Simultaneous Move Games
Before starting the main topic, lets introduce information sets.
Recall that game trees (extensive forms) are used to analyze sequential move games and
payoff tables (game matrices, normal/strateg
Bienvenue au cours de
Franais 1110!
Je mappelle Amanda Schreckengost.
Je suis votre professeur de franais.
Texte obligatoire
(ncessaire)
ESPACES: Rendez-vous avec le
monde francophone, 3me dition
Accs au Supersite plus et au WebSAM
(sur Internet)
TOUTES
Annoucements
Conversation Hour!
Every Thursday from 7pm-8pm at
Jackie Os
Join the FB group: Ohio University
French Conversation Hour
Unofficial slogan: Its not scary, its fun!
Les noms (nouns)
Quest-ce quun nom (noun)?
Les personnes
Le professeur, lac
Devoir (homework):demain
Il y a trois activits pour demain 2h00 sur le
supersite.
Quiz Vendredi (Friday)
Lalphabet
Salutations/leaving takings
Numbers (Il y a .)
Les sons et les lettres (pg 23)
(La prononciation)
Ne prononcez pas des consonnes finale
Announces
French Tutoring: Everyday! FREE!
Devoirs: Une activit sur le supersite pour
vendredi 2h00.
Converation hour demain! 7pm at Jackie Os.
Les Structures
Leon 1B
Subject pronouns
Le verbe tre
Une rvision:
Comment allez-vous?
How are you doing?
Je vai
Economics 101
Summer 2011
Answers to Homework #4
Due Thursday June 11, 2011
Homework is due at the beginning of the lecture. All homework should be neatly and professionally done.
Please make sure that your name is clearly legible and that you show all of
Coloring Graphs
This handout:
Coloring maps and graphs
Chromatic number
Applications of graph coloring
Coloring maps
Color a map such that two regions with a common border
are assigned different colors.
Each map can be represented by a graph:
Each r
Coloring Graphs
This handout:
Coloring maps and graphs
Chromatic number
Applications of graph coloring
Coloring maps
Color a map such that two regions with a common border
are assigned different colors.
Each map can be represented by a graph:
Each r