Bạn đang xem bản rút gọn của tài liệu. Xem và tải ngay bản đầy đủ của tài liệu tại đây (72.19 KB, 1 trang )
492 PART 3 • Market Structure and Competitive Strategy
13.3 The Nash Equilibrium Revisited
In §12.2, we explain that
the Cournot equilibrium is
a Nash equilibrium in which
each firm correctly assumes
how much its competitor will
produce.
To determine the likely outcome of a game, we have been seeking “self-enforcing,” or “stable” strategies. Dominant strategies are stable, but in many games,
one or more players do not have a dominant strategy. We therefore need a more
general equilibrium concept. In Chapter 12, we introduced the concept of a Nash
equilibrium and saw that it is widely applicable and intuitively appealing.5
Recall that a Nash equilibrium is a set of strategies (or actions) such that each
player is doing the best it can given the actions of its opponents. Because each player
has no incentive to deviate from its Nash strategy, the strategies are stable. In the
example shown in Table 13.2, the Nash equilibrium is that both firms advertise:
Given the decision of its competitor, each firm is satisfied that it has made the
best decision possible, and so has no incentive to change its decision.
In Chapter 12, we used the Nash equilibrium to study output and pricing by
oligopolistic firms. In the Cournot model, for example, each firm sets its own
output while taking the outputs of its competitors as fixed. We saw that in a
Cournot equilibrium, no firm has an incentive to change its output unilaterally
because each firm is doing the best it can given the decisions of its competitors.
Thus a Cournot equilibrium is a Nash equilibrium.6 We also examined models in which firms choose price, taking the prices of their competitors as fixed.
Again, in the Nash equilibrium, each firm is earning the largest profit it can
given the prices of its competitors, and thus has no incentive to change its price.
It is helpful to compare the concept of a Nash equilibrium with that of an
equilibrium in dominant strategies: