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 |
|
2004 Book Chapters
|
S. Klein, A. Poulymenakou, K. Riemer, D. Papakyriakopoulos, M. Gogolin, and A. Nikas. In Sean Eom, editor, Inter-Organizational Information Systems in the Internet Age. Idea Group Publishing, London UK, 2004. |
|
|
Koutsiouris, V., Vlachos, P. & Vrechopoulos, A. (2004), Developing & Evaluating Mobile Entertainment Applications, Lectures Notes in Computer Science, vol. 3166, pp. 513-517 (Impact Factor 2004=0.50) |
|
|
|
|
|
|
|
