How to Coordinate Value Generation in Service Networks

Business & Information Systems Engineering - Tập 1 - Trang 343-356 - 2009
Benjamin Blau1, Clemens van Dinther2, Tobias Conte2, Yongchun Xu2, Christof Weinhardt1
1Institute of Information Systems and Management (IISM), Universität Karlsruhe (TH), Karlsruhe, Germany
2Research Center for Information Technology (FZI), Karlsruhe, Germany

Tóm tắt

The fundamental paradigm shift from traditional value chains to agile service value networks implies new economic and organizational challenges. As coordination mechanisms, auctions have proven to perform quite well in situations where intangible and heterogeneous goods are traded. Nevertheless, traditional approaches in the area of multidimensional combinatorial auctions are not quite suitable to enable the trade of composite services. A flawless service execution and therefore the requester’s valuation highly depends on the accurate sequence of the functional parts of the composition, meaning that in contrary to service bundles, composite services only generate value through a valid order of their components. The authors present an abstract model as a formalization of service value networks. The model comprehends a graph-based mechanism implementation to allocate multidimensional service offers within the network, to impose penalties for non-performance and to determine prices for complex services. The mechanism and the bidding language support various types of QoS attributes and their (semantic) aggregation. It is analytically shown that this variant is incentive compatible with respect to all dimensions of the service offer (quality and price). Based on these results, the authors numerically analyze strategic behavior of participating service providers regarding possible collusion strategies.

Tài liệu tham khảo

Archer A, Tardos E (2007) Frugal path mechanisms. In: Proceedings of the 13th annual ACM-SIAM symposium on discrete algorithms, pp 991–999 Asker J, Cantillon E (2008) Properties of scoring auctions. The RAND Journal of Economics 39(1):69–85 Athey S, Bagwell K (2001) Optimal collusion with private information. RAND Journal of Economics 32(3):428–465 Bichler M, Kalagnanam J (2005) Configurable offers and winner determination in multi-attribute auctions. European Journal of Operational Research 160(2):380–394 Bichler M, Pikovsky A, Setzer T (2005) Kombinatorische Auktionen in der betrieblichen Beschaffung. Eine Analyse grundlegender Entwurfsprobleme. WIRTSCHAFTSINFORMATIK 47(2):126–134 Blau B, Block C, Stößer J (2008a) How to trade services? Current status and open questions. In: Proceedings of the international conference on group decision and negotiation (GDN), pp 159–160 Blau B, Lamparter S, Neumann D, Weinhardt C (2008b) Planning and pricing of service mashups. In: Proceedings of the IEEE joint conference on e-commerce technology (CEC’08) and enterprise computing, e-commerce and e-services (EEE ‘08). Washington, DC, pp 19–26 Branco F (1997) The design of multidimensional auctions. RAND Journal of Economics 28(1):63–81 Che YK (1993) Design competition through multidimensional auctions. RAND Journal of Economics 24(4):668–668 Clarke EH (1971) Multipart pricing of public goods. Public Choice 11(1):17–33 Engel Y, Wellman MP, Lochner KM (2006) Bid expressiveness and clearing algorithms in multiattribute double auctions. In: Proceedings of the 7th ACM conference on electronic commerce. ACM Press, New York, pp 110–119 Feigenbaum J, Ramachandran V, Schapira M (2006) Incentive-compatible interdomain routing. In: Proceedings of the 7th ACM conference on electronic commerce, pp 130–139 Feldman M, Chuang J, Stoica I, Shenker S (2005) Hidden-action in multi-hop routing. In: Proceedings of the 6th ACM conference on electronic commerce, pp 117–126 Groves T (1973) Incentives in teams. Econometrica 41(4):617–631 Hagel J III (1996) Spider versus Spider. The McKinsey Quarterly (1):71–80 Harel D, Naamad A (1996) The STATEMATE semantics of statecharts. ACM Transactions on Software Engineering and Methodology 5(4):293–333 Hershberger J, Suri S (2001) Vickrey prices and shortest paths: what is an edge worth? In: Proceedings of 42nd IEEE symposium on foundations of computer science, pp 252–259 Kimbrough SO, Lu M, Murphy F (2004) Learning and tacit collusion by artificial agents in Cournot duopoly games. In: Formal Modelling in Electronic Commerce. Springer, Heidelberg, pp 477–492 Lamparter S, Ankolekar A, Studer R, Grimm S (2007) Preference-based selection of highly configurable web services. In: Proceedings of the 16th international conference on world wide web, pp 1013–1022 Maille P, Tuffin B (2007) Why VCG auctions can hardly be applied to the pricing of inter-domain and ad hoc networks. In: 3rd EuroNGI conference on next generation internet networks, pp 36–39 Müller R, Perea A, Wolf S (2007) Combinatorial Scoring Auctions, Research Memoranda No. 020, Universiteit Maastricht Nisan N, Ronen A (2001) Algorithmic mechanism design. Games and Economic Behavior 35:166–196 Nisan N, Ronen A (2007) Computationally feasible VCG mechanisms. Journal of Artificial Intelligence Research 29:19–47 Papadimitriou C (2001) Algorithms, games, and the internet. In: Proceedings of the thirty-third annual ACM symposium on theory of computing, pp 749–753 Parkes D, Kalagnanam J (2002) Iterative multiattribute vickrey auctions. Technical report, Harvard University, Boston Parkes DC, Kalagnanam J (2005) Models for Iterative multiattribute procurement auctions. Management Science 51(3):435–451 Parkes DC, Kalagnanam J, Eso M (2001) Achieving budget-balance with Vickrey-based payment schemes in combinatorial exchanges. IBM Research Report RC 22218 Ronen A (2001) On approximating optimal auctions.In: Proceedings of the 3rd ACM conference on electronic commerce, pp 11–17 Ronen A, Lehmann D (2005) Nearly optimal multi attribute auctions. In: Proceedings of the 6th ACM conference on electronic commerce, pp 279–285 Salle M, Bartolini C (2004) Management by contract. In: Network operations and management symposium, NOMS 2004. IEEE/IFIP, pp 787–800 Tapscott D, Lowy A, Ticoll D (2000) Digital capital: harnessing the power of business webs. Harvard Business School Press, Boston van Dinther C (2007) Adaptive bidding in single-sided auctions under uncertainty: an agent-based approach in market engineering. Birkhäuser, Basel Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. The Journal of Finance 16(1):8–37 Weinhardt C, Holtmann C, Neumann D (2003) Market-Engineering. WIRTSCHAFTSINFORMATIK 45(6):635–640 Zeng L, Benatallah B, Dumas M, Kalagnanam J, Sheng Q Z (2003) Quality driven web services composition. In: Proceedings of the 12th international conference on world wide web, pp 411–421 Zerdick A, Picot A, Schrape K, Artopé A, Goldhammer K, Lange UT, Vierkant E, López-Escobar E, Silvertone R (2000) E-economics. Strategies for the digital marketplace. Springer, Heidelberg Zerdick A, Picot A, Schrape K, Steiner F (2004) Formation and early growth of business webs: modular product systems in network markets. Physica, Heidelberg