15. Coase’s Theory of the Firm #

Contents

Coase’s Theory of the Firm

In addition to what’s in Anaconda, this lecture will need the following libraries:

!pip install interpolation

15.1. Overview #

In 1937, Ronald Coase wrote a brilliant essay on the nature of the firm [Coa37].

Coase was writing at a time when the Soviet Union was rising to become a significant industrial power.

At the same time, many free-market economies were afflicted by a severe and painful depression.

This contrast led to an intensive debate on the relative merits of decentralized, price-based allocation versus top-down planning.

In the midst of this debate, Coase made an important observation: even in free-market economies, a great deal of top-down planning does in fact take place.

This is because firms form an integral part of free-market economies and, within firms, allocation is by planning.

In other words, free-market economies blend both planning (within firms) and decentralized production coordinated by prices.

The question Coase asked is this: if prices and free markets are so efficient, then why do firms even exist?

Couldn’t the associated within-firm planning be done more efficiently by the market?

We’ll use the following imports:

import numpy as np
import matplotlib.pyplot as plt
%matplotlib inline
from scipy.optimize import fminbound
from interpolation import interp

/usr/share/miniconda3/envs/quantecon/lib/python3.11/site-packages/numba/core/decorators.py:262: NumbaDeprecationWarning: numba.generated_jit is deprecated. Please see the documentation at: https://numba.readthedocs.io/en/stable/reference/deprecation.html#deprecation-of-generated-jit for more information and advice on a suitable replacement.
  warnings.warn(msg, NumbaDeprecationWarning)

15.1.1. Why Firms Exist#

On top of asking a deep and fascinating question, Coase also supplied an illuminating answer: firms exist because of transaction costs.

Here’s one example of a transaction cost:

Suppose agent A is considering setting up a small business and needs a web developer to construct and help run an online store.

She can use the labor of agent B, a web developer, by writing up a freelance contract for these tasks and agreeing on a suitable price.

But contracts like this can be time-consuming and difficult to verify

How will agent A be able to specify exactly what she wants, to the finest detail, when she herself isn’t sure how the business will evolve?
And what if she isn’t familiar with web technology? How can she specify all the relevant details?
And, if things go badly, will failure to comply with the contract be verifiable in court?

In this situation, perhaps it will be easier to employ agent B under a simple labor contract.

The cost of this contract is far smaller because such contracts are simpler and more standard.

The basic agreement in a labor contract is: B will do what A asks him to do for the term of the contract, in return for a given salary.

Making this agreement is much easier than trying to map every task out in advance in a contract that will hold up in a court of law.

So agent A decides to hire agent B and a firm of nontrivial size appears, due to transaction costs.

15.1.2. A Trade-Off#

Actually, we haven’t yet come to the heart of Coase’s investigation.

The issue of why firms exist is a binary question: should firms have positive size or zero size?

A better and more general question is: what determines the size of firms?

The answer Coase came up with was that “a firm will tend to expand until the costs of organizing an extra transaction within the firm become equal to the costs of carrying out the same transaction by means of an exchange on the open market…” ([Coa37], p. 395).

But what are these internal and external costs?

In short, Coase envisaged a trade-off between

transaction costs, which add to the expense of operating between firms, and
diminishing returns to management, which adds to the expense of operating within firms

We discussed an example of transaction costs above (contracts).

The other cost, diminishing returns to management, is a catch-all for the idea that big operations are increasingly costly to manage.

For example, you could think of management as a pyramid, so hiring more workers to implement more tasks requires expansion of the pyramid, and hence labor costs grow at a rate more than proportional to the range of tasks.

Diminishing returns to management makes in-house production expensive, favoring small firms.

15.1.3. Summary#

Here’s a summary of our discussion:

Firms grow because transaction costs encourage them to take some operations in house.
But as they get large, in-house operations become costly due to diminishing returns to management.
The size of firms is determined by balancing these effects, thereby equalizing the marginal costs of each form of operation.

15.1.4. A Quantitative Interpretation#

Coases ideas were expressed verbally, without any mathematics.

In fact, his essay is a wonderful example of how far you can get with clear thinking and plain English.

However, plain English is not good for quantitative analysis, so let’s bring some mathematical and computation tools to bear.

In doing so we’ll add a bit more structure than Coase did, but this price will be worth paying.

Our exposition is based on [KNS18].

15.2. The Model #

