Next Article in Journal
To Compete or to Collaborate? Logistics Service Sharing and Retailers’ Resale in Competitive Online Channels
Next Article in Special Issue
Production Logistics in Industry 3.X: Bibliometric Analysis, Frontier Case Study, and Future Directions
Previous Article in Journal
Artificial Intelligence and Green Total Factor Productivity: The Moderating Effect of Slack Resources
Previous Article in Special Issue
Reinforcement Learning for Optimizing Can-Order Policy with the Rolling Horizon Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Decentralized Inventory Transshipments with Quantal Response Equilibrium

1
School of Management, Guizhou University, Guiyang 550025, China
2
School of Economics and Management, Beihang University, Beijing 100191, China
*
Author to whom correspondence should be addressed.
Systems 2023, 11(7), 357; https://doi.org/10.3390/systems11070357
Submission received: 5 June 2023 / Revised: 11 July 2023 / Accepted: 11 July 2023 / Published: 12 July 2023
(This article belongs to the Special Issue Manufacturing and Service Systems for Industry 4.0/5.0)

Abstract

:
Despite the benefits of inventory transshipment, numerous behavioral experiments have revealed that retailers often deviate from the Nash-equilibrium ordering quantities, which in turn impacts the potential advantages. Motivated by this issue, we developed a behavioral model to analyze the deviation of ordering quantities among two independent retailers who engage in inventory transshipment from the perspective of analytical modeling. In our model, we incorporated bounded rationality with the quantal response equilibrium. Firstly, we established the existence of such a quantal response equilibrium and provided the conditions for its uniqueness. Secondly, we compared the quantal response equilibrium with the Nash equilibrium within a certain range of transshipment prices and observed that the limiting quantal response equilibrium is equivalent to the Nash equilibrium. Lastly, we design an iterative algorithm that incorporates the learning effects of the retailers to determine the quantal response equilibrium for the ordering quantity. The results indicate that the optimal ordering quantity and the nearby ordering quantities should be chosen with higher probabilities. Additionally, the retailer should gradually enhance their cognitive or computational abilities through repeated transshipment games to improve their decision-making process. Furthermore, to ensure a balanced inventory-sharing system, the evaluation of inventory strategies should consistently prioritize avoiding surplus instead of shortage.

1. Introduction

With the intensification of market competition and the acceleration of technology updates, the products life cycle is continually shrinking, leading to increased uncertainty in market demand. This poses challenges for market participants, such as manufacturers and retailers, in accurately predicting and meeting market demand, resulting in the common occurrence of stockouts and excess inventory across various industries, including clothing, books, and magazines [1]. Stockouts have resulted in significant losses to the retail industry. For instance, The authors in [2] reported annual losses of USD 7–12 billion in the US supermarket retail industry due to stock shortages. Moreover, research conducted by Roland Berger in Beijing, Shanghai, and Shenzhen revealed that Chinese supermarkets experience a conservative estimate of around 10% commodity shortage, which amounts to an annual direct loss of USD 12 billion. A stockout rate of 20–30% has even become the norm in the retail industry [3]. Conversely, excess inventory is a prevalent issue in other retail sectors. In the first half of 2012, the total inventory of six Chinese sports brands, such as Li Ning and Anta, reached USD 800 million, while Youngor’s inventory had reached USD 4 billion by 2016. Consequently, it has become imperative to address the mismatch between supply and demand. Transshipment is one approach that many retailers consider, as it has yielded remarkable results. Transshipment, which is a form of inventory sharing, aligns with the principles of the sharing economy [4]. Previous studies have indicated that transshipment can effectively reduce inventory and improve service levels. The authors in [5] found that transshipment can reduce inventory costs by 15–20% and demand losses by 75%. Notably, this approach has been widely adopted in various industries, including clothing, automotive (e.g., Toyota, Volvo), publishing (e.g., Xinhua Group of China), household products, and healthcare. For instance, in the provincial and municipal companies affiliated with the State Grid of China, transshipment of electricity meters between power supply bureaus is allowed to ensure a response time within three days for residential users. Additionally, an inter-provincial transshipment mechanism for electricity meters was established in 2014 to better cope with natural disasters and accidents.
However, an underlying assumption commonly made in practice is that retailers exhibit perfect rationality. Factors such as information asymmetry and cognitive abilities can influence retailers’ ordering behavior, causing deviations from the optimal ordering quantities prescribed by traditional inventory transshipment models. A survey involving 54 inventory managers revealed that none of these managers solely relied on a purely theoretical approach when making ordering decisions [6]. Instead, 45 of them consider both traditional theory and behavioral factors. Therefore, it is essential to incorporate behavioral factors when investigating retailers’ ordering decisions. Motivated by these observations, our study aims to examine the transshipment or inventory-sharing problem through a behavioral lens. We address the following three questions: (i.) Does a quantal response equilibrium (QRE) exist between retailers, considering behavioral factors? (ii.) If such a QRE exists, what is the relationship between this QRE and the Nash equilibrium? (iii.) How can we identify the QRE between retailers?
To address these research questions, we examine a system with transshipment involving two independent retailers, similar to the work conducted in [7], referred to hereafter as RKP. In order to investigate systematic ordering deviations, we incorporate bounded rationality into retailers’ ordering behaviors using the quantal response equilibrium (QRE). Building upon classical quantal choice theory and the theory of quantal response equilibria [8,9], we develop a bounded rationality decision model in this paper. Within this model, retailers’ ordering quantities are no longer deterministic but considered as random variables. However, ordering quantities leading to higher expected profits are chosen with higher probabilities. While bounded rationality can explain various phenomena such as cognitive limitations, psychological deviations, and heuristics, in this paper, we focus on emphasizing the role of bounded rationality in explaining noisy decisions. We establish the existence of a QRE in the transshipment problem and identify the conditions for its uniqueness. Furthermore, we explore the relationship between the ordering quantity determined by the Nash equilibrium and the ordering quantity derived from the QRE. It is well-known that the QRE model is typically solved numerically. In light of retailers’ learning effects, we propose an iterative algorithm to solve the QRE in the transshipment problem.
Our paper makes significant contributions to the fields of transshipment and behavioral operations management. This research is the first investigate the quantal response equilibrium (QRE) between two independent retailers using analytical modeling. In addition to establishing the existence of QRE in their ordering decisions, we also determine the conditions for its uniqueness. Furthermore, we identify the condition under which QRE is equivalent to Nash equilibrium. To find the QRE between the two retailers, we develop an iterative algorithm. Our approach differs from the empirical perspective taken in [10], which primarily focused on how the rationality level of retailers indirectly influenced their ordering quantities through the transshipment price. Moreover, our research goes beyond examination of the single newsvendor problem within a logit choice framework in [11]. Unlike [11], which solely considered the newsvendor problem without incorporating transshipment, our model allows for transshipment between the retailers, thereby adding complexity to the decision-making process of the newsvendors.
The remainder of this paper is organized as follows. Section 2 provides a brief literature review. The bounded rationality transshipment model is established in Section 3. In Section 4, in addition to proving the existence of transshipment QRE and the condition to guarantee its uniqueness, we also discuss the relation between the optimal ordering strategy in RKP and the transshipment QRE ordering quantity. Based on retailers’ learning effects, the algorithm of transshipment QRE is designed in Section 5. We present a numerical study in Section 6. Finally, we conclude our findings in Section 7.

