On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies

DOI10.1134/S1990478919010071zbMath1438.91056OpenAlexW2941412227MaRDI QIDQ4973243

A. V. Gubareva, L. V. Som, A. A. Panin, Aleksandr V. Plyasunov

Publication date: 2 December 2019

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478919010071

zbMATH Keywords

decompositionvariable neighborhood descentStackelberg gamecoordinate descentcompetitive pricing problemexact and approximate algorithmthree-level problemuniform and mill pricing

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Microeconomic theory (price theory and economic markets) (91B24) Approximation algorithms (68W25)

Related Items (1)

The multilevel facility location and pricing problems: the computational complexity and the stability analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization problems and the polynomial hierarchy
• Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming
• Generalized Benders decomposition
• On the numerical solution of a class of Stackelberg problems
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• The pricing problem. Part I: Exact and approximate algorithms
• The pricing problem. Part II: Computational complexity
• Variable neighborhood search: Principles and applications

This page was built for publication: On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies