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 |
|
2006 Journal Articles
|
Vlachos, P., Vrechopoulos, A. & Pateli, A. (2006), Drawing Emerging Business Models for the Mobile Music Industry, Electronic Markets, vol. 16, no. 3, pp. 154-168 |
|
|
D. Magos, I. Mourtos, L. Pitsoulis: The matching predicate and a filtering scheme based on matroids. Journal of Computers 1, 37-42 (2006), invited article. |
|
G. Appa, D. Magos, I. Mourtos and J.C.M. Janssen: On the Orthogonal Latin Squares polytope, Discrete Mathematics 306, 171-187 (2006). |
|
G. Appa, D. Magos and I. Mourtos: On multi-index assignment polytopes. Linear Algebra and its Applications 416, 224–241 (2006). |
|
G. Appa, D. Magos and I. Mourtos: A new class of facets for the Latin square polytope, Discrete Applied Mathematics 154, 900-911 (2006). |
|
|
|
|
<< Start < Prev 1 2 3 Next > End >>
|
|
Page 1 of 3 |
|
|