The model we study involves production of a single unit of a final good.

Production requires a linearly ordered chain, requiring sequential completion of a large number of processing stages.

The stages are indexed by \(t \in [0,1]\), with \(t=0\) indicating that no tasks have been undertaken and \(t=1\) indicating that the good is complete.

15.2.1. Subcontracting#

The subcontracting scheme by which tasks are allocated across firms is illustrated in the figure below

In this example,

Firm 1 receives a contract to sell one unit of the completed good to a final buyer.
Firm 1 then forms a contract with firm 2 to purchase the partially completed good at stage \(t_1\), with the intention of implementing the remaining \(1 - t_1\) tasks in-house (i.e., processing from stage \(t_1\) to stage \(1\)).
Firm 2 repeats this procedure, forming a contract with firm 3 to purchase the good at stage \(t_2\).
Firm 3 decides to complete the chain, selecting \(t_3 = 0\).

At this point, production unfolds in the opposite direction (i.e., from upstream to downstream).

Firm 3 completes processing stages from \(t_3 = 0\) up to \(t_2\) and transfers the good to firm 2.
Firm 2 then processes from \(t_2\) up to \(t_1\) and transfers the good to firm 1,
Firm 1 processes from \(t_1\) to \(1\) and delivers the completed good to the final buyer.

The length of the interval of stages (range of tasks) carried out by firm \(i\) is denoted by \(\ell_i\).

Each firm chooses only its upstream boundary, treating its downstream boundary as given.

The benefit of this formulation is that it implies a recursive structure for the decision problem for each firm.

In choosing how many processing stages to subcontract, each successive firm faces essentially the same decision problem as the firm above it in the chain, with the only difference being that the decision space is a subinterval of the decision space for the firm above.

We will exploit this recursive structure in our study of equilibrium.

15.2.2. Costs#

Recall that we are considering a trade-off between two types of costs.

Let’s discuss these costs and how we represent them mathematically.

Diminishing returns to management means rising costs per task when a firm expands the range of productive activities coordinated by its managers.

We represent these ideas by taking the cost of carrying out \(\ell\) tasks in-house to be \(c(\ell)\), where \(c\) is increasing and strictly convex.

Thus, the average cost per task rises with the range of tasks performed in-house.