2. Literature Review

According to the issues involved above, we mainly review the relevant literature from three aspects: traditional inventory transshipment, behavioral newsvendor models, and behavioral inventory transshipment which is most relevant to our problem.

2.1. Traditional Inventory Transshipment

The risk-pooling potential of transshipment is an important topic in operations management, which has been extensively explored in existing literature [7,12,13,14,15,16,17,18,19,20,21,22]. Previous analytical models have primarily focused on equilibrium predictions in settings with fully rational agents. The authors in [19] conducted a comprehensive review of the transshipment literature and identified three main research areas: ordering decisions, transshipment prices, and sharing decisions. The pioneering work of RKP introduced a decentralized transshipment model that considered a channel with one supplier and two independent retailers. They demonstrated the existence of a unique Nash equilibrium for optimal ordering quantities under reasonable transshipment prices. However, they set the transshipment price before demand realization, unlike [13], which allowed for price adjustment after demand realization and developed a more general framework. The authors in [13] also proved the existence of a pure strategy Nash equilibrium and proposed conditions for the uniqueness of a first-best equilibrium. Building upon these foundations, [21] derived ordering strategies for two retailers under conditions of limited supply and investigated the existence of a pure Nash equilibrium, finding that transshipment does not always benefit both retailers. The authors in [23] explored the idea of transshipping perishable goods with a fixed finite lifetime in offline grocery retailing. Ref. [24] considered two multi-location newsvendor problems with reactive and proactive transshipments, respectively. The authors in [25] developed a two-stage game model to examine the inventory and end-of-season transshipment decisions.
It is important to note that all the aforementioned studies assume complete information. In contrast, [22] examined the transshipment problem with incomplete information, while [18] explored the role of information update in the existence of a Nash-equilibrium ordering decision. Ref. [20] developed a two-stage model to compare preventive and emergency transshipment scenarios, revealing the presence of Nash-equilibrium ordering quantities in preventive transshipment but the absence of coordinated transshipment prices. Ref. [15] extended the framework to a two-stage ordering model to study the coordination mechanism, while [16] considered the impact of returns between retailers and derived Nash-equilibrium ordering quantities under specific conditions. The authors in [14] investigated retailers’ ordering decisions in the context of multiple transshipment stages, and [12] explored the joint optimization of inventory and transshipment. From a network perspective, the authors in [17] established the existence of Nash-equilibrium ordering quantities and identified coordination conditions. Lastly, [26] incorporated customers’ switching behaviors into retailers’ ordering decisions. The authors in [27] developed a discrete-time dynamic programming model framework with customer switching behavior. Notably, existing literature predominantly focuses on the analytical modeling perspective of the transshipment problem, neglecting the behavioral factors of retailers and their impact on systematic ordering deviations.

2.2. Behavioral Newsvendor Model

All the literature mentioned in the previous subsection assumes that retailers are perfectly rational, allowing them to choose the optimal inventory quantity with certainty. However, this is not reflective of real-world conditions, which is a common pitfall in practice [28]. The authors in [29] conducted a review of the literature on behavioral newsvendors as analogues to newsvendors and found systematic decision biases, also known as pull-to-center behaviors, in the newsvendor problem. The authors in [30] discovered that subjects exhibited behavior as if their utility function favored reducing the ex-post inventory error, and they also suffered from anchoring and insufficient adjustment biases. To analyze this decision bias further, researchers have attempted to uncover the reasons behind its persistence.
Various behavioral factors have been proposed and extensively discussed in existing literature [31,32,33,34,35,36,37,38,39,40]. Ref. [41] demonstrated that there was no significant difference between using university students and real managers as subjects. Consequently, most scholars opt to conduct research through laboratory experiments utilizing man-machine dialogue. Ref. [39] defined overconfidence as the precision of individual beliefs and found that it can explain approximately one-third of the observed ordering mistakes, with its effects remaining robust in the presence of learning and other dynamic factors. On the other hand, [36] defined overconfidence as a cognitive bias in which decision-makers perceive uncertain outcomes to be less risky than they really are. They studied the effects and implications of overconfidence in a competitive newsvendor setting. Ref. [42] showed that overconfidence would prompt the retailer to order more under low-profit conditions, whereas it reduces the order quantity under high-profit conditions. The authors in [34] established that fairness concerns among supply chain partners enable supply chain coordination. Ref. [31] developed an adaptive learning model that incorporates memory, reinforcement, and probabilistic choice to explain individual decisions. Ref. [38] demonstrated that prospect theory alone cannot consistently explain observations in the behavioral operations literature regarding the newsvendor problem.
However, [37] extended the reference point structure to demonstrate that prospect theory can explain newsvendor behavior when the newsvendor anchors on the most and least favorable outcomes. Building upon this insight, [40] generalized this finding from lab experiments to the retail industry. In the presence of uncensored demands, subjects tend to order below the normative quantity when facing high margins and above the normative quantity when facing low margins, but they do not order beyond the mean demand in either case. Ref. [35] adopted the concept of demand chasing, wherein order quantities are adjusted based on prior demand, to explain the pull-to-center effect. They found that demand chasing occurs when the true order generation process is independent of prior demand. The authors in [32] proposed a framework for incorporating risk aversion into multi-period inventory and pricing strategies. Ref. [11] developed a bounded-rationality newsvendor model using the quantal choice model. This framework was utilized to characterize the ordering decisions made by boundedly rational decision makers, identify systematic biases, and gain insights into the occurrence of overordering and underordering. This analytical approach was also applied to a capacity allocation game [33]. Both studies considered stochastic ordering quantities chosen by newsvendors, with a greater likelihood of choosing quantities that yield higher expected profits. Ref. [43] investigated retailers’ ordering quantities from the perspective of reference effect heterogeneity. However, [11] focused on a single newsvendor model without interactive games. In contrast, this paper examines the bounded rationality of two independent retailers with transshipment and establishes the transshipment logit QRE model, which fundamentally differs from [11]. Additionally, [33] primarily examined the capacity allocation problem empirically, distinguishing it from the approach adopted in this paper.

2.3. Behavioral Inventory Transshipment

Recently, a behavioral decision bias in the context of transshipment problems has been observed in several research papers. Notable examples include [6,28,44,45,46,47]. These papers contribute to three main research topics: explanations for the observed decision bias, methods for alleviating the bias, and optimal ordering behavior considering the bias. Ref. [28] examined the impact of different transshipment commitment settings on ordering behavior and found evidence of the pull-to-center bias. They developed four behavioral models incorporating quantal response equilibrium (QRE) and fairness concerns, which demonstrated good predictive power. The authors in [6] proposed a new interpretation of transshipment as an alternative supply or demand and identified an underordering bias resulting from retailers underestimating the demand-side benefits of transshipment.
Numerous methods have been explored to mitigate this behavioral bias or enhance transshipment in the supply chain. These include communication [46], negotiation of transshipment prices [44], and reducing inventory transparency while providing decision support [6], among others. Given that the behavioral bias persists and is predictable, informed retailers can leverage this by employing decision models that optimally respond to behavioral retailers [44]. Ref. [45] discovered that overconfident retailers may experience lower expected profits when compared to retailers without transshipment. They found that transshipment could exacerbate decision-making distortions caused by overconfidence.
Most of the existing literature examines the ordering behavior bias from an empirical standpoint. However, [47] incorporated risk aversion into the analytical modeling of the RKP model. They established the existence of Nash-equilibrium ordering quantities and determined the inventory boundary condition. In this paper, we incorporate QRE into a decentralized two-location transshipment model, focusing on the relevant properties of the transshipment logit QRE, which distinguishes our study from others. Apart from [47], the aforementioned literature also approaches the transshipment problem empirically. However, [47] did not consider the factor of QRE. Therefore, within the framework of our analytical model, we explore the existing systematic ordering bias by incorporating bounded rationality and QRE into the retailers’ ordering behavior. This fundamentally differs from existing literature. The work in [48] is particularly relevant to our paper, as they investigated a pure strategy Nash equilibrium among retailers. However, in many cases, a pure strategy Nash equilibrium is not feasible for retailers’ orders. Building on their research, we examine the mixed strategy quantal response equilibrium of retailers.

3. Model

3.1. Traditional Transshipment Model

In this study, we analyze a decentralized system comprising a supplier and two independent retailers, denoted by i and j (where j = 3 i ), under the assumption of perfect rationality. At the onset of the selling season, retailer i is faced with the task of determining an optimal non-negative ordering quantity, q i , to maximize expected profit, despite being unaware of the future demand, D i . Throughout the selling season, retailer i fulfills demand using its own inventory first. In the event of stockouts, retailer i has the option to obtain products from retailer j , but only if retailer j possesses excess inventory. Consequently, transshipment serves as a means to mitigate inventory costs and enhance service levels. Notably, both retailers must consider each other’s ordering behavior when making their own ordering decisions, necessitating trade-offs. Overshooting order quantities can result in elevated inventory costs and facilitate the opponent’s ability to meet demand through transshipment. Conversely, lower order quantity diminishes service levels and provides the opponent with opportunities for additional profit through transshipment.
Let c i , r i , s i , and l i denote retailer i ’s per-unit cost, selling price, salvage value, and lost-sales penalty cost, respectively. We define v i = r i + l i as the marginal value of additional retail sales at retailer i . Let c i j denote the per-unit cost of transshipment from i to j and τ i j denote the per-unit transportation cost of transshipment from i to j which is assumed to be incurred by retailer i . In this research, to avoid the triviality, we make the following assumptions: s i + τ i j < v j , c i < c j + τ j i , s i < s j + τ j i , v i < v j + τ j i , s i + τ i j c i j v j . These assumptions guarantee that transshipment is not always beneficial, and that transshipment occurs only when one retailer has excess stock and, simultaneously, the other has excess demand. Once the random demand D i is realized (demand distribution F D i ( ) , F D j ( ) are common knowledge and differentiable), transshipment occurs only when a retailer has surplus stock, and another retailer has a stockout. We assume that the transshipment prices c i j or c j i are negotiated before the selling season and that if the transshipment condition is met, the transshipment occurs automatically. We define X + = max ( 0 , X ) ; the units of inventory transferred from retailer i to retailer j can be written as T i j = min ( ( D j Q j ) + , ( Q i D i ) + ) . Then, let S i = min ( Q i , D i ) + T j i , R i = ( Q i D i T i j ) + , and Z i = ( D i Q i T j i ) + denote the retailer i ’s sales, unsold stock, and unmet demand, respectively. Given a certain pair of ordering quantities ( q i , q j ) , the expected profit of retailer i can be provided by
π i ( q i , q j ) = E { r i S i + ( c i j τ i j ) T i j c j i T j i + s i R i l i Z i } c i q i
According to Equation (1) above and Rudi et al.’s proof method [9], there exists a unique Nash equilibrium ( q i * , q j * ) . The logic behind the existence of Nash equilibrium is that there is a strategic substitution relationship between the orders of two retailers. Both retailers will have no incentive to deviate from this Nash-equilibrium ordering quantities, because any deviation will lead to a lower expected profit. Based on perfectly rational assumption, retailers will choose the Nash-equilibrium ordering quantities with certainty.

3.2. Bounded Rationality Transshipment Model

