Skip to main content

Stability Analysis for Pricing

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research (MOTOR 2020)

Abstract

This article is dedicated to finding stable solutions to change input data on the example of pricing problems. In other words, we investigate stability analysis problems based on pricing problems.

Initial pricing problems can be described as the following Stackelberg game. There are a company and its potential clients. First, the company sets prices at own facilities for a homogeneous product. After that, each client chooses the facility in which the minimum of his costs is achieved. The cost consists of purchase and transportation prices. At the same time, clients can make a purchase only if their budget allows it. The goal is to establish prices at which the maximum profit of the company is achieved. In the generalized problem of competitive pricing, two companies compete with each other for the client demand. They set prices sequentially. Clients are also the last to decide.

For the pricing of one company, we discuss the computational complexity and algorithm solution of the stability analysis problem for three different pricing strategies. We also look at the competitive pricing problem with uniform pricing when the same price is set at all facilities. In conclusion, we discuss the relationship between the computational complexity of stability analysis problems and initial problems.

The research was supported by Russian Foundation for Basic Research (project No. 19-410-240003) (chapter 1,2) and the program of fundamental scientific researches of the SB RAS (project No. 0314-2019-0014) (chapter 3).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Carrizosa, E., Nickel, S.: Robust facility location. Math. Methods Oper. Res. 58(2), 331–349 (2003)

    Article  MathSciNet  Google Scholar 

  2. Carrizosa, E., Ushakov, A., Vasilyev, I.: Threshold robustness in discrete facility location problems: a bi-objective approach. Optim. Lett. 9(7), 1297–1314 (2015). https://doi.org/10.1007/s11590-015-0892-5

    Article  MathSciNet  MATH  Google Scholar 

  3. Davydov, I., Kochetov, Yu., Plyasunov, A.: On the complexity of the \((r\mid p)\)-centroid problem in the plane. TOP 22(2), 614–623 (2014)

    Google Scholar 

  4. Emelichev, V., Podkopaev, D.: Quantitative stability analysis for vector problems of 0–1 programming. Discrete Optim. 7(1–2), 48–63 (2010)

    Article  MathSciNet  Google Scholar 

  5. Emelichev, V.A., Podkopaev, D.P.: Stability and regularization of vector problems of integer linear programming. Diskretn. Anal. Issled. Oper. Ser. 2 8(1), 47–69 (2001)

    MathSciNet  MATH  Google Scholar 

  6. Gordeev, E.N., Leont’ev, V.K.: A general approach to the study of the stability of solutions in discrete optimization problems. Zh. Vychisl. Mat. Mat. Fiz. 36(1), 66–72 (1996); Comput. Math. Math. Phys. 36(1), 53–58 (1996)

    Google Scholar 

  7. Hanjoul, P., Hansen, P., Peeters, D., Thisse, J.-F.: Uncapacitated plant location under alternative spatial price policies. Mark. Sci. 36, 41–57 (1990)

    MathSciNet  MATH  Google Scholar 

  8. Kuzmin, K.G.: A united approach to finding the stability radii in a multicriteria problem of a maximum cut. Diskretn. Anal. Issled. Oper. 22(5), 30–51 (2015); Appl, J. Ind. Math. 9(4), 527–539 (2015)

    Google Scholar 

  9. Leont’ev, V.K.: Stability of the travelling salesman problem. Comput. Math. Math. Phys. 15(5), 199–213 (1975)

    Article  MathSciNet  Google Scholar 

  10. Leont’ev, V.K., Gordeev, E.N.: Qualitative analysis of trajectory problems. Kibernetika 5, 82–90 (1986)

    Google Scholar 

  11. Leont’ev, V.K., Gordeev, E.N.: Stability in bottleneck problems. Comput. Math. Math. Phys. 20(4), 275–280 (1980)

    Article  MathSciNet  Google Scholar 

  12. Plyasunov, A.V., Panin, A.A.: On three-level problem of competitive pricing. numerical computations: theory and algorithms. In: Proceedings of 2nd International Conference, Pizzo Calabro, Italy, 19–25 June 2016, pp. 050006-1–050006-5. AIP Publ., Melville (2016)

    Google Scholar 

  13. Plyasunov, A.V., Panin, A.A.: The pricing problem. I: exact and approximate algorithms. J. Appl. Ind. Math. 7(2), 241–251 (2013)

    Google Scholar 

  14. Plyasunov, A.V., Panin, A.A.: The pricing problem. I: computational complexity. J. Appl. Ind. Math. 7(3), 420–430 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Artem A. Panin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Panin, A.A., Plyasunov, A.V. (2020). Stability Analysis for Pricing. In: Kochetov, Y., Bykadorov, I., Gruzdeva, T. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2020. Communications in Computer and Information Science, vol 1275. Springer, Cham. https://doi.org/10.1007/978-3-030-58657-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58657-7_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58656-0

  • Online ISBN: 978-3-030-58657-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics