More Resources

Imperfect durability and the Coase conjecture.


by Deneckere, Raymond^Liang, Meng-Yu
RAND Journal of Economics • Spring, 2008 •

To prove (ii), suppose that [??] is a steady state so that P([??]) = [bar.v]. Then because P(*) is decreasing, and because (as shown in the proof of Lemma 1) P(y) [less than or equal to] [bar.v] for y [less than or equal to] [??], we have P(y) = [bar.v] for all y [member of] [0, [??]]. Hence Lemma 4 shows that y < [??] cannot be a steady state. We conclude that the only possible steady state other than [??] is 1.

To prove (iii), suppose that 0 < [y.sup.*] < [??] is a steady state. Then we must have P(y) = [v.bar] for all y [member of] [0, [y.sup.*]], so Lemma 4 implies that no y < [y.sup.*] can be a steady state, and that P(q) < [bar.v] for q [member of] ([y.sup.*], [??]] (otherwise [y.sup.*] could not be a steady state). Thus, by Lemma 1, no y [member of] ([y.sup.*], [??]] can be a steady state, leaving y = 1 as the only other possible steady state. Suppose y = 1 were not a steady state, so P(1) > [v.bar]. This would imply P(q) > [v.bar] for all q [member of] ([??], 1]. We can then use the argument at the end of the proof of Lemma 1 to obtain a contradiction. To prove (i), note that if there is no steady state in [0, [??]], then by the first paragraph, y = 1 is the only possible steady state. It then follows from Lemma 1 that y = 1 must be a steady state. Q.E.D

