z-logo
Premium
The transshipment fund mechanism: Coordinating the decentralized multilocation transshipment problem
Author(s) -
Hanany Eran,
Tzur Michal,
Levran Alon
Publication year - 2010
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.20405
Subject(s) - transshipment (information security) , computer science , economic shortage , incentive , operations research , profit (economics) , mechanism (biology) , incentive compatibility , mathematical optimization , microeconomics , economics , mathematics , computer security , linguistics , philosophy , epistemology , government (linguistics)
The multilocation replenishment and transshipment problem is concerned with several retailers facing random demand for the same item at distinct markets, that may use transshipments to eliminate excess inventory/shortages after demand realization. When the system is decentralized so that each retailer operates to maximize their own profit, there are incentive problems that prevent coordination. These problems arise even with two retailers who may pay each other for transshipped units. We propose a new mechanism based on a transshipment fund, which is the first to coordinate the system, in a fully noncooperative setting, for all instances of two retailers as well as all instances of any number of retailers. Moreover, our mechanism strongly coordinates the system, i.e., achieves coordination as the unique equilibrium. The computation and information requirements of this mechanism are realistic and relatively modest. We also present necessary and sufficient conditions for coordination and prove they are always satisfied with our mechanism. Numerical examples illustrate some of the properties underlying this mechanism for two retailers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here