Volume 37, Issue 3 pp. 525-544
RESEARCH ARTICLE

The competitive loss-averse newsvendor problem with quantity-oriented reference point

Kun Xie

Kun Xie

School of Science, Beijing University of Posts and Telecommunications, Beijing, P.R. China

Search for more papers by this author
Yongjiang Guo

Corresponding Author

Yongjiang Guo

School of Science, Beijing University of Posts and Telecommunications, Beijing, P.R. China

Correspondence Yongjiang Guo, Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China.

Email: [email protected]

Search for more papers by this author
First published: 06 November 2020

Funding information: National Natural Science Foundation of China, 11871116; 11971074

Abstract

We study a two-newsvendor competition problem in which both newsvendors are loss-averse and have adaptive quantity-oriented reference points. Each newsvendor faces stochastic demand determined by some demand reallocation rule and aims to choose an optimal inventory level to maximize her expected utility. Since the demand reallocation rule indicates that one newsvendor's demand affects the inventory level of the other newsvendor, this problem can be formulated as a two-person game. We prove that this competitive newsvendor problem exhibits a unique symmetric Nash equilibrium. We also show that the optimal inventory level decreases in the loss aversion degree and reference level, and increases in the competition intensity. Unlike conventional findings in the integrated risk-neutral supply chain, we find that a low (high) reference level leads to inventory overstocking (understocking), which is illustrated jointly by the loss aversion degree, reference level, and competition intensity. Finally, we conduct numerical experiments to provide engineering confirmations of our theoretical findings and to generate additional insights.

DATA AVAILABILITY STATEMENT

All data, models, and code generated or used during the study appear in the submitted article.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.