A Stackelberg-Nash model for new product design
From MaRDI portal
Publication:2267376
DOI10.1007/s00291-008-0137-4zbMath1183.91027MaRDI QIDQ2267376
Publication date: 1 March 2010
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-008-0137-4
91A65: Hierarchical games (including Stackelberg games)
90B30: Production models
91B24: Microeconomic theory (price theory and economic markets)
Related Items
Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution, Radio-frequency identification (RFID) adoption with inventory misplacement under retail competition, A leader-follower game in competitive facility location, The benefits of incorporating utility dependencies in finite mixture probit models
Cites Work
- Unnamed Item
- Unnamed Item
- An empirical comparison of the validity of a neural net based multinomial logit choice model to alternative model specifications
- An evolutionary algorithm approach to the share of choices problem in the product line design
- Conjoint-based product (line) design considering competitive reactions
- Optimal product design using a colony of virtual ants
- Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem
- Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis
- Product Positioning Under Price Competition
- The Principle of Minimum Differentiation Holds under Sufficient Heterogeneity
- Note—A Numerical Approach to Deriving Long-Run Equilibrium Solutions in Spatial Positioning Models
- A comparison of two approaches to the optimal positioning of a new product in an attribute space
- Genetic Algorithms for Product Design
- Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations
- Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics
- A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study