The aforementioned context resembles the RKP model, wherein retailers exclusively select Nash-equilibrium ordering quantities. Within this subsection, we develop a bounded rational transshipment model using quantal response equilibrium (QRE), whereby retailers probabilistically determine their ordering quantities. This approach allows readers to gain deeper insights into bounded rationality, operating under the following assumptions.
Assumption 1.
Retailers employ stochastic responses when selecting ordering quantities, rather than solely optimizing profits. This implies that all feasible ordering quantities are chosen with a positive probability, even though those with higher expected profits are more likely to be selected.
Assumption 2.
Retailers experience uncertainty concerning their competitors’ decisions, as their competitors also stochastically determine their ordering quantities.
We define N = { i , j } as the set of retailers, Q i = { q i 1 , q i 2 , , q i M i } as the full set of retailer i ’s feasible ordering quantities, and M i as the number of feasible ordering quantities. The feasible order quantities here are assumed to be discrete, which is consistent with practice. If retailers are assumed to be boundedly rational, they may stochastically choose a pair of ordering quantities q = ( q i , q j ) in Q = { Q i × Q j } . Hence, the ordering decisions of retailers can be viewed as a mixed ordering strategy. In other word, retailer i ’s ordering strategy is a probability distribution on Q i . Let π i : Q denote the expected profit function of retailer i and Δ i denote the set of probability distributions on Q i . Let p i : Q i + ; this an element in the set Δ i , where q i m Q i p i ( q i m ) = 1 and p i ( q i m ) 0 for all q i m Q i . For convenience, we use the notation p i m = p i ( q i m ) to represent the probability of choosing the ordering quantity q i m . Hence, the set of all probability distributions on Q i is Δ i = { p i = ( p i 1 , , p i M i ) : m { 1 , , M i } p i m = 1 , p i m 0 } . We write the set of mixed ordering strategy profiles by Δ = { Δ i × Δ j } and denote elements in Δ by p = ( p i , p j ) . Hence, given a certain mixed ordering strategy profile p Δ , the expected profit of retailer i is given by π i ( p ) = q Q p ( q ) π i ( q ) , where p ( q ) = p i ( q i ) p j ( q j ) . We denote π i m ( p ) = π i ( q i m , p j ) = q j Q j p j ( q j ) π i ( q i m , q j ) as the expected profit of retailer i choosing ordering quantity q i m and retailer j choosing a mixed ordering strategy. The space of profit vectors of retailer i choosing a certain ordering quantity is M i ; we define π ¯ : Δ M i × M j by π ¯ ( p ) = ( π ¯ i ( p ) , π ¯ j ( p ) ) , where π ¯ i ( p ) = ( π i 1 ( p ) , , π i M i ( p ) ) is the profit vector of retailer i choosing different ordering quantities in Q i . Therefore, with the notations defined above, we can denote a transshipment game between retailer i and retailer j with Γ N , Q , { π i } i N .

4. Quantal Response Equilibrium of the Transshipment Game

To incorporate bounded rationality into game-theoretic analysis, [9] introduced the concept of quantal response equilibrium (QRE). The key idea behind QRE is the inclusion of a payoff disturbance for each pure strategy. Within a QRE framework, retailers often make the “better response” instead of the “best response”, enabling a more accurate interpretation of the actual situation. One widely utilized quantal response function is the logit response function, which has a long-standing tradition in the study of individual choice behavior. In this study, we adopt the logit QRE model. While certain prior works have examined retailers’ bounded-rationality ordering behavior using the QRE framework [10,33], none have explored the existence and uniqueness of such QRE. In this section, we shall establish the existence of QRE within our transshipment game, as defined in Section 4, and outline the conditions necessary to ensure uniqueness of the QRE. Additionally, we demonstrate the relationship between the QRE solution and the Nash-equilibrium solution previously addressed in RKP.

4.1. Existence of QRE

Since there is only one parameter λ called the bounded rationality parameter in the logit QRE model, one can deal with it conveniently. We now provide the definition of the logit QRE model of our transshipment game.
Definition 1.
For any given  λ 0 , a logit QRE is any  p Δ  such that, for each  i N  and  m { 1 , , M i } ,
p i m = e λ π i m ( p ) q i Q i e λ π i ( q i , p j )
We denote the set of logit QRE with one bounded rationality parameter λ by σ λ = { p Δ   |   p i m = e λ π i m ( p ) / q i Q i e λ π i ( q i , p j ) , i N } . Intuitively, if retailer j determines a mixed ordering strategy, a certain ordering quantity of retailer i which can result in more profit will be chosen with a higher probability. There is only one parameter λ which is called the bounded rationality parameter in Equation (2). From [9], we can state that, as λ goes to infinity, the limiting point of the QRE is a subset of the Nash equilibrium and that, if λ = 0 , retailers choose any ordering quantity with equal probability. Hence, retailers become more rational as λ gets larger and the ordering quantities are closer to Nash-equilibrium ordering quantities. The QRE model can capture the essence of assumption 1 proposed in Section 3 well. From the system of the QRE model, any feasible ordering quantity would be chosen with a strictly positive probability even though it may cause negative or zero profit. Now, we provide the following proposition.
Proposition 1.
For any transshipment game  Γ  satisfying  c i j [ s i + τ i j , v j ]  and  λ 0 , there exists a QRE.
Proof. 
According to RKP, retailers’ profit functions are strictly convex when c i j [ s i + τ i j , v j ] , which limits the amount of ordering quantities to a certain range. For any p Δ , Let f ( p , λ ) = ( f q i m ( p ) : q i m Q i , i N ) with f q i m ( p , λ ) = e λ π i m ( p ) / q i Q i e λ π i ( q i , p j ) . With definitions of Δ and f ( p ) , it can be easily verified that f is a continuous mapping from Δ to itself since Δ is a convex and compact nonempty set. An application of Brouwer’s fixed point theorem leads to the conclusion that there exists a QRE as a fixed point of f ( p ) . Hence, the proposition immediately follows. □
Proposition 1 asserts the existence of at least one Quantal Response Equilibrium (QRE) within the defined transshipment game. While [10] demonstrated that an absence of QRE can occur with infinite ordering boundaries, we mitigate this by constraining the transshipment price to maintain the convexity of the retailers’ profit function. This restriction narrows the range of ordering quantities and ensures the presence of QRE in this transshipment game. An essential characteristic of transshipment QRE is that a higher probability is assigned to the selection of the superior ordering quantity. In practical scenarios, even when the retailer’s ordering quantity deviates from the optimal value, there is still a higher likelihood of selecting the optimal quantity or those in close proximity. As a result, retailers are more likely to generate greater profits. Multiple QREs may exist in the transshipment game, leading to increased complexity in the ordering decisions. To enhance the predictive capability of retailers’ ordering behavior, we will explore the notion of QRE uniqueness.

4.2. Uniqueness of QRE

The RKP proved that for any feasible transshipment price there exists a unique Nash equilibrium in transshipment game and [13] also considered the uniqueness of First-Best Nash equilibrium in a general framework for the transshipment problem. In this subsection we will discuss the uniqueness of QRE in transshipment game.
Intuitively, when λ = 0 , retailers choose any feasible ordering quantity with the same probability, which is the unique QRE. This intuitive property leads to the idea of whether the uniqueness of QRE in transshipment problem depends on the value of λ . Hence, we provide the following proposition.
Proposition 2.
For a sufficiently small  λ , there exists a unique QRE in the transshipment game  Γ .
Proof. 
To prove Proposition 2, we just prove that σ λ is a singleton for a sufficiently small λ . From Definition 1 and Proposition 1, it is indicated that p σ λ if and only if p is a fixed point of f . According to the definition of f in the proof of Proposition 1, we notice that f is Lipschitz continuous in B δ ( 0 ) and that π i m ( p ) is smooth. represents the sup norm. For any a , b σ λ , there are G > 0 and H > 0 such that
f ( a ) f ( b ) = max i , m | f q i m ( a , λ ¯ ) f q i m ( b , λ ¯ ) | λ ¯ G max i , m | π i m ( a ) π i m ( b ) | λ ¯ G H max i , m | a i m b i m | = λ ¯ G H a b
Let λ ¯ G H < 1 and λ ¯ π ¯ ( a ) ,   λ ¯ π ¯ ( b ) < δ . Then, for any λ λ ¯ , it is true that f is a contraction mapping. As an application of contraction mapping theorem, σ λ is a singleton. This completes the proof. □
Proposition 2 demonstrates that retailers possess limited information about the transshipment game due to cognitive and computational limitations when the bounded rationality parameter is small. Consequently, retailers opt for an equal probability of selecting each feasible ordering quantity, leading to a single unique quantal response equilibrium (QRE). However, smaller bounded rationality parameters correspond to lower expected profits. To achieve higher anticipated profits, retailers progressively enhance their cognitive and computational capabilities through repeated participation in transshipment games, thereby increasing the bounded rationality parameter. As a result, QRE in transshipment games initiates from a singular trajectory, with cognitive abilities gradually improving over time via the learning effect, ultimately yielding greater expected profits.
However, another special case where the retailers’ bounded rationality parameter is infinite (e.g., λ ) should also be considered. Intuitively, as λ , retailers become perfectly rational. Hence, the QRE of transshipment game becomes a Nash equilibrium, which will be discussed in the next subsection.

4.3. The Limiting Point of QRE

In RKP, for any feasible transshipment prices, there exists a unique Nash-equilibrium solution in a two-location decentralized inventory system with transshipment. Retailers who are assumed to be perfectly rational choose the Nash-equilibrium ordering quantities with the probability equal to one. When it comes to our proposed transshipment game where retailers are assumed to be boundedly rational, retailers may not choose the Nash-equilibrium ordering quantities with certainty. Instead, in any QRE, they may choose any feasible ordering quantity, but the probability of choosing the optimal ordering quantity is higher than other ordering quantities.
Moreover, we find that the solution in the RKP is a special case in our transshipment game based QRE. Therefore, we provide the following proposition and briefly state the proof of it.
Proposition 3.
As  λ , retailers’ ordering behavior in our transshipment game will converge to the unique Nash-equilibrium ordering quantity (we assume that it is included in the set of retailers’ feasible ordering quantities) which was discussed in the RKP.
Proof. 
From Theorems 2 and 3 in [9], the graph of QRE, σ λ , contains a unique branch which starts at the centroid for λ = 0 and converges to a unique Nash equilibrium as λ goes to infinity. Hence, the abovementioned implies that, as the transshipment game repeats, retailers become more rational (as λ increases). It will result in a sequence of retailers’ QRE. Retailers’ mixed ordering strategies are different in different QRE. However, the sequence of retailers’ QRE will converges to a unique Nash equilibrium as λ . Hence, it can be easily verified by contradiction that retailers’ ordering quantities at the limiting point of the sequence of retailers’ QRE are the same as these Nash-equilibrium ordering quantities in the RKP. □
The implication of Proposition 3 is that with the strengthening of learning effects, retailers gradually overcome the limitations of cognition and information, and the bounded rationality parameter gradually increases, so retailers reach the optimal ordering quantities step by step. The RKP has proved that there is a unique Nash equilibrium in a perfect-rationality transshipment model when c i j [ s i + τ i j , v j ] . In our bounded-rationality transshipment model, when the bounded rationality parameter reaches a certain degree, the retailers realize that the optimal ordering quantity will lead to the optimal profit. Therefore, the retailer will choose the optimal ordering quantity of the perfect-rationality transshipment model, so as to achieve the same unique Nash equilibrium.

5. Algorithm of QRE in Transshipment Game

5.1. Learning Effect

We describe the only parameter λ as the level of rationality of retailers. It is reasonable to believe that retailers’ rationality would gradually increase with the repetition of the transshipment game, which can be regarded as a learning effect over time. This learning effect is captured in many behavior experiments [33,49,50], indicating that retailers become “more rational” through repeated games. Hence, to incorporate this learning effect in our transshipment model, we can also believe that the bounded rationality parameter grows over period t . Ref. [49] assumed that individuals adopt an exponential learning curve. The initial bounded rationality parameter is denoted by λ 0 = 0 and the rate of learning is η . Therefore, λ t = ρ e η t , t 1 , ρ is a constant. As t , λ t .
However, the authors in [51] suggested that the bounded rationality parameter of each period increase linearly with the bounded rationality parameter of the previous period. Hence, there exists a constant c > 0 , then the bounded rationality parameter in period t can be denoted as λ t = ( c + 1 ) λ t 1 , and the parameter c can be similarly viewed as the rate of learning. Also, as t , λ t . In the following subsection, with the two different learning effect mentioned above, we will design an algorithm for computing the quantal response equilibrium in the transshipment game.

5.2. An Algorithm for Calculating QRE Based on Learning Effects

