zbMATH — the first resource for mathematics

Finite purchasing power and computations of Bertrand-Nash equilibrium prices. (English) Zbl 1401.91252
Summary: This article considers the computation of Bertrand-Nash equilibrium prices when the consumer population has finite purchasing power. The literal KKT conditions for equilibria contain “spurious” solutions that are not equilibria but can be computed by existing software, even with prominent regularization strategies for ill-posed problems. We prove a reformulated complementarity problem based on a fixed-point representation of equilibrium prices improves computational reliability and provide computational evidence of its efficiency on an empirically-relevant problem. Scientific inferences from empirical Bertrand competition models with explicit limits on individual purchasing power will benefit significantly from our proposed methods for computing equilibrium prices. An analysis of floating-point computations also implies that any model will have finite purchasing power when implemented on existing computing machines, and thus the techniques discussed here have general value. We discuss a heuristic to identify, and potentially mitigate, the impact of computationally-imposed finite purchasing power on computations of equilibrium prices in any model.
91B52 Special types of economic equilibria
90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
91B54 Special types of economic markets (including Cournot, Bertrand)
Full Text: DOI
[1] Baye, MR; Kovenock, D; Durlaf, SN (ed.); Blume, LE (ed.), Bertrand competition, (2008), London · Zbl 1136.91340
[2] Berry, S; Levinsohn, J; Pakes, A, Automobile prices in market equilibrium, Econometrica, 63, 841-890, (1995) · Zbl 0836.90057
[3] Berry, S; Levinsohn, J; Pakes, A, Differentiated products demand systems from a combination of micro and macro data: the new car market, J. Polit. Econ., 112, 68-105, (2004)
[4] Billups, S.C.: Algorithms for complementarity problems and generalized equations. PhD thesis, University of Wisconsin-Madison (1995)
[5] Boyd, JH; Mellman, RE, The effect of fuel economy standards on the U.S. automotive market: an hedonic demand analysis, Transp. Res. A, 14A, 367-378, (1980)
[6] Brown, PN; Saad, Y, Hybrid Krylov methods for nonlinear systems of equations, SIAM J. Sci. Stat. Comput., 11, 450-481, (1990) · Zbl 0708.65049
[7] Caplin, A; Nalebuff, B, Aggregation and imperfect competition: on the existence of equilibrium, Econometrica, 59, 25-59, (1991) · Zbl 0738.90012
[8] Dirkse, S.P.: Robust solution of mixed complementarity problems. PhD thesis, University of Wisconsin-Madison (1994)
[9] Dirkse, SP; Ferris, MC, The PATH solver: a non-monotone stabilization scheme for mixed complementarity problems, Optim. Methods Softw., 5, 123-156, (1995)
[10] Dreves, A; Facchinei, F; Kanzow, C; Sagratella, S, On the solution of the KKT conditions of generalized Nash equilibrium problems, SIAM J. Optim., 21, 1082-1108, (2011) · Zbl 1230.90176
[11] Dube, JP; Chintagunta, P; Petrin, A; Bronnenberg, B; Goettler, R; Seetharaman, PB; Sudhir, K; Thomadsen, R; Zhao, Y, Structural applications of the discrete choice model, Market. Lett., 13, 207-220, (2002)
[12] Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequality and Complementarity Problems. Springer, New York (2003) · Zbl 1062.90002
[13] Ferris, MC; Munson, TS, Interfaces to PATH 3.0: design, implementation and usage, Comput. Optim. Appl., 12, 207-227, (1999) · Zbl 1040.90549
[14] Ferris, M.C., Pang, J.S.: Engineering and economic applications of complementarity problems. SIAM Rev. 39, 669-713 (1997) http://www.siam.org/journals/sirev/39-4/28596.html · Zbl 0891.90158
[15] Ferris, MC; Kanzow, C; Munson, TS, Feasible descent algorithms for mized complementarity problems, Math. Program., 86, 475-497, (1999) · Zbl 0946.90094
[16] Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991) · Zbl 1339.91001
[17] Gill, PE; Murray, W; Saunders, MA, SNOPT: an SQP algorithm for large-scale constrained optimization, SIAM Rev., 47, 99-131, (2005) · Zbl 1210.90176
[18] Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002) · Zbl 1011.65010
[19] Hindmarsh, AC; Brown, PN; Grant, KE; Lee, SL; Serban, R; Shumaker, DE; Woodward, CS, SUNDIALS: suite of nonlinear and differential/algebraic equation solvers, ACM Trans. Math. Softw., 31, 363-396, (2005) · Zbl 1136.65329
[20] Judd, K.L., Skrainka, B.: High performance quadrature rules: how numerical integration affects a popular model of product differentiation. Tech. Rep. CWP03/11, Centre for Microdata Methods and Practice, Institute for Fiscal Studies (2011)
[21] Liu, F; Nashed, MZ, Regularization of nonlinear ill-posed variational inequalities and convergence rates, Set-Valued Anal., 6, 313-344, (1998) · Zbl 0924.49009
[22] Milnor, J.W.: Topology from the Differentiable Viewpoint. Princeton Landmarks in Mathematics. Princeton University Press, Princeton (1965) · Zbl 0136.20402
[23] Morrow, W.R.: A fixed-point approach to equilibrium pricing in differentiated product markets. PhD thesis, Department of Mechanical Engineering, University of Michigan (2008) · Zbl 0738.90012
[24] Morrow, W.R.: Hessian-free methods for checking the second-order sufficient conditions. In: INFORMS Midwest Regional Conference Meeting in Columbus, OH (2011)
[25] Morrow, W.R.: On the existence of Bertrand-Nash equilibrium prices under logit demand. Technical Report, Iowa State University (2012). arXiv:1012.5832 · Zbl 0708.65049
[26] Morrow, W.R., Skerlos, S.J.: Fixed-Point Approaches to Computing Bertrand-Nash Equilibrium Prices Under Mixed-Logit Demand: A Technical Framework for Analysis and Efficient Computational Methods. Technical Report, Iowa State University (2010) · Zbl 1237.91102
[27] Morrow, WR; Skerlos, SJ, Fixed-point approaches to computing bertrand-Nash equilibrium prices under mixed-logit demand, Oper. Res., 59, 328-345, (2011) · Zbl 1237.91102
[28] Morrow, WR; Long, M; MacDonald, EF, Market-system design optimization with consider-then-choose models, J. Mech. Des. Forthcom., 136, 031003, (2013)
[29] Munson, T.: Algorithms and environments for complementarity. PhD thesis, University of Wisconsin-Madison (2000) · Zbl 0777.90063
[30] Nevo, A, A practitioner’s guide to estimation of random-coefficients logit models of demand, J. Econ. Manag. Strategy, 9, 513-548, (2000)
[31] Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006) · Zbl 1104.65059
[32] Petrin, A, Quantifying the benefits of new products: the case of the minivan, J. Polit. Econ., 110, 705-729, (2002)
[33] Ralph, D, Global convergence of damped newton’s method for nonsmooth equations, via the path search, Math. Oper. Res., 19, 352-389, (1994) · Zbl 0819.90102
[34] Robinson, SM, Normal maps induced by linear transformations, Math. Oper. Res., 17, 691-714, (1992) · Zbl 0777.90063
[35] Shapiro, A; Ruszczynski, A (ed.); Shapiro, A (ed.), Monte Carlo sampling methods, No. 10, 353-425, (2003), Amsterdam
[36] Simsek, A; Ozdaglar, A; Acemoglu, D, Generalized poincare-Hopf theorem for compact nonsmooth regions, Math. Oper. Res., 32, 193-214, (2007) · Zbl 1278.37031
[37] Train, K.: Discrete Choice Methods with Simulation, 2nd edn. Cambridge University Press, Cambridge (2009) · Zbl 1269.62073
[38] Waltz, RA; Morales, JL; Nocedal, J; Orban, D, An interior algorithm for nonlinear optimization that combines line search and trust region steps, Math. Program. A, 107, 391-408, (2006) · Zbl 1134.90053
[39] Whitefoot, K., Fowlie, M., Skerlos, S.J.: Product design repsonse to industrial policy: evaluating fuel economy standards using an engineering model of endogenous product design. Technical Report, EI @ Haas WP 214, Haas School of Business, University of California Berkeley (2011) · Zbl 1210.90176
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.