This paper studies a search goods seller's optimal design of consumer pre-search information. Unlike the existing literature, I allow the consumer to have private information on her outside option value, which turns out to be important in shaping the seller's optimal signal. To accommodate this, a relaxed problem approach is developed. When the outside option value has unimodal distribution, I show that the optimal signal would pool all match utilities above a threshold and fully reveal for those below the threshold. Based on this characterization, I provide two comparative statics results. The first shows that higher product quality leads to less accurate pre-search information for consumers. The second shows that allowing the consumer to postpone some search cost leads to lower seller profit and may also (unexpectedly) lead to lower consumer welfare even if the price is fixed. My approach also enables me to consider competition among multiple sellers. In particular, I show that as competition gets increasingly strong, the pre-search information converges to full information, which extends the corresponding result for experience goods. My approach also helps to highlight the key similarity and dissimilarity between information designs for search goods and experience goods, which is discussed throughout the paper.
{"title":"Information Design for Selling Search Goods and the Effect of Competition","authors":"Chengyi Lyu","doi":"10.2139/ssrn.3790012","DOIUrl":"https://doi.org/10.2139/ssrn.3790012","url":null,"abstract":"This paper studies a search goods seller's optimal design of consumer pre-search information. Unlike the existing literature, I allow the consumer to have private information on her outside option value, which turns out to be important in shaping the seller's optimal signal. To accommodate this, a relaxed problem approach is developed. When the outside option value has unimodal distribution, I show that the optimal signal would pool all match utilities above a threshold and fully reveal for those below the threshold. Based on this characterization, I provide two comparative statics results. The first shows that higher product quality leads to less accurate pre-search information for consumers. The second shows that allowing the consumer to postpone some search cost leads to lower seller profit and may also (unexpectedly) lead to lower consumer welfare even if the price is fixed. My approach also enables me to consider competition among multiple sellers. In particular, I show that as competition gets increasingly strong, the pre-search information converges to full information, which extends the corresponding result for experience goods. My approach also helps to highlight the key similarity and dissimilarity between information designs for search goods and experience goods, which is discussed throughout the paper.","PeriodicalId":13594,"journal":{"name":"Information Systems & Economics eJournal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78352810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This is Part 2 of article dedicated to modeling and simulation of career development processes. The simulation algorithm presented here is built on a combined platform of Discrete Events and Agent Based modeling. Main components of the model are employees/agents, the career history of each of which is reproduced in the model. The model takes into account individual characteristics of the agent, the structure and characteristics of the organization personnel policy and many other random factors inherent in career development processes. The hybrid model consists two main sub-models – the sub-model of the agent flow and the submodel of agents’ interaction, which provides simulation of career development processes. The Part 1 of the article presents the sub-model of the agent flow, which is based on the results of a survey of respondents and on a series of theoretical assumptions that made it possible to construct a Discrete Event model of the agent flow. In this part of the article, we present a detailed algorithm related to the Agent Based submodel of the career development processes. The article addresses the production and career components of the agent activity; two types of career mechanisms – a push and a pull movement; the emergence, development and influence of agent coalitions on career development process; the dynamic processes of the agent activity variation, and a number of other factors affecting the career development process.
The algorithms were implemented in the form of Java code. The program code of the model allows you to track and store the career history of each agent, its interaction with other agents, the effect of the model parameters, and evaluate the contribution of each agent and group of agents to the organization's production achievements.
{"title":"Hybrid Discrete Event/Agent Based Model of Career Development.","authors":"A. Cherkassky, Eugene Bumagin","doi":"10.2139/ssrn.3787438","DOIUrl":"https://doi.org/10.2139/ssrn.3787438","url":null,"abstract":"This is Part 2 of article dedicated to modeling and simulation of career development processes. The simulation algorithm presented here is built on a combined platform of Discrete Events and Agent Based modeling. Main components of the model are employees/agents, the career history of each of which is reproduced in the model. The model takes into account individual characteristics of the agent, the structure and characteristics of the organization personnel policy and many other random factors inherent in career development processes. The hybrid model consists two main sub-models – the sub-model of the agent flow and the submodel of agents’ interaction, which provides simulation of career development processes. The Part 1 of the article presents the sub-model of the agent flow, which is based on the results of a survey of respondents and on a series of theoretical assumptions that made it possible to construct a Discrete Event model of the agent flow. In this part of the article, we present a detailed algorithm related to the Agent Based submodel of the career development processes. The article addresses the production and career components of the agent activity; two types of career mechanisms – a push and a pull movement; the emergence, development and influence of agent coalitions on career development process; the dynamic processes of the agent activity variation, and a number of other factors affecting the career development process.<br><br>The algorithms were implemented in the form of Java code. The program code of the model allows you to track and store the career history of each agent, its interaction with other agents, the effect of the model parameters, and evaluate the contribution of each agent and group of agents to the organization's production achievements.","PeriodicalId":13594,"journal":{"name":"Information Systems & Economics eJournal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88140783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
P. Rohde, Vijay Mohan, S. Davidson, C. Berg, Darcy W. E. Allen, G. Brennen, J. Potts
Two of the most important technological advancements currently underway are the advent of quantum technologies, and the transitioning of global financial systems towards cryptographic assets, notably blockchain-based cryptocurrencies and smart contracts. There is, however, an important interplay between the two, given that, in due course, quantum technology will have the ability to directly compromise the cryptographic foundations of blockchain. We explore this complex interplay by building financial models for quantum failure in various scenarios, including pricing quantum risk premiums. We call this ‘quantum crypto-economics’.
{"title":"Quantum Crypto-Economics: Blockchain Prediction Markets for the Evolution of Quantum Technology","authors":"P. Rohde, Vijay Mohan, S. Davidson, C. Berg, Darcy W. E. Allen, G. Brennen, J. Potts","doi":"10.2139/ssrn.3777706","DOIUrl":"https://doi.org/10.2139/ssrn.3777706","url":null,"abstract":"Two of the most important technological advancements currently underway are the advent of quantum technologies, and the transitioning of global financial systems towards cryptographic assets, notably blockchain-based cryptocurrencies and smart contracts. There is, however, an important interplay between the two, given that, in due course, quantum technology will have the ability to directly compromise the cryptographic foundations of blockchain. We explore this complex interplay by building financial models for quantum failure in various scenarios, including pricing quantum risk premiums. We call this ‘quantum crypto-economics’.","PeriodicalId":13594,"journal":{"name":"Information Systems & Economics eJournal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82731007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xinyu Huang, Massimo Guidolin, Emmanouil Platanakis, D. Newton
We present a structured portfolio optimization framework with sparse inverse covariance estimation and an attention-based LSTM network that exploits machine learning (deep learning) techniques. We shrink Wishart volatility towards a Graphical Lasso initial covariance estimator and solve the portfolio optimization using a fast coordinate descent algorithm with regularization determined using a genetic algorithm. We further introduce a novel portfolio shrinkage rule using an attention-based Long-Short-Term-Memory (LSTM) network, allowing a formal selection of reference portfolios where the network forecasts future performance based on predetermined out-of-sample monthly certainty equivalent return. We reduce the dimension of successful candidates and then linearly combine them. When nested within a minimum-variance, Bayes-Stein shrinkage, Black-Litterman portfolio framework with four types of weight constraints based on no-short-selling, upper, lower-generalized variance-based restrictions, our approach delivers a clear improvement over the baseline sample-based minimum-variance portfolio and claims superiority over 11 GARCH models used to forecast covariances, as well as a minimum-variance combination of all dynamic optimization models. We provide an illustrative example based on optimal diversification across hedge fund strategies. Robustness checks show our application of sparse covariance dominates the use of a dimension reduction algorithm for Wishart covariance forecasting.
{"title":"Dynamic Portfolio Management with Machine Learning","authors":"Xinyu Huang, Massimo Guidolin, Emmanouil Platanakis, D. Newton","doi":"10.2139/ssrn.3770688","DOIUrl":"https://doi.org/10.2139/ssrn.3770688","url":null,"abstract":"We present a structured portfolio optimization framework with sparse inverse covariance estimation and an attention-based LSTM network that exploits machine learning (deep learning) techniques. We shrink Wishart volatility towards a Graphical Lasso initial covariance estimator and solve the portfolio optimization using a fast coordinate descent algorithm with regularization determined using a genetic algorithm. We further introduce a novel portfolio shrinkage rule using an attention-based Long-Short-Term-Memory (LSTM) network, allowing a formal selection of reference portfolios where the network forecasts future performance based on predetermined out-of-sample monthly certainty equivalent return. We reduce the dimension of successful candidates and then linearly combine them. When nested within a minimum-variance, Bayes-Stein shrinkage, Black-Litterman portfolio framework with four types of weight constraints based on no-short-selling, upper, lower-generalized variance-based restrictions, our approach delivers a clear improvement over the baseline sample-based minimum-variance portfolio and claims superiority over 11 GARCH models used to forecast covariances, as well as a minimum-variance combination of all dynamic optimization models. We provide an illustrative example based on optimal diversification across hedge fund strategies. Robustness checks show our application of sparse covariance dominates the use of a dimension reduction algorithm for Wishart covariance forecasting.","PeriodicalId":13594,"journal":{"name":"Information Systems & Economics eJournal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73795529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper studies the role of technological sophistication in Initial Coin Offering (ICO) successes and valuations. Using various machine learning methods, we construct technology indexes from ICO whitepapers to capture technological sophistication for all cryptocurrencies. We find that the cryptocurrencies with high technology indexes are more likely to succeed and less likely to be delisted subsequently. Moreover, the technology indexes strongly and positively predict the long-run performances of the ICOs. Overall, the results suggest that technological sophistication is an important determinant of cryptocurrency valuations.
{"title":"Technology and Cryptocurrency Valuation: Evidence from Machine Learning","authors":"Yukun Liu, Jinfei Sheng, Wanyi Wang","doi":"10.2139/ssrn.3577208","DOIUrl":"https://doi.org/10.2139/ssrn.3577208","url":null,"abstract":"This paper studies the role of technological sophistication in Initial Coin Offering (ICO) successes and valuations. Using various machine learning methods, we construct technology indexes from ICO whitepapers to capture technological sophistication for all cryptocurrencies. We find that the cryptocurrencies with high technology indexes are more likely to succeed and less likely to be delisted subsequently. Moreover, the technology indexes strongly and positively predict the long-run performances of the ICOs. Overall, the results suggest that technological sophistication is an important determinant of cryptocurrency valuations.","PeriodicalId":13594,"journal":{"name":"Information Systems & Economics eJournal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90623945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-25DOI: 10.1007/978-3-030-65117-6_1
David C. Brown, Mingfeng Lin
{"title":"An Overview of Technologically Enabled Finance","authors":"David C. Brown, Mingfeng Lin","doi":"10.1007/978-3-030-65117-6_1","DOIUrl":"https://doi.org/10.1007/978-3-030-65117-6_1","url":null,"abstract":"","PeriodicalId":13594,"journal":{"name":"Information Systems & Economics eJournal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91408253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rapid growth in the cloud industry not only provides tremendous opportunities to cloud providers who have invested heavily in computing capacities, but also leads to low utilization of capacities at times. To alleviate this problem, some providers have launched a low-priority service with the so-called preemptible or spot instances, which allows them to reclaim capacities when necessary. This study focuses on an emerging market segment of customers with fault-tolerant computing jobs, who are the potential users of the preemptible instances. Through an analytical model that captures the underlying supply-demand dynamics, we examine a prevalent discount scheme, which provides all users the same discount, and its impact on key performance measures. Having realized that this is a relatively new market segment and there is room for improvement in discount-scheme designs, we propose an interruption-based discount scheme, which provides compensation to users based on the frequency of interruptions encountered by each of them. Our study suggests that the proposed scheme is fairer than the prevalent scheme from the customers’ perspective and that, in the presence of risk-averse customers, the cloud provider could be better off by adopting the proposed scheme when the supply of the surplus capacity is highly uncertain.
{"title":"Discount Schemes for the Preemptible Service of a Cloud Platform with Unutilized Capacity","authors":"Shi Chen, K. Moinzadeh, Yong Tan","doi":"10.2139/ssrn.3272079","DOIUrl":"https://doi.org/10.2139/ssrn.3272079","url":null,"abstract":"Rapid growth in the cloud industry not only provides tremendous opportunities to cloud providers who have invested heavily in computing capacities, but also leads to low utilization of capacities at times. To alleviate this problem, some providers have launched a low-priority service with the so-called preemptible or spot instances, which allows them to reclaim capacities when necessary. This study focuses on an emerging market segment of customers with fault-tolerant computing jobs, who are the potential users of the preemptible instances. Through an analytical model that captures the underlying supply-demand dynamics, we examine a prevalent discount scheme, which provides all users the same discount, and its impact on key performance measures. Having realized that this is a relatively new market segment and there is room for improvement in discount-scheme designs, we propose an interruption-based discount scheme, which provides compensation to users based on the frequency of interruptions encountered by each of them. Our study suggests that the proposed scheme is fairer than the prevalent scheme from the customers’ perspective and that, in the presence of risk-averse customers, the cloud provider could be better off by adopting the proposed scheme when the supply of the surplus capacity is highly uncertain.","PeriodicalId":13594,"journal":{"name":"Information Systems & Economics eJournal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80935771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This is a short article describing Digital transformation as a change-oriented approach that leverages new way of doing the business along with existing businesses across the globe. In prevalent business situations, there is huge transformation of business across industry. The most important thing here is that biggest challenge for all types of organization either small or large it makes sense to adapt digital technology which should sync with the organization. This short article is taken up to explore the various role and nature of Human Resources department in adapting the digital technologies which in turn leads to digital economy. At the same time, it is important that creating value to customers to the customers in digital world is the new challenge in prevalent situation.
{"title":"Role of Human Resources in Digital Transformation - An Outlook","authors":"Hemantha Y","doi":"10.2139/ssrn.3759504","DOIUrl":"https://doi.org/10.2139/ssrn.3759504","url":null,"abstract":"This is a short article describing Digital transformation as a change-oriented approach that leverages new way of doing the business along with existing businesses across the globe. In prevalent business situations, there is huge transformation of business across industry. The most important thing here is that biggest challenge for all types of organization either small or large it makes sense to adapt digital technology which should sync with the organization. This short article is taken up to explore the various role and nature of Human Resources department in adapting the digital technologies which in turn leads to digital economy. At the same time, it is important that creating value to customers to the customers in digital world is the new challenge in prevalent situation. <br><br>","PeriodicalId":13594,"journal":{"name":"Information Systems & Economics eJournal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89757215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dibyendu Brinto Bose, Sheikh Hasib Ahmed, Gias Uddin, M. S. Rahman
In this paper, we aim to understand the topics discussed by bioinformatics practitioners in Stack Exchange sites. We downloaded all bioinformatics posts (questions and accepted answers) from four Stack Exchange Q&A sites (Stack Overflow, Biology, Cross-Validated, and Bioinformatics). Then we applied topic modeling on each site data. We labeled the topics and grouped those into high level categories. We analyzed the topics further by determining their popularity, difficulty, and evolution. We have made a comparative analysis of the topics across the different studied sites. We found 14 topics in Stack Overflow that are grouped into six categories. The number of new bioinformatics questions is steadily increasing over time in Stack Overflow for each topic category. Topics related to sequence analysis and pattern detection are the most popular as well as the most difficult to get an accepted answer. Most of the discussion posts are ‘how’ type questions, i.e., the practitioners were looking for solutions. While topics like biodata processing are found in multiple Stack Exchange sites, other topics (e.g., gene evolution analysis) are found in specialized sites (e.g., Biology). These findings show the need for consulting multiple related sites in Stack Exchange to learn interdisciplinary fields like bioinformatics. The tradeoff between popularity and difficulty of the bioinformatics topics highlights that bioinformatics practitioners need documentation and better tool support. The bioinformatics researchers, organizations, and practitioners can look into our results to prioritize the specific areas that need more focus for improvement.
{"title":"An Empirical Study of Bioinformatics Topics in Online Forum Discussions","authors":"Dibyendu Brinto Bose, Sheikh Hasib Ahmed, Gias Uddin, M. S. Rahman","doi":"10.2139/ssrn.3914045","DOIUrl":"https://doi.org/10.2139/ssrn.3914045","url":null,"abstract":"In this paper, we aim to understand the topics discussed by bioinformatics practitioners in Stack Exchange sites. We downloaded all bioinformatics posts (questions and accepted answers) from four Stack Exchange Q&A sites (Stack Overflow, Biology, Cross-Validated, and Bioinformatics). Then we applied topic modeling on each site data. We labeled the topics and grouped those into high level categories. We analyzed the topics further by determining their popularity, difficulty, and evolution. We have made a comparative analysis of the topics across the different studied sites. We found 14 topics in Stack Overflow that are grouped into six categories. The number of new bioinformatics questions is steadily increasing over time in Stack Overflow for each topic category. Topics related to sequence analysis and pattern detection are the most popular as well as the most difficult to get an accepted answer. Most of the discussion posts are ‘how’ type questions, i.e., the practitioners were looking for solutions. While topics like biodata processing are found in multiple Stack Exchange sites, other topics (e.g., gene evolution analysis) are found in specialized sites (e.g., Biology). These findings show the need for consulting multiple related sites in Stack Exchange to learn interdisciplinary fields like bioinformatics. The tradeoff between popularity and difficulty of the bioinformatics topics highlights that bioinformatics practitioners need documentation and better tool support. The bioinformatics researchers, organizations, and practitioners can look into our results to prioritize the specific areas that need more focus for improvement.","PeriodicalId":13594,"journal":{"name":"Information Systems & Economics eJournal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87810649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Jayashree, M. Reza, C. Malarvizhi, M. Mohiuddin
Current industrialization has generated many challenges, including ecological hazards, climate change, and overuse of non-renewable natural resources creating an increasing demand for achieving the goal of Triple Bottom Line (TBL). In this regard, Industry 4.0 can contribute to the the production process that can help in achieving sustainable development. Using Dynamic Capability view (DCV), this paper explores the role of Industry 4.0 as firm-level Dynamic Capabilities (DC) to achieving the goals of the triple botton line. Employing simple random sampling, the study adopted a quantitative approach based on 199 useable respondent’s feedback collected through a survey of 900 employees from the Malaysian SMEs. The results exhibit that top management and IT infrastructure significantly impact Industry 4.0 implementation and sustainability. In contrast, the analysis also demonstrates that supply chain integration is insignificant to Industry 4.0 implementation in SMEs. The study findings also show that the relationship between the firm-level DC and TBL sustainability can be mediated by the “effective implementation” of Industry 4.0. The study highlights the practical consequences of the role and use of firm capabilities in Industry 4.0 implementation and findings to notify managers and policy-makers to optimize value creation to achieve the sustainable development goals.
{"title":"Industry 4.0 and Triple Bottom Line Sustainability - a Crunch Point for Malaysian SMEs","authors":"S. Jayashree, M. Reza, C. Malarvizhi, M. Mohiuddin","doi":"10.2139/ssrn.3877180","DOIUrl":"https://doi.org/10.2139/ssrn.3877180","url":null,"abstract":"Current industrialization has generated many challenges, including ecological hazards, climate change, and overuse of non-renewable natural resources creating an increasing demand for achieving the goal of Triple Bottom Line (TBL). In this regard, Industry 4.0 can contribute to the the production process that can help in achieving sustainable development. Using Dynamic Capability view (DCV), this paper explores the role of Industry 4.0 as firm-level Dynamic Capabilities (DC) to achieving the goals of the triple botton line. Employing simple random sampling, the study adopted a quantitative approach based on 199 useable respondent’s feedback collected through a survey of 900 employees from the Malaysian SMEs. The results exhibit that top management and IT infrastructure significantly impact Industry 4.0 implementation and sustainability. In contrast, the analysis also demonstrates that supply chain integration is insignificant to Industry 4.0 implementation in SMEs. The study findings also show that the relationship between the firm-level DC and TBL sustainability can be mediated by the “effective implementation” of Industry 4.0. The study highlights the practical consequences of the role and use of firm capabilities in Industry 4.0 implementation and findings to notify managers and policy-makers to optimize value creation to achieve the sustainable development goals.","PeriodicalId":13594,"journal":{"name":"Information Systems & Economics eJournal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82122320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：