×

Discrete choice prox-functions on the simplex. (English) Zbl 1492.90129

Summary: We derive new prox-functions on the simplex from additive random utility models of discrete choice. They are convex conjugates of the corresponding surplus functions. In particular, we explicitly derive the convexity parameter of discrete choice prox-functions associated with generalized extreme value models, and specifically with generalized nested logit models. Incorporated into subgradient schemes, discrete choice prox-functions lead to a probabilistic interpretations of the iteration steps. As illustration, we discuss an economic application of discrete choice prox-functions in consumer theory. The dual averaging scheme from convex programming adjusts demand within a consumption cycle.

MSC:

90C25 Convex programming
90C90 Applications of mathematical programming

References:

[1] [1] Ahipasaoglu SD, Li X, Natarajan K (2019) A convex optimization approach for computing correlated choice probabilities with many alternatives. IEEE Trans. Automatic Control 64(1):190-205.Crossref, Google Scholar · Zbl 1423.90173 · doi:10.1109/TAC.2018.2875673
[2] [2] Anderson SP, De Palma A, Thisse JF (1988) A representative customer theory of the logit model. Internat. Econom. Rev. 29(3):461-466.Crossref, Google Scholar · Zbl 0658.90006 · doi:10.2307/2526791
[3] [3] Anderson SP, de Palma A, Thisse JF (1992) Discrete Choice Theory of Product Differentiation (MIT Press, Cambridge, MA).Crossref, Google Scholar · Zbl 0857.90018 · doi:10.7551/mitpress/2450.001.0001
[4] [4] Bresnahan TF, Stern S, Trajtenberg M (1997) Market segmentation and the sources of rents from innovation: Personal computers in the late 1980s. RAND J. Econom. 28:17-44.Crossref, Google Scholar · doi:10.2307/3087454
[5] [5] Feng G, Li X, Wang Z (2017) On the relation between several discrete choice models. Oper. Res. 65(6):1516-1525.Link, Google Scholar · Zbl 1405.91164
[6] [6] Fosgerau M, Melo E, de Palma A, Shum M (2017) Discrete choice and rational inattention: A general equivalence result. Discussion Papers 17-26, Department of Economics, University of Copenhagen, Copenhagen.Google Scholar
[7] [7] Gale D, Klee V, Rockafellar RT (1968) Convex functions on convex polytopes. Proc. Amer. Math. Soc. 19(4):867-873.Crossref, Google Scholar · Zbl 0246.26009 · doi:10.1090/S0002-9939-1968-0230219-6
[8] [8] Hofbauer J, Sandholm WH (2002) On the global convergence of stochastic fictitious play. Econometrica 70(6):2265-2294.Crossref, Google Scholar · Zbl 1141.91336 · doi:10.1111/1468-0262.00376
[9] [9] Kakade S, Shalev-Shwartz S, Tewari A (2009) On the duality of strong convexity and strong smoothness: learning applications and matrix regularization. Technical report, Toyota Technological Institute, Chicago.Google Scholar
[10] [10] Koppelman FS, Wen CH (2000) The paired combinatorial logit model: properties, estimation and application. Transportation Res. Part B: Methodological 34(2):75-89.Crossref, Google Scholar · doi:10.1016/S0191-2615(99)00012-0
[11] [11] Lancaster KJ (1966) A new approach to consumer theory. J. Political Econom. 74:132-157.Crossref, Google Scholar · doi:10.1086/259131
[12] [12] McFadden D (1978) Modelling the choice of residential location. Karlquist A, Snickars F, Weibull J, eds. Spatial Interaction Theory and Residential Location (North Holland, Amsterdam), 72-77.Google Scholar
[13] [13] McFadden D (1981) Econometric models of probabilistic choice. Manski C, McFadden D, eds. Structural Analysis of Discrete Data with Economic Applications (MIT Press, Cambridge, MA), 198-272.Google Scholar · Zbl 0598.62145
[14] [14] Mishra V, Natarajan K, Tao H, Teo CP (2012) Choice prediction with semidefinite optimization when utilities are correlated. IEEE Trans. Automatic Control 57(10):2450-2463.Crossref, Google Scholar · Zbl 1369.90119 · doi:10.1109/TAC.2012.2211175
[15] [15] Natarajan K, Song M, Teo CP (2009) Persistency model and its applications in choice modeling. Management Sci. 55(3):453-469.Link, Google Scholar · Zbl 1232.91139
[16] [16] Nemirovsky AS, Yudin DB (1983) Problem Complexity and Method Efficiency in Optimization (Wiley, New York).Google Scholar · Zbl 0501.90062
[17] [17] Nesterov Yu (2013) Primal-dual subgradient methods for convex problems. Math. Programming 120:221-259.Crossref, Google Scholar · Zbl 1191.90038 · doi:10.1007/s10107-007-0149-x
[18] [18] Nesterov Yu (2018) Lectures on Convex Optimization (Springer, Cham, Switzerland).Crossref, Google Scholar · Zbl 1427.90003 · doi:10.1007/978-3-319-91578-4
[19] [19] Nesterov Yu, Shikhman V (2015) Quasi-monotone subgradient methods for nonsmooth convex minimization. J. Optim. Theory Appl. 165:917-940.Crossref, Google Scholar · Zbl 1330.90078 · doi:10.1007/s10957-014-0677-5
[20] [20] Nesterov Yu, Shikhman V (2016) Excessive revenue model of competitive markets. Mordukhovich BS, Reich S, Zaslavski AJ, eds. Nonlinear Analysis and Optimization. Contemporary Mathematics, vol. 659 (American Mathematical Society, Providence, RI), 189-221.Crossref, Google Scholar · Zbl 1367.90087 · doi:10.1090/conm/659/13153
[21] [21] Norets A, Takahashi S (2013) On the surjectivity of the mapping between utilities and choice probabilities. Quant. Econom. 4(1):149-155.Crossref, Google Scholar · Zbl 1418.91172 · doi:10.3982/QE252
[22] [22] Rockafellar RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar · Zbl 0932.90001 · doi:10.1515/9781400873173
[23] [23] Small KA (1987) A discrete choice model for ordered alternatives. Econometrica 55(2):409-424.Crossref, Google Scholar · Zbl 0654.62093 · doi:10.2307/1913243
[24] [24] Train K (2003) Discrete Choice Methods with Simulation (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar · Zbl 1047.62098 · doi:10.1017/CBO9780511753930
[25] [25] Wen CH, Koppelman FS (2001) The generalized nested logit model. Transportation Res. Part B: Methodological 35(7):627-641.Crossref, Google Scholar · doi:10.1016/S0191-2615(00)00045-X
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.