Working Paper Series
|
Stability in a Specialized Supply Chain Setting Issue No. 61 (April - May 2010)
 The stable Supply Chain Network (SCN) configuration, introduced by Ostrovsky [11], is defined on a finite set of agents A that can be divided into k finite disjoint sets, A1 being the set of suppliers, Ak the set of final consumers, and Ai, i={2,3,…,k-1}, the sets of intermediary agents, and asks for a chain stable allocation of the agents. In our current work we present a specialized version of Ostrovsky’s generic framework, and prove that, under this setting, any k-sided SCN can be decomposed to k-1 united SM sub-markets. Moreover, we implement T-algorithm, presented in [11], as a generalization of the Gale-Shapley algorithm [7], and show how an intermediary-optimal solution can be derived, while we prove that the lattice formed by the set of solutions is distributive. Download  List of working papers |
|
2000 Journal Articles
|
A. Vrechopoulos, K. Pramatari, and G. Doukidis. International Journal of New Product Development and Innovation Management, 2(2):163-178, 2000. |
|
|
A. Vrechopoulos, G. Siomkos, and G. Doukidis. Journal of Internet Banking and Commerce, 5(2):--, 2000. |
|
Pramatari K., Papakyriakopoulos D., Lekakos G., and Mylonopoulos N. Journal of Electronic Markets, 11(1):17-25, 2000. (Wein Journal Rating 2001: A) |
|
K. Pramatari, A. Vrechopoulos, N. Mylonopoulos, G. Papamichali, A. Poulymenakou. Stanford -Smith, B. and Kidd, P.T (Eds.), E-business Key Issues, Applications, Technologies, IOS Press, pp. 796-802 |
|
|
|
|
|
|
|
