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 Conference Publications
|
G. Appa, D. Magos and I. Mourtos: LP relaxations of multiple all_different predicates. In J.C. Regin, M. Rueher (eds.): Lecture Notes in Computer Science 3011, 364-369 Springer-Verlag (2004). |
|
|
P. Vlachos, A. Vrechopoulos, and G. Giaglis. In EURO XX 20th European Conference on Operational Research: OR and the Management of Electronic Services, July 4-7 2004. |
|
Vlachos, P., Vrechopoulos, A., & Giaglis G. (2004), Exploring Facets of Perceived Service Quality in Mobile Internet Services (MobIS): A Structural Equation Approach, 20th European Conference on Operational Research, July 4-7, Rhodes, Greece (abstract) |
|
K. Pramatari, G.I. Doukidis, and P. Miliotis. In Proceedings of IEEE Conference on Electronic Commerce, July 6-9 2004. |
|
Vlachos, P. & Vrechopoulos, A. (2004), Emerging Customer Trends Towards Mobile Music Services,Proceedings of the 6th International Conference on Electronic Commerce, October 25-27 , Delft, The Netherlands, pp. 566-574 |
|
|
|
|
|
|
|
