Technical Note—A Monge Sequence-Based Approach to Characterize the Competitive Newsvendor Problem

References

• Bansal S (2010) Optimal assortments of vertically differentiated products: Analytical solution and properties. PhD thesis, University of Texas, Austin, TX. Accessed December 8, 2021, https://repositories.lib.utexas.edu/handle/2152/ETD-UT-2010-05-828.Google Scholar
• Bansal S, Dyer JS (2010) Solution to a class of two-stage stochastic programs with multivariate normal uncertainty. Working paper, Pennsylvania State University, University Park, PA.Google Scholar
• Bassok Y, Anupindi R, Akella R (1999) Single-period multiproduct inventory models with substitution. Oper. Res. 47(4):632–642.Link, Google Scholar
• Burkard RE (1995) On the role of bottleneck Monge matrices in combinatorial optimization. Oper. Res. Lett. 17(2):53–56.Crossref, Google Scholar
• Burkard RE, Klinz B, Rudolf R (1996) Perspectives of Monge properties in optimization. Discrete Appl. Math. 70(2):95–161.Crossref, Google Scholar
• Fudenberg D, Tirole J (1991) Game Theory (MIT Press, Cambridge, MA).Google Scholar
• Gilbert JC, Nocedal J (1992) Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2(1):21–42.Crossref, Google Scholar
• Hoffman AJ (1985) On greedy algorithms that succeed. Anderson I, ed. Surveys in Combinatorics 1985: Invited Papers for the Tenth British Combinatorial Conference (Cambridge University Press, Cambridge, UK), 97–112.Crossref, Google Scholar
• Hsu A, Bassok Y (1999) Random yield and random demand in a production system with downward substitution. Oper. Res. 47(2):277–290.Link, Google Scholar
• Lippman SA, McCardle KF (1997) The competitive newsboy. Oper. Res. 45(1):54–65.Link, Google Scholar
• Mutha A, Bansal S, Guide VDR (2016) Managing demand uncertainty through core acquisition in remanufacturing. Production Oper. Management 25(8):1449–1464.Crossref, Google Scholar
• Netessine S, Rudi N (2003) Centralized and competitive inventory models with demand substitution. Oper. Res. 51(2):329–335.Link, Google Scholar
• Olsen TL, Parker RP (2014) On Markov equilibria in dynamic inventory competition. Oper. Res. 62(2):332–344.Link, Google Scholar
• Parlar M (1988) Game theoretic analysis of the substitutable product inventory problem with random demands. Naval Res. Logist. 35(3):397–409.Crossref, Google Scholar
• Shamir R (1993) A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs. Discrete Math. 114(1-3):435–444.Crossref, Google Scholar
• Shamir R, Dietrich B (1990) Characterization and algorithms for greedily solvable transportation problems. SODA’90 Proc. First Annu. ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 358–366.Google Scholar
• Tseytlin Y, Heese HS (2019) Allocation under a general substitution structure. Eur. J. Oper. Res. 277(2):492–506.Crossref, Google Scholar
• Wächter A, Biegler LT (2006) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Programming 106(1):25–57.Crossref, Google Scholar
• Wang Q, Parlar M (1994) A three-person game theory model arising in stochastic inventory control theory. Eur. J. Oper. Res. 76(1):83–97.Crossref, Google Scholar