We also assume that \(c\) is continuously differentiable, with \(c(0)=0\) and \(c'(0) > 0\).

Transaction costs are represented as a wedge between the buyer’s and seller’s prices.

It matters little for us whether the transaction cost is borne by the buyer or the seller.

Here we assume that the cost is borne only by the buyer.

In particular, when two firms agree to a trade at face value \(v\), the buyer’s total outlay is \(\delta v\), where \(\delta > 1\).

The seller receives only \(v\), and the difference is paid to agents outside the model.

15.3. Equilibrium #

We assume that all firms are ex-ante identical and act as price takers.

As price takers, they face a price function \(p\), which is a map from \([0, 1]\) to \(\mathbb R_+\), with \(p(t)\) interpreted as the price of the good at processing stage \(t\).

There is a countable infinity of firms indexed by \(i\) and no barriers to entry.

The cost of supplying the initial input (the good processed up to stage zero) is set to zero for simplicity.

Free entry and the infinite fringe of competitors rule out positive profits for incumbents, since any incumbent could be replaced by a member of the competitive fringe filling the same role in the production chain.

Profits are never negative in equilibrium because firms can freely exit.

15.3.1. Informal Definition of Equilibrium#

An equilibrium in this setting is an allocation of firms and a price function such that

all active firms in the chain make zero profits, including suppliers of raw materials
no firm in the production chain has an incentive to deviate, and
no inactive firms can enter and extract positive profits

15.3.2. Formal Definition of Equilibrium#

Let’s make this definition more formal.

(You might like to skip this section on first reading)

An allocation of firms is a nonnegative sequence \(\{\ell_i\}_{i \in \mathbb N}\) such that \(\ell_i=0\) for all sufficiently large \(i\).

Recalling the figures above,

\(\ell_i\) represents the range of tasks implemented by the \(i\)-th firm

As a labeling convention, we assume that firms enter in order, with firm 1 being the furthest downstream.

An allocation \(\{\ell_i\}\) is called feasible if \(\sum_{\, i \geq 1} \ell_i = 1\).

In a feasible allocation, the entire production process is completed by finitely many firms.

Given a feasible allocation, \(\{\ell_i\}\), let \(\{t_i\}\) represent the corresponding transaction stages, defined by

(15.1)#\[t_0 = s \quad \text{and} \quad t_i = t_{i-1} - \ell_i\]

In particular, \(t_{i-1}\) is the downstream boundary of firm \(i\) and \(t_i\) is its upstream boundary.

As transaction costs are incurred only by the buyer, its profits are

(15.2)#\[\pi_i = p(t_{i-1}) - c(\ell_i) - \delta p(t_i)\]

Given a price function \(p\) and a feasible allocation \(\{\ell_i\}\), let

\(\{t_i\}\) be the corresponding firm boundaries.
\(\{\pi_i\}\) be corresponding profits, as defined in (15.2).

This price-allocation pair is called an equilibrium for the production chain if

\(\; p(0) = 0\),
\(\; \pi_i = 0\) for all \(i\), and
\(p(s) - c(s - t) - \delta p(t) \leq 0\) for any pair \(s, t\) with \(0 \leq s \leq t \leq 1\).

The rationale behind these conditions was given in our informal definition of equilibrium above.

15.4. Existence, Uniqueness and Computation of Equilibria #

We have defined an equilibrium but does one exist? Is it unique? And, if so, how can we compute it?

15.4.1. A Fixed Point Method#

To address these questions, we introduce the operator \(T\) mapping a nonnegative function \(p\) on \([0, 1]\) to \(Tp\) via

(15.3)#\[Tp(s) = \min_{t \leq s} \, \{ c(s-t) + \delta p(t) \} \quad \text{for all} \quad s \in [0,1].\]

Here and below, the restriction \(0 \leq t\) in the minimum is understood.

The operator \(T\) is similar to a Bellman operator.

Under this analogy, \(p\) corresponds to a value function and \(\delta\) to a discount factor.

But \(\delta > 1\), so \(T\) is not a contraction in any obvious metric, and in fact, \(T^n p\) diverges for many choices of \(p\).

Nevertheless, there exists a domain on which \(T\) is well-behaved: the set of convex increasing continuous functions \(p \colon [0,1] \to \mathbb R\) such that \(c'(0) s \leq p(s) \leq c(s)\) for all \(0 \leq s \leq 1\).

We denote this set of functions by \(\mathcal P\).

In [KNS18] it is shown that the following statements are true:

\(T\) maps \(\mathcal P\) into itself.
\(T\) has a unique fixed point in \(\mathcal P\), denoted below by \(p^*\).
For all \(p \in \mathcal P\) we have \(T^k p \to p^*\) uniformly as \(k \to \infty\).

Now consider the choice function

(15.4)#\[t^*(s) := \text{ the solution to } \min_{ t \leq s} \{c(s - t) + \delta p^*(t) \}\]

By definition, \(t^*(s)\) is the cost-minimizing upstream boundary for a firm that is contracted to deliver the good at stage \(s\) and faces the price function \(p^*\).

Since \(p^*\) lies in \(\mathcal P\) and since \(c\) is strictly convex, it follows that the right-hand side of (15.4) is continuous and strictly convex in \(t\).

Hence the minimizer \(t^*(s)\) exists and is uniquely defined.

We can use \(t^*\) to construct an equilibrium allocation as follows:

Recall that firm 1 sells the completed good at stage \(s=1\), its optimal upstream boundary is \(t^*(1)\).

Hence firm 2’s optimal upstream boundary is \(t^*(t^*(1))\).

Continuing in this way produces the sequence \(\{t^*_i\}\) defined by

(15.5)#\[t_0^* = 1 \quad \text{and} \quad t_i^* = t^*(t_{i-1})\]

The sequence ends when a firm chooses to complete all remaining tasks.

We label this firm (and hence the number of firms in the chain) as

(15.6)#\[n^* := \inf \{i \in \mathbb N \,:\, t^*_i = 0\}\]

The task allocation corresponding to (15.5) is given by \(\ell_i^* := t_{i-1}^* - t_i^*\) for all \(i\).

In [KNS18] it is shown that

The value \(n^*\) in (15.6) is well-defined and finite,
the allocation \(\{\ell^*_i\}\) is feasible, and
the price function \(p^*\) and this allocation together forms an equilibrium for the production chain.

While the proofs are too long to repeat here, much of the insight can be obtained by observing that, as a fixed point of \(T\), the equilibrium price function must satisfy

(15.7)#\[p^*(s) = \min_{t \leq s} \, \{ c(s - t) + \delta p^*(t) \} \quad \text{for all} \quad s \in [0, 1]\]

From this equation, it is clear that so profits are zero for all incumbent firms.

15.4.2. Marginal Conditions#

We can develop some additional insights on the behavior of firms by examining marginal conditions associated with the equilibrium.

As a first step, let \(\ell^*(s) := s - t^*(s)\).

This is the cost-minimizing range of in-house tasks for a firm with downstream boundary \(s\).

In [KNS18] it is shown that \(t^*\) and \(\ell^*\) are increasing and continuous, while \(p^*\) is continuously differentiable at all \(s \in (0, 1)\) with

(15.8)#\[(p^*)'(s) = c'(\ell^*(s))\]

Equation (15.8) follows from \(p^*(s) = \min_{t \leq s} \, \{ c(s-t) + \delta p^*(t) \}\) and the envelope theorem for derivatives.

A related equation is the first order condition for \(p^*(s) = \min_{t \leq s} \, \{ c(s-t) + \delta p^*(t) \}\), the minimization problem for a firm with upstream boundary \(s\), which is

(15.9)#\[\delta (p^*)'(t^*(s)) = c'(s - t^*(s))\]

This condition matches the marginal condition expressed verbally by Coase that we stated above:

“A firm will tend to expand until the costs of organizing an extra transaction within the firm become equal to the costs of carrying out the same transaction by means of an exchange on the open market…”

Combining (15.8) and (15.9) and evaluating at \(s=t_i\), we see that active firms that are adjacent satisfy

(15.10)#\[\delta \, c'(\ell^*_{i+1}) = c'(\ell^*_i)\]

In other words, the marginal in-house cost per task at a given firm is equal to that of its upstream partner multiplied by gross transaction cost.

This expression can be thought of as a Coase–Euler equation, which determines inter-firm efficiency by indicating how two costly forms of coordination (markets and management) are jointly minimized in equilibrium.

15.5. Implementation #

For most specifications of primitives, there is no closed-form solution for the equilibrium as far as we are aware.

However, we know that we can compute the equilibrium corresponding to a given transaction cost parameter \(\delta\) and a cost function \(c\) by applying the results stated above.

In particular, we can

fix initial condition \(p \in \mathcal P\),
iterate with \(T\) until \(T^n p\) has converged to \(p^*\), and
recover firm choices via the choice function (15.3)

At each iterate, we will use continuous piecewise linear interpolation of functions.

To begin, here’s a class to store primitives and a grid:

class ProductionChain:

    def __init__(self,
            n=1000,
            delta=1.05,
            c=lambda t: np.exp(10 * t) - 1):

        self.n, self.delta, self.c = n, delta, c
        self.grid = np.linspace(1e-04, 1, n)

Now let’s implement and iterate with \(T\) until convergence.

Recalling that our initial condition must lie in \(\mathcal P\), we set \(p_0 = c\)

def compute_prices(pc, tol=1e-5, max_iter=5000):
    """
    Compute prices by iterating with T

        * pc is an instance of ProductionChain
        * The initial condition is p = c

    """
    delta, c, n, grid = pc.delta, pc.c, pc.n, pc.grid
    p = c(grid)  # Initial condition is c(s), as an array
    new_p = np.empty_like(p)
    error = tol + 1
    i = 0

    while error > tol and i < max_iter:
        for j, s in enumerate(grid):
            Tp = lambda t: delta * interp(grid, p, t) + c(s - t)
            new_p[j] = Tp(fminbound(Tp, 0, s))
        error = np.max(np.abs(p - new_p))
        p = new_p
        i = i + 1

    if i < max_iter:
        print(f"Iteration converged in {i} steps")
    else:
        print(f"Warning: iteration hit upper bound {max_iter}")

    p_func = lambda x: interp(grid, p, x)
    return p_func

The next function computes optimal choice of upstream boundary and range of task implemented for a firm face price function p_function and with downstream boundary \(s\).

def optimal_choices(pc, p_function, s):
    """
    Takes p_func as the true function, minimizes on [0,s]

    Returns optimal upstream boundary t_star and optimal size of
    firm ell_star

    In fact, the algorithm minimizes on [-1,s] and then takes the
    max of the minimizer and zero. This results in better results
    close to zero

    """
    delta, c = pc.delta, pc.c
    f = lambda t: delta * p_function(t) + c(s - t)
    t_star = max(fminbound(f, -1, s), 0)
    ell_star = s - t_star
    return t_star, ell_star

The allocation of firms can be computed by recursively stepping through firms’ choices of their respective upstream boundary, treating the previous firm’s upstream boundary as their own downstream boundary.

In doing so, we start with firm 1, who has downstream boundary \(s=1\).

def compute_stages(pc, p_function):
    s = 1.0
    transaction_stages = [s]
    while s > 0:
        s, ell = optimal_choices(pc, p_function, s)
        transaction_stages.append(s)
    return np.array(transaction_stages)

Let’s try this at the default parameters.

The next figure shows the equilibrium price function, as well as the boundaries of firms as vertical lines

pc = ProductionChain()
p_star = compute_prices(pc)

transaction_stages = compute_stages(pc, p_star)

fig, ax = plt.subplots()

ax.plot(pc.grid, p_star(pc.grid))
ax.set_xlim(0.0, 1.0)
ax.set_ylim(0.0)
for s in transaction_stages:
    ax.axvline(x=s, c="0.5")
plt.show()

Iteration converged in 2 steps

_images/9162f9e3c4a7313317ba1600acee807bfc28173cc102d001baac29f4f9be5284.png

Here’s the function \(\ell^*\), which shows how large a firm with downstream boundary \(s\) chooses to be

ell_star = np.empty(pc.n)
for i, s in enumerate(pc.grid):
    t, e = optimal_choices(pc, p_star, s)
    ell_star[i] = e

fig, ax = plt.subplots()
ax.plot(pc.grid, ell_star, label="$\ell^*$")
ax.legend(fontsize=14)
plt.show()

_images/e1387171a985993fe48f24851b8ee5bdd05c8d1d3b6a981e9e3fef249989883f.png

Note that downstream firms choose to be larger, a point we return to below.

15.6. Exercises #

Exercise 15.1

The number of firms is endogenously determined by the primitives.

What do you think will happen in terms of the number of firms as \(\delta\) increases? Why?

Check your intuition by computing the number of firms at delta in (1.01, 1.05, 1.1).

Solution to Exercise 15.1

Here is one solution

for delta in (1.01, 1.05, 1.1):

   pc = ProductionChain(delta=delta)
   p_star = compute_prices(pc)
   transaction_stages = compute_stages(pc, p_star)
   num_firms = len(transaction_stages)
   print(f"When delta={delta} there are {num_firms} firms")

Iteration converged in 2 steps
When delta=1.01 there are 64 firms

Iteration converged in 2 steps
When delta=1.05 there are 41 firms

Iteration converged in 2 steps
When delta=1.1 there are 35 firms

Exercise 15.2

The value added of firm \(i\) is \(v_i := p^*(t_{i-1}) - p^*(t_i)\).

One of the interesting predictions of the model is that value added is increasing with downstreamness, as are several other measures of firm size.

Can you give any intution?

Try to verify this phenomenon (value added increasing with downstreamness) using the code above.

Solution to Exercise 15.2

Firm size increases with downstreamness because \(p^*\), the equilibrium price function, is increasing and strictly convex.

This means that, for a given producer, the marginal cost of the input purchased from the producer just upstream from itself in the chain increases as we go further downstream.

Hence downstream firms choose to do more in house than upstream firms — and are therefore larger.

The equilibrium price function is strictly convex due to both transaction costs and diminishing returns to management.

One way to put this is that firms are prevented from completely mitigating the costs associated with diminishing returns to management — which induce convexity — by transaction costs. This is because transaction costs force firms to have nontrivial size.

Here’s one way to compute and graph value added across firms

pc = ProductionChain()
p_star = compute_prices(pc)
stages = compute_stages(pc, p_star)

va = []

for i in range(len(stages) - 1):
    va.append(p_star(stages[i]) - p_star(stages[i+1]))

fig, ax = plt.subplots()
ax.plot(va, label="value added by firm")
ax.set_xticks((5, 25))
ax.set_xticklabels(("downstream firms", "upstream firms"))
plt.show()

Iteration converged in 2 steps

_images/bba70e269c36e40f4dd92be683ef253220c4d9868d70ff7ffd893ea5424ccdab.png