Proof of Theorem 4. For all i = 1, ..., N - 1, analogously to the two-step case, given [q.sub.i] as a steady state, construct a sequence [{[[??].sup.i.sub.k]}.sup.[infinity].sub.k=0] to the right of [q.sub.i] as follows. Let [[??].sup.i.sub.0] = (I - [mu])[q.sub.i] and let [[??].sup.i](q) = (l - [rho])f(q) + [rho]f([q.sub.i]) for q [greater than or equal to] [q.sub.i]. Given [[??].sup.i](*), let [[??].sup.i.sub.1] be the highest state such that the seller prefers selecting y = [q.sub.i] to selecting y [member of] ([q.sub.i], [[??].sup.i.sub.1]. For k [greater than or equal to] 2, let [[??].sup.i](q) be the seller's optimal choice over ([[??].sup.i.sub.k-2], [[??].sup.i.sub.k-1]] and redefine [[??].sup.i](q) = (1 - [rho])f(q) + [rho]f([[??].sup.i](q)) for q [greater than or equal to] [[??].sup.i.sub.k-1]. Finally, let [[??].sup.i.sub.k] be the highest state such that the seller prefers selecting y [member of] ([[??].sup.i.sub.k-2], [[??].sup.i.sub.k-1]] to selecting y [member of] ([[??].sup.i.sub.k-1], [[??].sup.i.sub.k]]. Let [[??].sup.i] (q) be the seller's payoff function associated with [[??].sup.i](q).

Also analogously to the two-step case, given [q.sub.i] as a steady state, construct a sequence {[[??].sup.i.sub.k]} to the left of [q.sub.i] as follows. Let [[bar.x].sup.i.sub.0] = (1 - [mu])[q.sub.i] and let [[bar.P].sup.i](q) = (1 - [rho])f(q) + [rho] f ([q.sub.i] for q [less than or equal to] [q.sub.i]. Given [[bar.P].sup.i](*), let [[bar.x].sup.i.sub.1] be the smallest state such that the seller prefers selecting y = [q.sub.i] to selecting y [member of] ([[bar.y].sup.i.sub.1], [q.sub.i-1]]. For k [greater than or equal to] 2, let [[bar.t].sup.i](q) be the seller's optimal choice over ([[bar.y].sup.i.sub.k-1], [[bar.y].sup.i.sub.k-2]] and redefine [[bar.P].sup.i](q) = (1 - [rho])f(q) + [rho] f([[bar.t].sup.i](q)) for q < [[bar.y].sup.i.sub.k-1]. Finally, let [[bar.x].sup.i.sub.k] be the smallest state such that the seller prefers selecting y [member of] ([[bar.y].sup.i.sub.k-1], [[bar.y].sup.i.sub.k-2]] to selecting y [member of] ([[bar.y].sup.i.sub.k], [[bar.y].sup.i.sub.k-1]. Let [m.sup.i] be the largest value of k such that 0 [less than or equal to] [[bar.x].sup.i.sub.j] < [[bar.x].sup.i.sub.j-1] for all j [less than or equal to] k, and let [[bar.R].sup.i](q) be the seller's payoff function associated with [[bar.P].sup.i](q).

Let [A.sub.0] = {i|[lim.sub.k[right arrow][infinity]] [[??].sup.i.sub.k] [greater than or equal to] 1 - [mu]}. If [A.sub.0] = [empty set], let [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Otherwise, let [i.sub.0] = min [A.sub.0]. Then define P(q) = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] for [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Also let R(q) and t(q) be the equilibrium value function and policy function associated with P(q).

(P) Now we will construct P(q) for [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Define [i.sub.1] such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] for all i < [i.sub.0]. Note that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] because [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] be such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] and set [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Now return to (P) with [i.sub.1] taking the role of [i.sub.0]. (P') If [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] a proof similar to the one showing [mu] < [bar.[mu]]in the two-step case yields[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] . Hence, [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] exists for[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Define [i.sub.2] such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. for all i < [i.sub.0] - 1. If [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] q' be such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] and set P(q) = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] for [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] and P(q) = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] for [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Now return to (P) with [i.sub.2] taking the role of [i.sub.0]. If[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] , then return to (P') with [i.sub.2] taking the role of [i.sub.1] and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] taking the role of[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Q.E.D

We would like to thank the editor, Chaim Fershtman, and two referees for helpful comments and suggestions. Liang acknowledges financial support from the Taiwan NSC, grant 95-2415-H-001-009.

References

AUSUBEL, L. AND DENECKERE, R. "Reputation in Bargaining and Durable Goods Monopoly." Econometrica, Vol. 57 (1989), pp. 511-531.

--AND--. "A Generalized Theorem of the Maximum." Economic Theory, Vol. 3 (1993), pp. 99-107. BOND, E. AND SAMUELSON, L. "Durable Good Monopolies with Rational Expectations and Replacement Sales." RAND Journal of Economics, Vol. 15 (1984), pp. 336-345.

--AND--. "The Coase Conjecture Need Not Hold for Durable Good Monopolies with Depreciation." Economics Letters, Vol. 24 (1987), pp. 93-97.

BULOW, J. "An Economic Theory of Planned Obsolescence." Quarterly Journal of Economics, Vol. 101 (1986), pp. 729-749.

BUTZ, D. "Durable-Good Monopoly and Best-Price Provisions." American Economic Review, Vol. 80 (1990), pp. 1062-1076.

CHEVALIER, J. AND GOOLSBEE, A. "Are Durable Goods Consumers Forward Looking? Evidence from College Textbooks." Mimeo, Yale University, 2005.

COASE, R. "Durability and Monopoly." Journal of Law and Economics, Vol. 15 (1972), pp. 143-149.

DENECKERE, R. AND LIANG, M. "Does a Second-Hand Market Limit a Durable Goods Monopolist's Market Power?" Mimeo, University of Wisconsin-Madison, 2005.

--AND--. "Bargaining with Interdependent Values." Econometrica, Vol. 74 (2006), pp. 1309-1364.

--LEVINE, D., AND--. "Infinite Horizon Models of Bargaining with One-Sided Incomplete Information." In A. ROTH, ed., Game Theoretic Models of Bargaining. Cambridge, UK: Cambridge University Press, 1985.

GUL, F., SONNENSCHEIN, H., AND WILSON, R. "Foundations of Dynamic Monopoly and the Coase Conjecture." Journal of Economic Theory, Vol. 39 (1986), pp. 155-190.

HARSANYI, J. AND SELVEN, R. A General Theory of Equilibrium Selection in Games. Cambridge, MA: MIT Press, 1988.

HENDEL, I. AND LIZZERI, A. "Adverse Selection in Durable Goods Markets." American Economic Review, Vol. 89 (1999a), pp. 1097-1115.

--AND--. "Interfering with Secondary Markets." RAND Journal of Economics, Vol. 30 (1999b), pp. 1-21.

--,--, AND SINISCALCHI, M. "Efficient Sorting in a Dynamic Adverse-Selection Model." Review of Economic Studies, Vol. 72 (2005), pp. 467-497.

HOUSE, C. AND LEAHY, K. "An Ss Model with Adverse Selection." Journal of Political Economy, Vol. 112 (2004), pp. 581-614.

JANSSEN, M. AND ROY, S. "Dynamic Trading in a Durable Good Market with Asymmetric Information." International Economic Review, Vol. 43 (2002), pp. 257-282.

JOHNSON, J. AND WALDMAN, M. "Leasing, Lemons, and Buy-Backs." RAND Journal of Economics, Vol. 34 (2003), pp. 247-265.

KARP, C. "Depreciation Erodes the Coase Conjecture." European Economic Review, Vol. 40 (1996), pp. 473-490.

KONISHI, H. AND SANDFORT, M. "Existence of Stationary Equilibrium in the Markets for New and Used Durable Goods." Journal of Economic Dynamics and Control, Vol. 26 (2002), pp. 1029-1052.

PALACIOS-HUERTA, I. AND SARACHO, A. "The Provision of Incentives in Durable Goods Firms." Mimeo, Brown University, 2004.

RUST, J. "Stationary Equilibrium in a Market for Durable Assets." Econometrica, Vol. 53 (1985), pp. 783-805.

SOBEL, J. "Durable Goods Monopoly with Entry of New Consumers." Econometrica, Vol. 59 (1991), pp. 1455-1485.

--AND TAKAHASHI, I. "A Multi-Stage Model of Bargaining." Review of Economic Studies, Vol. 50 (1983), pp. 411-426.

STOKEY, N. "Rational Expectations and Durable Goods Pricing." Bell Journal of Economics, Vol. 12 ( 1981 ), pp. 112-128.

STOLYAROV, D. "Turnover of Used Durables in a Stationary Equilibrium: Are Older Goods Traded More?" Journal of Political Economy, Vol. 110 (2002), pp. 1390-1413.

WALDMAN, M. "Durable Goods Pricing When Quality Matters." Journal of Business, Vol. 69 (1996), pp. 489-510.


5  6  7  8  9  
COPYRIGHT 2008 Rand, Journal of Economics Reproduced with permission of the copyright holder. Further reproduction or distribution is prohibited without permission.
Copyright 2008 Gale, Cengage Learning. All rights reserved. Gale Group is a Thomson Corporation Company.
NOTE: All illustrations and photos have been removed from this article.


Browse by Journal Name:
Today on Entrepreneur
Related Video

e-Business & Technology
Franchise News
Business Book Sampler
Starting a Business
Sales & Marketing
Growing a Business
E-mail*:
Zip Code*: