Chapter 10 Flashcards

1
Q

Marra’s Definition of Nash

A

each player is doing the best they can do given what the other player is doing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Value To Cooperation Formula

A
        i
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Value To Cheating

A

Profit(Cheating)- Profit(Cooperation)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

In what condition does cheating make sense

A

profit(cheating)-profit(cooperation)> profit(cooperation)-profit(nash)/i

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Interest Formula

A

profit(cheat)-profit(cooperation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Explain the relationship between profit and interest

A

…….notes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Nash equilibrium

A
A condition
describing a set of
strategies in which
no player can
improve her
payoff by
unilaterally
changing her own
strategy, given the
other players’
strategies.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Principle: Put Yourself in Your Rival’s Shoes

A

If you do not have a dominant strategy, look at the game from your rival’s perspective. If
your rival has a dominant strategy, anticipate that he or she will play

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Principle: Play Your Dominant Strategy

A

Check to see if you have a dominant strategy. If you have one, play it.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

dominant

strategy

A
A strategy that
results in the
highest payoff to a
player regardless
of the opponent’s
action.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

simultaneous move

game

A
Game in which
each player makes
decisions without
knowledge of the
other players’
decisions.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Example of Sequential Move Games

A
  • tic tac toe
  • chess
  • checkers
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Examples of Simultaneous Move Games

A
  • rock, paper, and scissors

- dueling

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Value Formula: Cooperation

A
             i
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Value Formula: Cheating

A

Profit Cheat - Profit Cooperation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Rational For Cheating Equation

A

Profit Cheat - Profit Cooperation ————> Profit Cooperation - Profit Nash /i

17
Q

Interest Formula

A

Profit Cheat- Profit Cooperation

18
Q

when the interest

rate is low, firms may find it in their interest to

A

collude and charge high prices,

unlike in the case of a one-shot game.

19
Q

How is finitely repeated unknown similar to infinitely repeated?

A

the analysis of each is the same

20
Q

Finite Games Unknown Formula

A

Profit cheat= (profit cooperation )/θ

21
Q

Finite Known: If Finite is know how will game be played

A

from Nash equilibrium

22
Q

Collusive Points

A
  • number of firms(preferably small)
  • detection of cheating
  • cost of retaliation
  • credible threat
  • predictable demand conditions
23
Q

Elaborate on the Factors That Affect Collusion

A
  • number of firms(preferably small)
  • detection of cheating
  • cost of retaliation
  • credible threat
  • predictable demand conditions
24
Q

Factors That Affect Collusion

A
  • number of firms(preferably small)
  • detection of cheating
  • cost of retaliation
  • credible threat
  • predictable demand conditions
25
Q

What is the best decision in simultaneous one-shot move games?

A

chose the dominant strategy

26
Q

The Mindset of A One-Shot Game

A

any gains must be had today or not at all

27
Q

The Mind Set of Infinitely Repeated

A

-firms must weigh the benefits of current actions versus against the future costs of those actions

28
Q

Why don’t firms usually collude in finite?

A

because they know the game is eventually coming to an end

29
Q

trigger strategy

A
A strategy that is
contingent on the
past play of a
game and in
which some
particular past
action “triggers” a
different action by
a player.
30
Q

Hotelling’s law

A

predicts that a street with two shops will also find both shops right next to each other at the same halfway point. Each shop will serve half the market; one will draw customers from the north, the other all customers from the south.

31
Q

sequential-move

game

A
Game in which
one player makes
a move after
observing the
other player’s
move.