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

DOI10.1287/opre.2021.2189zbMath1493.90004OpenAlexW4200481023MaRDI QIDQ5080644

Saurabh Bansal, Mahesh Nagarajan

Publication date: 31 May 2022

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2021.2189

zbMATH Keywords

Nash equilibriumalgorithmic game theoryMonge sequenceoperations and supply chains

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Algorithmic game theory and complexity (91A68)

Uses Software

• Ipopt

Cites Work

• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
• A three-person game theory model arising in stochastic inventory control theory
• Allocation under a general substitution structure
• On the role of bottleneck Monge matrices in combinatorial optimization
• Perspectives of Monge properties in optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Random Yield and Random Demand in a Production System with Downward Substitution
• Single-Period Multiproduct Inventory Models with Substitution
• On Markov Equilibria in Dynamic Inventory Competition
• Centralized and Competitive Inventory Models with Demand Substitution
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• The Competitive Newsboy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Technical Note—A Monge Sequence-Based Approach to Characterize the Competitive Newsvendor Problem