Typically, the QRE or the defining fixed-point equations which involve non-polynomial equations only can be solved numerically. In empirical research, one can estimate the bounded rationality parameter λ by the maximum likelihood estimation method [33]. As the existence of learning effect in the transshipment game, we consider that the bounded rationality parameter changes dynamically with repetition of the transshipment game. Hence, based on the learning effect, we design an algorithm to calculate the QRE of the transshipment game.
This algorithm calculates the QRE of the current period by using the QRE of the previous period in an iterative way. We start at an original mixed ordering strategy profile denoted by p 0 = ( p i 0 , p j 0 ) where retailers choose each feasible ordering quantity with equal probability ( λ = 0 ). We define t as the period of the transshipment game. Then, the bounded rationality parameter increases with period t . When t = 0 , retailer i chooses each feasible ordering quantity with the probability p i m 0 = 1 / M i . As period t increases, we can use the following equations to calculate the QRE of period ( t + 1 ) .
p i m t + 1 = e λ t + 1 π i ( q i m , p j t ) q i Q i e λ t + 1 π i ( q i , p j t ) ,   π i ( q i , p j t ) = q j Q j p j t ( q j ) π i ( q i , q j )
p j m t + 1 = e λ t + 1 π j ( p i t , q j m ) q j Q j e λ t + 1 π j ( p i t , q j ) ,   π j ( p i t , q j ) = q i Q i p i t ( q i ) π j ( q i , q j )
Let p = ( p i , p j ) be the Nash equilibrium. According to Equations (3) and (4), we can know that as t and λ , the probability of retailers choosing the optimal ordering quantities would gradually approach one. This guarantees the convergence of the algorithm. When p t + 1 p ε , ε is a sufficiently small constant, the QRE converges to the Nash equilibrium. Then, the iterative computation would be finished.
In an actual program, we let the initial bounded rationality parameter be a small number. Then, the initial QRE is saved for the next stage. We present steps of this algorithm as follows.
Step1.
Initialize the relevant parameters.
Step2.
Configure the retailers’ initial mixed ordering strategy profile p t = ( p i t , p j t ) .
Step3.
Calculate the retailers’ initial expected profits for each feasible ordering quantity π i ( q i , σ j t ) , π j ( σ i t , q j ) , and save them in an array.
Step4.
t = t + 1 , λ t = λ 0 e η ( t 1 ) or λ t = ( c + 1 ) λ t 1 .
Step4
According to equation (3) and equation (4), calculate the new mixed ordering strategy profile p t + 1 = ( p i t + 1 , p j t + 1 ) .
Step5.
If p t + 1 p ε ;
Break.
Else;
Repeat Step3~Step5.
Step6.
End.

6. Numerical Study

We use the algorithm designed above to calculate a case where the demand at two locations is independently and identically distributed. We assume that demand is distributed uniformly and discretely over an interval [ 1 , 10 ] . Hence, retailer i will choose any ordering quantity in Q i = { 1 , 2 , 3 , , 10 } . We allow the initial bounded rationality parameter to be 0, i.e., λ 0 = 0 , which means that the initial probability of retailer i choosing any ordering quantity in Q i is 0.1 . The two retailers are assumed to be homogeneous; each retailer can procure unit inventory at cost, c i = c j = 20 , and sell it at unit price, r i = r j = 40 . Unit salvage value s i = s j = 10 , and we ignore the penalty for lost sales, l i = l j = 0 . When the transshipment occurs, the unit transshipment price c i j = c j i = 25 and the unit transport cost τ i j = τ j i = 2 .
With parameters described as above, one can easily find the Nash-equilibrium ordering quantity; say q = ( q i = 5 , q j = 5 ) . We use an exponential learning curve in this numerical case. Figure 1 shows the distribution of ordering quantities of retailer i corresponding to different bounded rationality parameters. The initial probability of any ordering quantity is 0.1 when λ = 0 . As λ increases, the probability of choosing a Nash-equilibrium ordering quantity gradually becomes larger. In addition, each line in Figure 1 corresponds to a QRE. Since the probability of retailer i choosing the Nash-equilibrium ordering quantity is close to 1 at λ = 5.841128 , the retailer i can be seen as perfectly rational at this bounded rationality parameter. Another interesting finding is that retailer i is more likely to choose larger ordering quantities near the Nash-equilibrium ordering quantity. It seems that the retailer prefers to have a surplus rather than a shortage. The similar finding was also discussed in [11]. The main reason for this phenomenon is that, once the product is out of stock, it can be observed at any time during the selling season, while the product surplus only appears at the end of the selling season.
Due to the learning effect, the retailers’ bounded rationality parameter increases with game repetition. It can be seen in Figure 2 that the bounded rationality parameter does not change significantly in the first 60 periods and then increases dramatically, which is consistent with the characteristics of an exponential learning effect. We can find that the probability of retailer i choosing any ordering quantity changes with the repetition of the transshipment game, as shown in Figure 3. The probability of retailer i choosing the Nash-equilibrium ordering quantity increases with t , and finally converges to one at t = 80 . The probability of choosing q i = 4 , 5 , 6 which is near the Nash-equilibrium ordering quantity increases first, then decreases, and finally converges to zero. Other ordering quantities are chosen with a decreasing probability which finally converges to zero at t = 80 .

7. Conclusions

Inventory transshipment has the potential to simultaneously reduce inventory levels and increase service levels. However, traditional models solely assume perfectly rational decision makers and overlook the possibility of biased decision making by human actors. To explore systematic ordering deviations, we incorporate bounded rationality into retailers’ ordering behaviors by utilizing the concept of quantal response equilibrium (QRE) in a system involving two independent retailers, akin to the RKP model. Our research yields valuable managerial insights:
Firstly, we establish the existence of QRE for the ordering decisions made independently by two retailers. Regardless of the specific transshipment price, there is always at least one QRE present in the defined transshipment game. In practical settings, even when retailers’ ordering quantities tend to deviate from the optimal amount, there should be a higher likelihood of selecting the optimal quantity or those in close proximity to optimize profits.
Secondly, we investigate the conditions under which such QRE becomes unique. Retailers choose each feasible ordering quantity with equal probability, resulting in a unique QRE when the bounded rationality parameter is sufficiently small. To maximize profits, retailers need to gradually enhance their cognitive or computational abilities through repeated participation in transshipment games, leveraging the learning effect.
Thirdly, we identify the condition in which the QRE and Nash equilibrium are equivalent. RKP developed the notion that a unique Nash equilibrium exists in traditional transshipment models for any feasible transshipment price. Through the strengthening of the learning effect, the retailer gradually overcomes the limitations of cognition and information, leading to an increase in the bounded rationality parameter. This progression allows retailers to make optimal ordering decisions incrementally, ensuring the realization of maximum profits.
Finally, we demonstrate that the right side of the optimal ordering quantity is chosen with a higher probability than the left side. This can be attributed to the fact that stockouts may occur at any point during the selling season, whereas product surpluses typically emerge towards the end. To avoid penalties associated with stockouts during the selling season, retailers prefer having a surplus rather than a shortage. Consequently, it is crucial to modify the evaluation mechanisms for inventory managers in practical scenarios.
There are several avenues for future research. Firstly, considering that the retailer adopts a mixed ordering strategy at quantal response equilibrium (QRE), an intriguing question emerges regarding the distribution of ordering quantities when the demand distribution is known. Su demonstrated that the ordering quantities of a single newsvendor follow a truncated normal distribution in the case of uniformly distributed demand [11]. Therefore, it is of interest to investigate whether the ordering quantities in our transshipment model exhibit a similar property. Secondly, our study focuses solely on the scenario involving two independent retailers. It is worth exploring whether QRE still exists when multiple retailers are involved. Lastly, the same question arises when considering multiple-stage transshipments.

Author Contributions

