Skip to main content
Erschienen in: Business & Information Systems Engineering 5/2009

01.10.2009 | BISE – Research Paper

How to Coordinate Value Generation in Service Networks

A Mechanism Design Approach

verfasst von: Benjamin Blau, Clemens van Dinther, Tobias Conte, Yongchun Xu, Christof Weinhardt

Erschienen in: Business & Information Systems Engineering | Ausgabe 5/2009

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Weitere Produktempfehlungen anzeigen
Fußnoten
1
Cp. e.g. Amazon’s Simple Storage Service S3 (http://​aws.​amazon.​com/​s3) or Google’s map service Google Maps (http://​maps.​google.​com).
 
6
For the reader's convenience the terms service offer, service and node are used interchangeably
 
7
The reverse ownership information σ −1:V\{v s , v f } → S maps service offers to single service providers that own that particular service
 
8
For the reader's convenience the notion e ij is equivalent to https://static-content.springer.com/image/art%3A10.1007%2Fs12599-009-0070-3/12599_2009_70_IEq4_HTML.gif representing an interoperable connection of service i ∈ V with service j ∈ V.
 
9
Focusing on the presence or absence of a particular service i  ∈  V, F i represents the set of all feasible paths from source to sink in the reduced graph G i without node i and without all its incoming and outgoing edges. In contrary, let F i be the subset of all feasible paths from source to sink that explicitly entail node i.
 
10
For the reader's convenience, the notion https://static-content.springer.com/image/art%3A10.1007%2Fs12599-009-0070-3/12599_2009_70_IEq23_HTML.gif is short for https://static-content.springer.com/image/art%3A10.1007%2Fs12599-009-0070-3/12599_2009_70_IEq24_HTML.gif which denotes the overall utility of the path f* allocated by o(B) based on service providers’ bids.
 
11
For the sake of simplicity, the expression allocated service offer means that this service offer has an incoming edge that is entailed in the allocated set of edges f*. Analogously, the expression allocated service provider means that a service provider owns at least one allocated service offer.
 
12
We have used a t-test comparing the simulation series results.
 
Literatur
Zurück zum Zitat Archer A, Tardos E (2007) Frugal path mechanisms. In: Proceedings of the 13th annual ACM-SIAM symposium on discrete algorithms, pp 991–999 Archer A, Tardos E (2007) Frugal path mechanisms. In: Proceedings of the 13th annual ACM-SIAM symposium on discrete algorithms, pp 991–999
Zurück zum Zitat Asker J, Cantillon E (2008) Properties of scoring auctions. The RAND Journal of Economics 39(1):69–85 Asker J, Cantillon E (2008) Properties of scoring auctions. The RAND Journal of Economics 39(1):69–85
Zurück zum Zitat Athey S, Bagwell K (2001) Optimal collusion with private information. RAND Journal of Economics 32(3):428–465CrossRef Athey S, Bagwell K (2001) Optimal collusion with private information. RAND Journal of Economics 32(3):428–465CrossRef
Zurück zum Zitat Bichler M, Kalagnanam J (2005) Configurable offers and winner determination in multi-attribute auctions. European Journal of Operational Research 160(2):380–394CrossRef Bichler M, Kalagnanam J (2005) Configurable offers and winner determination in multi-attribute auctions. European Journal of Operational Research 160(2):380–394CrossRef
Zurück zum Zitat Bichler M, Pikovsky A, Setzer T (2005) Kombinatorische Auktionen in der betrieblichen Beschaffung. Eine Analyse grundlegender Entwurfsprobleme. WIRTSCHAFTSINFORMATIK 47(2):126–134 Bichler M, Pikovsky A, Setzer T (2005) Kombinatorische Auktionen in der betrieblichen Beschaffung. Eine Analyse grundlegender Entwurfsprobleme. WIRTSCHAFTSINFORMATIK 47(2):126–134
Zurück zum Zitat 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, 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
Zurück zum Zitat 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 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
Zurück zum Zitat Branco F (1997) The design of multidimensional auctions. RAND Journal of Economics 28(1):63–81CrossRef Branco F (1997) The design of multidimensional auctions. RAND Journal of Economics 28(1):63–81CrossRef
Zurück zum Zitat Che YK (1993) Design competition through multidimensional auctions. RAND Journal of Economics 24(4):668–668CrossRef Che YK (1993) Design competition through multidimensional auctions. RAND Journal of Economics 24(4):668–668CrossRef
Zurück zum Zitat Clarke EH (1971) Multipart pricing of public goods. Public Choice 11(1):17–33CrossRef Clarke EH (1971) Multipart pricing of public goods. Public Choice 11(1):17–33CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat Feigenbaum J, Ramachandran V, Schapira M (2006) Incentive-compatible interdomain routing. In: Proceedings of the 7th ACM conference on electronic commerce, pp 130–139 Feigenbaum J, Ramachandran V, Schapira M (2006) Incentive-compatible interdomain routing. In: Proceedings of the 7th ACM conference on electronic commerce, pp 130–139
Zurück zum Zitat 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 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
Zurück zum Zitat Hagel J III (1996) Spider versus Spider. The McKinsey Quarterly (1):71–80 Hagel J III (1996) Spider versus Spider. The McKinsey Quarterly (1):71–80
Zurück zum Zitat Harel D, Naamad A (1996) The STATEMATE semantics of statecharts. ACM Transactions on Software Engineering and Methodology 5(4):293–333CrossRef Harel D, Naamad A (1996) The STATEMATE semantics of statecharts. ACM Transactions on Software Engineering and Methodology 5(4):293–333CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat Müller R, Perea A, Wolf S (2007) Combinatorial Scoring Auctions, Research Memoranda No. 020, Universiteit Maastricht Müller R, Perea A, Wolf S (2007) Combinatorial Scoring Auctions, Research Memoranda No. 020, Universiteit Maastricht
Zurück zum Zitat Nisan N, Ronen A (2001) Algorithmic mechanism design. Games and Economic Behavior 35:166–196CrossRef Nisan N, Ronen A (2001) Algorithmic mechanism design. Games and Economic Behavior 35:166–196CrossRef
Zurück zum Zitat Nisan N, Ronen A (2007) Computationally feasible VCG mechanisms. Journal of Artificial Intelligence Research 29:19–47 Nisan N, Ronen A (2007) Computationally feasible VCG mechanisms. Journal of Artificial Intelligence Research 29:19–47
Zurück zum Zitat Papadimitriou C (2001) Algorithms, games, and the internet. In: Proceedings of the thirty-third annual ACM symposium on theory of computing, pp 749–753 Papadimitriou C (2001) Algorithms, games, and the internet. In: Proceedings of the thirty-third annual ACM symposium on theory of computing, pp 749–753
Zurück zum Zitat Parkes D, Kalagnanam J (2002) Iterative multiattribute vickrey auctions. Technical report, Harvard University, Boston Parkes D, Kalagnanam J (2002) Iterative multiattribute vickrey auctions. Technical report, Harvard University, Boston
Zurück zum Zitat Parkes DC, Kalagnanam J (2005) Models for Iterative multiattribute procurement auctions. Management Science 51(3):435–451CrossRef Parkes DC, Kalagnanam J (2005) Models for Iterative multiattribute procurement auctions. Management Science 51(3):435–451CrossRef
Zurück zum Zitat Parkes DC, Kalagnanam J, Eso M (2001) Achieving budget-balance with Vickrey-based payment schemes in combinatorial exchanges. IBM Research Report RC 22218 Parkes DC, Kalagnanam J, Eso M (2001) Achieving budget-balance with Vickrey-based payment schemes in combinatorial exchanges. IBM Research Report RC 22218
Zurück zum Zitat Ronen A (2001) On approximating optimal auctions.In: Proceedings of the 3rd ACM conference on electronic commerce, pp 11–17 Ronen A (2001) On approximating optimal auctions.In: Proceedings of the 3rd ACM conference on electronic commerce, pp 11–17
Zurück zum Zitat Ronen A, Lehmann D (2005) Nearly optimal multi attribute auctions. In: Proceedings of the 6th ACM conference on electronic commerce, pp 279–285 Ronen A, Lehmann D (2005) Nearly optimal multi attribute auctions. In: Proceedings of the 6th ACM conference on electronic commerce, pp 279–285
Zurück zum Zitat Salle M, Bartolini C (2004) Management by contract. In: Network operations and management symposium, NOMS 2004. IEEE/IFIP, pp 787–800 Salle M, Bartolini C (2004) Management by contract. In: Network operations and management symposium, NOMS 2004. IEEE/IFIP, pp 787–800
Zurück zum Zitat Tapscott D, Lowy A, Ticoll D (2000) Digital capital: harnessing the power of business webs. Harvard Business School Press, Boston Tapscott D, Lowy A, Ticoll D (2000) Digital capital: harnessing the power of business webs. Harvard Business School Press, Boston
Zurück zum Zitat van Dinther C (2007) Adaptive bidding in single-sided auctions under uncertainty: an agent-based approach in market engineering. Birkhäuser, Basel van Dinther C (2007) Adaptive bidding in single-sided auctions under uncertainty: an agent-based approach in market engineering. Birkhäuser, Basel
Zurück zum Zitat Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. The Journal of Finance 16(1):8–37CrossRef Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. The Journal of Finance 16(1):8–37CrossRef
Zurück zum Zitat Weinhardt C, Holtmann C, Neumann D (2003) Market-Engineering. WIRTSCHAFTSINFORMATIK 45(6):635–640 Weinhardt C, Holtmann C, Neumann D (2003) Market-Engineering. WIRTSCHAFTSINFORMATIK 45(6):635–640
Zurück zum Zitat 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 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
Zurück zum Zitat 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, Artopé A, Goldhammer K, Lange UT, Vierkant E, López-Escobar E, Silvertone R (2000) E-economics. Strategies for the digital marketplace. Springer, Heidelberg
Zurück zum Zitat Zerdick A, Picot A, Schrape K, Steiner F (2004) Formation and early growth of business webs: modular product systems in network markets. Physica, 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
Metadaten
Titel
How to Coordinate Value Generation in Service Networks
A Mechanism Design Approach
verfasst von
Benjamin Blau
Clemens van Dinther
Tobias Conte
Yongchun Xu
Christof Weinhardt
Publikationsdatum
01.10.2009
Verlag
SP Gabler Verlag
Erschienen in
Business & Information Systems Engineering / Ausgabe 5/2009
Print ISSN: 2363-7005
Elektronische ISSN: 1867-0202
DOI
https://doi.org/10.1007/s12599-009-0070-3

Weitere Artikel der Ausgabe 5/2009

Business & Information Systems Engineering 5/2009 Zur Ausgabe

BISE - Impressum

Impressum

BISE - Editorial

Internet of Services

Premium Partner