IDEAS home Printed from https://ideas.repec.org/a/taf/reroxx/v35y2022i1p1457-1480.html
   My bibliography  Save this article

Optimal path selection of innovation resource allocation in China’s regions with shared inputs

Author

Listed:
  • Zhiwen Zhang
  • Zilong Wang
  • Yongfen Zhu

Abstract

As an effective form of interaction between innovation subjects and resources, the regional innovation network’s optimal allocation of resources is the key to improving national innovation capacity. According to the innovation value chain, the process of resource allocation in innovation can be divided into two correlative sub-systems: the knowledge innovation stage (KIS) and the achievements commercialisation stage (ACS). To evaluate regional innovation efficiency, a two-stage network data envelopment analysis model with shared inputs is used, with fuzzy set qualitative comparative analysis to analyse the improvement path of resource allocation efficiency from the dimensions of regional environment and network structure. The results show that efficiency in the KIS is higher than in the ACS, and the efficiency scores for most regions in China are better under the model with shared inputs. The efficiency of innovative resource allocation is affected by the cross-action of seven factors: regional economic development, infrastructure, policy system, social culture, network scale, network openness, and network centrality. To achieve high-efficiency resource allocation, regions should build an innovation network that matches their environmental characteristics. These findings provide theoretical guidance for formulating innovative resource allocation policies suitable for different regions.

Suggested Citation

  • Zhiwen Zhang & Zilong Wang & Yongfen Zhu, 2022. "Optimal path selection of innovation resource allocation in China’s regions with shared inputs," Economic Research-Ekonomska Istraživanja, Taylor & Francis Journals, vol. 35(1), pages 1457-1480, December.
  • Handle: RePEc:taf:reroxx:v:35:y:2022:i:1:p:1457-1480
    DOI: 10.1080/1331677X.2021.1969979
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/1331677X.2021.1969979
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/1331677X.2021.1969979?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:reroxx:v:35:y:2022:i:1:p:1457-1480. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/rero .

    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.