Conceptualization, Q.H.; methodology, T.S.; software, T.S.; validation, T.S.; formal analysis, T.S.; writing—original draft preparation, T.S.; writing—review and editing, Q.H., F.X.; supervision, Q.H. And W.Q. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported in part by a research grant from National Natural Science Foundation of China (No. 72161004, 71661004), Chinese Postdoctoral Science Foundation (No. 2017M 610743), Natural Science Foundation of Guizhou Province of China (No. ZK [2021]-323), Educational Commission of Guizhou Province (No. 23RWJD009), Key Special Project of Guizhou University’s Research Base and Think Tank (No. GDZX2021033), Guizhou University Talent Introduction Scientific Research Project (No. RJ 2021-1).

Data Availability Statement

Available on request.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Das, S.K.; Kuthambalayan, T.S. Matching supply and demand with lead-time dependent price and with safety stocks in a make-to-order production system. Systems 2022, 10, 256. [Google Scholar] [CrossRef]
  2. Ton, Z. The Role of Store Execution in Managing Product Availability; Harvard University, Graduate School of Business Administration: Cambridge, MA, USA, 2002; pp. 12–18. [Google Scholar]
  3. Gaur, V.; Kesavan, S.; Raman, A. Retail inventory: Managing the canary in the coal mine. Calif. Manag. Rev. 2014, 56, 55–77. [Google Scholar] [CrossRef] [Green Version]
  4. Chou, Y.-C.; Kamano, K.; Yu, M.-S. Dynamic Matching of Uncertain Demand with Uncertain Supply for Bike Sharing Systems. Int. J. Ind. Eng. Theory Appl. Pract. 2020, 26. [Google Scholar] [CrossRef]
  5. Narus, J.A.; Anderson, J.C. Rethinking distribution: Adaptive channels. Harv. Bus. Rev. 1996, 74, 112–120. [Google Scholar] [CrossRef]
  6. Zhao, H.; Xu, L.; Siemsen, E. Inventory sharing and demand-side under weighting. Manuf. Serv. Oper. Manag. 2020, 135, 1319–1361. [Google Scholar] [CrossRef]
  7. Rudi, N.; Kapur, S.; Pyke, D.F. A two-location inventory model with transshipment and local decision making. Manag. Sci. 2001, 47, 1668–1680. [Google Scholar] [CrossRef] [Green Version]
  8. Luce, R.D. Individual Choice Behavior; Wesley: New York, NY, USA, 1959. [Google Scholar]
  9. McKelvey, R.D.; Palfrey, T.R. Quantal response equilibria in normal form games. Games Econ. Behav. 1995, 10, 6–38. [Google Scholar] [CrossRef] [Green Version]
  10. Li, S.; Chen, K.Y. The commitment conundrum of inventory sharing. Prod. Oper. Manag. 2020, 29, 353–370. [Google Scholar] [CrossRef]
  11. Su, X.M. Bounded rationality in newsvendor models. Manuf. Serv. Oper. Manag. 2008, 10, 566–589. [Google Scholar] [CrossRef] [Green Version]
  12. Abouee-Mehrizi, S.; Berman, O.; Sharma, S. Optimal joint replenishment and transshipment policies in a multi-period inventory system with lost sales. Oper. Res. 2015, 63, 342–350. [Google Scholar] [CrossRef]
  13. Anupindi, R.; Bassok, Y.; Zemel, E. A general framework for the study of decentralized distribution systems. Manuf. Serv. Oper. Manag. 2001, 3, 373–381. [Google Scholar] [CrossRef]
  14. Cömez, N.; Stecke, K.E.; Cakanyldlm, M. In-season transshipments among competitive retailers. Manuf. Serv. Oper. Manag. 2012, 14, 290–300. [Google Scholar] [CrossRef] [Green Version]
  15. Li, X.H.; Sun, L.Y.; Gao, J. Coordinating preventive lateral transshipment between two locations. Comput. Ind. Eng. 2013, 66, 933–943. [Google Scholar] [CrossRef]
  16. Dan, B.; He, Q.R.; Zheng, K. Ordering and pricing model of retailers’ preventive transshipment dominated by manufacturer with conditional return. Comput. Ind. Eng. 2016, 100, 24–33. [Google Scholar] [CrossRef]
  17. Fang, X.; Cho, S.H. Stability and endogenous formation of inventory transshipment networks. Oper. Res. 2014, 62, 1316–1334. [Google Scholar] [CrossRef]
  18. Feng, P.; Wu, F.; Fung, R.; Jia, T. The order and transshipment decisions in a two-location inventory system with demand forecast updates. Comput. Ind. Eng. 2015, 135, 53–66. [Google Scholar] [CrossRef]
  19. Paterson, C.; Kiesmüller, G.; Teunter, R.; Glazebrook, K. Inventory models with lateral transshipments: A review. Eur. J. Oper. Res. 2011, 210, 125–136. [Google Scholar] [CrossRef] [Green Version]
  20. Rong, Y.; Snyder, L.V.; Sun, Y. Inventory sharing under decentralized preventive transshipments. Nav. Res. Logist. 2010, 57, 540–562. [Google Scholar] [CrossRef]
  21. Wang, Z.; Dai, Y.; Fang, S.; Xu, Y. Inventory transshipment game with limited supply: Trap or treat. Nav. Res. Logist. 2020, 67, 383–403. [Google Scholar] [CrossRef]
  22. Yan, X.; Zhao, H. Decentralized inventory sharing with asymmetric information. Oper. Res. 2011, 59, 1528–1538. [Google Scholar] [CrossRef]
  23. Li, Q.; Yu, P.; Du, L. Separation of perishable inventories in offline retailing through transshipment separation of perishable inventories in offline retailing through transshipment. Oper. Res. 2022, 70, 666–689. [Google Scholar] [CrossRef]
  24. Griffin, E.C.; Keskin, B.B.; Allaway, A.W. Clustering retail stores for inventory transshipment. Eur. J. Oper. Res. 2023, 311, 690–707. [Google Scholar] [CrossRef]
  25. Fu, Q.; Liu, L.; Shang, W. Bilateral transshipment between competing retailers. Nav. Res. Logist. 2023, 18, 1–13. [Google Scholar] [CrossRef]
  26. Li, Y.; Liao, Y.; Hu, X.X.; Shen, W.J. Lateral transshipment with partial request and random switching. Omega 2020, 92, 102–143. [Google Scholar] [CrossRef]
  27. He, Q.; Shi, R.; Tang, G. Hybrid transshipment policy and ordering model for multiple periods with customer switching behaviour. Discret. Dyn. Nat. Soc. 2021, 2021, 5996579. [Google Scholar] [CrossRef]
  28. Li, S.; Chen, K.Y.; Rong, Y. The behavioral promise and pitfalls in compensating store managers. Manag. Sci. 2020, 66, 4899–4919. [Google Scholar] [CrossRef]
  29. Donohue, K.; Özer, Ö.; Zheng, Y.C. Behavioral operations: Past, present, and future. Manuf. Serv. Oper. Manag. 2020, 22, 191–202. [Google Scholar] [CrossRef] [Green Version]
  30. Schweitzer, M.E.; Cachon, G.P. Decision bias in the newsvendor problem with a known demand distribution: Experimental evidence. Manag. Sci. 2000, 46, 404–420. [Google Scholar] [CrossRef] [Green Version]
  31. Bostian, A.J.; Holt, C.A.; Smith, A.M. Newsvendor “pull-to-center” effect: Adaptive learning in a laboratory experiment. Manuf. Serv. Oper. Manag. 2008, 10, 590–608. [Google Scholar] [CrossRef] [Green Version]
  32. Chen, X.; Sim, M.; Simchi-Levi, D.; Sun, P. Risk aversion in inventory management. Oper. Res. 2007, 55, 828–842. [Google Scholar] [CrossRef] [Green Version]
  33. Chen, Y.F.; Su, X.M.; Zhao, X.B. Modeling bounded rationality in capacity allocation games with the quantal response equilibrium. Manag. Sci. 2012, 58, 1952–1962. [Google Scholar] [CrossRef] [Green Version]
  34. Katok, E.; Pavlov, V. Fairness in supply chain contracts: A laboratory study. J. Oper. Manag. 2013, 31, 129–137. [Google Scholar] [CrossRef]
  35. Lau, N.; Bearden, J.N. Newsvendor demand chasing revisited. Manag. Sci. 2013, 59, 1245–1249. [Google Scholar] [CrossRef]
  36. Li, M.; Petruzzi, N.C.; Zhang, J. Overconfident competing newsvendors. Manag. Sci. 2017, 63, 2637–2646. [Google Scholar] [CrossRef]
  37. Long, X.Y.; Nasiry, J. Prospect theory explains newsvendor behavior: The role of reference points. Manag. Sci. 2015, 61, 3009–3012. [Google Scholar] [CrossRef] [Green Version]
  38. Nagarajan, M.; Shechter, S. Prospect theory and the newsvendor problem. Manag. Sci. 2014, 60, 1057–1062. [Google Scholar] [CrossRef]
  39. Ren, Y.; Croson, R. Overconfidence in newsvendor orders: An experimental study. Manag. Sci. 2013, 59, 2502–2517. [Google Scholar] [CrossRef]
  40. Uppari, B.S.; Hasija, S. Modeling newsvendor behavior: A prospect theory approach. Manuf. Serv. Oper. Manag. 2019, 21, 481–500. [Google Scholar] [CrossRef] [Green Version]
  41. Bolton, G.E.; Ockenfels, A.; Thonemann, U.W. Managers and students as newsvendors. Manag. Sci. 2012, 58, 2225–2233. [Google Scholar] [CrossRef] [Green Version]
  42. Wu, D.; Chen, F. The distributionally robust inventory strategy of the overconfident retailer under supply uncertainty. Systems 2023, 11, 333. [Google Scholar] [CrossRef]
  43. Kirshner, S.N.; Ovchinnikov, A. Heterogeneity of reference effects in the competitive newsvendor problem. Manuf. Serv. Oper. Manag. 2019, 21, 571–581. [Google Scholar] [CrossRef]
  44. Katok, E.; Villa, S. Centralized or decentralized transfer prices: A behavioral approach for improving supply chain coordination. Manuf. Serv. Oper. Manag. 2021, 136, 143–158. [Google Scholar] [CrossRef]
  45. Li, J.R.; Li, M.; Zhao, X. Transshipment between overconfident newsvendors. Prod. Oper. Manag. 2021, 30, 2803–2813. [Google Scholar] [CrossRef]
  46. Villa, S.; Castaneda, J.A. Transshipments in supply chains: A behavioral investigation. Eur. J. Oper. Res. 2018, 269, 715–729. [Google Scholar] [CrossRef] [Green Version]
  47. Yang, C.L.; Hu, Z.Y.; Zhou, S.X. Multilocation newsvendor problem: Centralization and inventory pooling. Manag. Sci. 2021, 67, 185–200. [Google Scholar] [CrossRef]
  48. He, Q.; Shi, T.; Liu, B.; Qiu, W. The ordering optimization model for bounded rational retailer with inventory transshipment. Mathematics 2022, 10, 1079. [Google Scholar] [CrossRef]
  49. McKelvey, R.D.; Palfrey, T.R. An experimental study of the centipede game. Econometrica 1992, 60, 803–836. [Google Scholar] [CrossRef]
  50. Papanastasiou, Y. Newsvendor decisions with two-sided learning. Manag. Sci. 2020, 66, 5408–5426. [Google Scholar] [CrossRef]
  51. Turocy, T.L. A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence. Games Econ. Behav. 2005, 51, 243–263. [Google Scholar] [CrossRef]
