IDEAS home Printed from https://ideas.repec.org/a/spr/binfse/v1y2009i5p343-356.html
   My bibliography  Save this article

How to Coordinate Value Generation in Service Networks

Author

Listed:
  • Benjamin Blau
  • Clemens Dinther
  • Tobias Conte
  • Yongchun Xu
  • Christof Weinhardt

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. Copyright Gabler Verlag 2009

Suggested Citation

  • Benjamin Blau & Clemens Dinther & Tobias Conte & Yongchun Xu & Christof Weinhardt, 2009. "How to Coordinate Value Generation in Service Networks," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 1(5), pages 343-356, October.
    • Handle: RePEc:spr:binfse:v:1:y:2009:i:5:p:343-356
    DOI: 10.1007/s12599-009-0070-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s12599-009-0070-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s12599-009-0070-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Athey, Susan & Bagwell, Kyle, 2001. "Optimal Collusion with Private Information," RAND Journal of Economics, The RAND Corporation, vol. 32(3), pages 428-465, Autumn.
    2. Yeon-Koo Che, 1993. "Design Competition through Multidimensional Auctions," RAND Journal of Economics, The RAND Corporation, vol. 24(4), pages 668-680, Winter.
    3. Nisan, Noam & Ronen, Amir, 2001. "Algorithmic Mechanism Design," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 166-196, April.
    4. John Asker & Estelle Cantillon, 2008. "Properties of scoring auctions," RAND Journal of Economics, RAND Corporation, vol. 39(1), pages 69-85, March.
    5. David C. Parkes & Jayant Kalagnanam, 2005. "Models for Iterative Multiattribute Procurement Auctions," Management Science, INFORMS, vol. 51(3), pages 435-451, March.
    6. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    7. Fernando Branco, 1997. "The Design of Multidimensional Auctions," RAND Journal of Economics, The RAND Corporation, vol. 28(1), pages 63-81, Spring.
    8. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    9. Bichler, Martin & Kalagnanam, Jayant, 2005. "Configurable offers and winner determination in multi-attribute auctions," European Journal of Operational Research, Elsevier, vol. 160(2), pages 380-394, January.
    10. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Münch, Christopher & Marx, Emanuel & Benz, Lukas & Hartmann, Evi & Matzner, Martin, 2022. "Capabilities of digital servitization: Evidence from the socio-technical systems theory," Technological Forecasting and Social Change, Elsevier, vol. 176(C).
    2. Holger Karl & Dennis Kundisch & Friedhelm Meyer auf der Heide & Heike Wehrheim, 2020. "A Case for a New IT Ecosystem: On-The-Fly Computing," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 62(6), pages 467-481, December.
    3. Collins, J. & Ketter, W. & Gini, M., 2008. "Flexible Decision Support in Dynamic Interorganizational Networks," ERIM Report Series Research in Management ERS-2008-082-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    4. Tilo Böhmann & Jan Leimeister & Kathrin Möslein, 2014. "Service Systems Engineering," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 6(2), pages 73-79, April.
    5. Timm Teubner & Christoph Flath, 2015. "The Economics of Multi-Hop Ride Sharing," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 57(5), pages 311-324, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiao, Fei & Wang, Haijun & Guo, Shuojia & Guan, Xu & Liu, Baoshan, 2021. "Efficient and truthful multi-attribute auctions for crowdsourced delivery," International Journal of Production Economics, Elsevier, vol. 240(C).
    2. Yu, Hao & Huang, Min & Chao, Xiuli & Yue, Xiaohang, 2022. "Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    3. Papakonstantinou, Athanasios & Bogetoft, Peter, 2017. "Multi-dimensional procurement auction under uncertain and asymmetric information," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1171-1180.
    4. David C. Parkes & Jayant Kalagnanam, 2005. "Models for Iterative Multiattribute Procurement Auctions," Management Science, INFORMS, vol. 51(3), pages 435-451, March.
    5. Papakonstantinou, A. & Bogetoft, P., 2013. "Crowd-sourcing with uncertain quality - an auction approach," MPRA Paper 44236, University Library of Munich, Germany.
    6. Pham, Long & Teich, Jeffrey & Wallenius, Hannele & Wallenius, Jyrki, 2015. "Multi-attribute online reverse auctions: Recent research trends," European Journal of Operational Research, Elsevier, vol. 242(1), pages 1-9.
    7. Müller, R.J. & Perea ý Monsuwé, A. & Wolf, S., 2007. "Combinatorial scoring auctions," Research Memorandum 020, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    8. Amin Sayedi & Kinshuk Jerath & Marjan Baghaie, 2018. "Exclusive Placement in Online Advertising," Marketing Science, INFORMS, vol. 37(6), pages 970-986, November.
    9. Gregory E. Kersten, 2014. "Multiattribute Procurement Auctions: Efficiency and Social Welfare in Theory and Practice," Decision Analysis, INFORMS, vol. 11(4), pages 215-232, December.
    10. Lorentziadis, Panos L., 2020. "Competitive bidding in asymmetric multidimensional public procurement," European Journal of Operational Research, Elsevier, vol. 282(1), pages 211-220.
    11. Martin Bichler & Alexander Pikovsky & Thomas Setzer, 2009. "An Analysis of Design Problems in Combinatorial Procurement Auctions," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 1(1), pages 111-117, February.
    12. Ching-Hua Chen-Ritzo & Terry P. Harrison & Anthony M. Kwasnica & Douglas J. Thomas, 2005. "Better, Faster, Cheaper: An Experimental Analysis of a Multiattribute Reverse Auction Mechanism with Restricted Information Feedback," Management Science, INFORMS, vol. 51(12), pages 1753-1762, December.
    13. Babaioff, Moshe & Nisan, Noam & Pavlov, Elan, 2009. "Mechanisms for a spatially distributed market," Games and Economic Behavior, Elsevier, vol. 66(2), pages 660-684, July.
    14. Zhe Chen, 2021. "The bid orchestration and competitions in scoring procurement auctions," Managerial and Decision Economics, John Wiley & Sons, Ltd., vol. 42(7), pages 1718-1729, October.
    15. Parikshit De & Manipushpak Mitra, 2017. "Incentives and justice for sequencing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 64(2), pages 239-264, August.
    16. Miller, Nathan H., 2014. "Modeling the effects of mergers in procurement," International Journal of Industrial Organization, Elsevier, vol. 37(C), pages 201-208.
    17. Chan, Jimmy & Zhang, Wenzhang, 2015. "Collusion enforcement with private information and private monitoring," Journal of Economic Theory, Elsevier, vol. 157(C), pages 188-211.
    18. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    19. Wang, Hong, 2020. "Quality manipulation and limit corruption in competitive procurement," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1124-1135.
    20. Babaioff, Moshe & Blumrosen, Liad, 2008. "Computationally-feasible truthful auctions for convex bundles," Games and Economic Behavior, Elsevier, vol. 63(2), pages 588-620, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:binfse:v:1:y:2009:i:5:p:343-356. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.