Figure 1. Distribution of order quantities with different λ .
Figure 1. Distribution of order quantities with different λ .
Systems 11 00357 g001
Figure 2. Trend of the bounded rationality parameter caused by the learning effect.
Figure 2. Trend of the bounded rationality parameter caused by the learning effect.
Systems 11 00357 g002
Figure 3. Trend of probability of different order quantities.
Figure 3. Trend of probability of different order quantities.
Systems 11 00357 g003
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

He, Q.; Shi, T.; Xu, F.; Qiu, W. Decentralized Inventory Transshipments with Quantal Response Equilibrium. Systems 2023, 11, 357. https://doi.org/10.3390/systems11070357

AMA Style

He Q, Shi T, Xu F, Qiu W. Decentralized Inventory Transshipments with Quantal Response Equilibrium. Systems. 2023; 11(7):357. https://doi.org/10.3390/systems11070357

Chicago/Turabian Style

He, Qingren, Taiwei Shi, Fei Xu, and Wanhua Qiu. 2023. "Decentralized Inventory Transshipments with Quantal Response Equilibrium" Systems 11, no. 7: 357. https://doi.org/10.3390/systems11070357

APA Style

He, Q., Shi, T., Xu, F., & Qiu, W. (2023). Decentralized Inventory Transshipments with Quantal Response Equilibrium. Systems, 11(7), 357. https://doi.org/10.3390/systems11070357

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop