The role of network embeddedness across multiple social networks: Evidence from mobile social network games

This article examines peer influences from network relationships within a social network game (i.e., embeddedness) and across such games (i.e., multiplexity). Drawing on social influence theory, we develop a bivariate Poisson model of users’ repeated visits and latent attrition that accommodates peer interaction after controlling for homophily. We estimate the model using data from two social network games with considerable overlap among network members. We find that friends who are only multiplex across games exert greater peer influence on users’ game visits than members who are embedded within a single game. We also determined that ignoring network multiplexity across games may lead firms to mistarget users due to biased peer influences of embedded friends. This result provides an unresearched explanation—strength of peer influence—for the mixed findings in previous literature on network embeddedness. We utilized our results to conduct several scenario analyses to demonstrate how firms can effectively manage users’ engagement and target users in multiple social network games.     

Complex Network of Aviation E-Services in the Belt and Road Initiative: A Heuristic Study of Small Data based on Block Modeling

ABSTRACT

The aviation e-service system is an important part of support for business communication in regions covered by Belt and Road initiative. In exploring the role of airline companies in this system, we examine the structure of the network, which consists of airlines interconnections based on small data of individual attributes of aviation companies in aviation e-services, and study these interconnections across different groups using block modeling. The heuristic solution of airline companies in development of international communication and cooperation is further discussed. Among our policy implications for global managers, we suggest the enhancement of cross-regional cooperation among airlines.     

Exploring job crafting: Diagnosing and responding to the ways employees adjust their jobs

Recent research has developed an in-depth understanding of how workers change their jobs on their own to improve their performance and well-being, a process called job crafting. This research suggests that managers, coworkers, and organizations need a better understanding of how to manage job crafting to capitalize on its benefits and reduce costs. This article will help organizations diagnose the occurrence of job crafting, recognize the differences between goal-oriented approaches to job crafting as opposed to withdrawal-oriented avoidance job crafting, and identify the seven specific types of job crafting: work role expansion, social expansion, work role reduction, work organization, adoption, metacognition, and withdrawal. We conclude with recommendations for managers, coworkers, and organizations on how to diagnose and manage job crafting.     

Trade networks and economic fluctuations in Asian countries

The paper presents a new methodology, based on tensor decomposition, to map dynamic trade networks and to assess its strength in forecasting economic fluctuations at different periods of time in Asia. Using the monthly merchandise import and export data across 33 Asian economies, together with the US, EU and UK, we detect the community structure of the evolving network and we identify clusters and central nodes inside each of them. Our findings show that data are well represented by two communities, in which People's Republic of China and Japan play the major role. We then analyze the synchronisation between GDP growth and trade. Furthermore we apply our model to the prediction of economic fluctuations. Our findings show that the model leads to an increase in predictive accuracy, as higher order interactions between countries are taken into account.     

Why principals tolerate biases of inaccurate agents

Some agents are more accurate than others in estimating the best policy. The more accurately an agent estimates a policy's effects, the more he will resist biases, such as bribes from a special interest. Thus, a special interest needs to pay a larger bribe to an accurate agent than to an inaccurate agent. The accurate agent who is biased will then more likely cause harm than does an inaccurate agent who favors the special interest. Therefore, the principal may gain more from controlling biases of an accurate agent than of an inaccurate one. Thus, high ability of public officials may be associated with little corruption.     

Some issues in blockchain for accounting and the supply chain,with an application of distributed databases to virtual organizations

This paper reviews some recent blockchain‐based applications for information capture, distribution and preservation. As part of that review, this paper examines two key concerns with current blockchain designs for accounting and supply chain transactions: data independence and multiple semantic models for the same information distribution problem. Blockchain applications typically integrate database, application and presentation tiers all in the same ledger. This results in a general inability to query information in the ledger and other concerns. Further, since most applications appear to be private blockchain applications, there is a concern of agents needing to accommodate multiple blockchains depending on who their trading partners are and what they request. Finally, this paper uses a distributed database to design a ‘blockchain‐like’ system for virtual organizations.     

基于AD9361的掌上型LTE RRU设计与开发

当前小体积远端射频单元（Remote Radio Unit,RRU）主要是皮站级别的Pico-RRU，其重量和体积仍然难以满足掌上型的要求。为此，采用高集成度的AD9361芯片来实现长期演进（Long Term Evolution，LTE）宽带收发信机功能，配合时钟同步模块、放大器模块和控制接口电路等一起构建低成本的掌上型RRU。主要解决了基于AD9516的时钟同步、低相位噪声设计和高灵敏度接收机设计三个技术难点，成功实现了掌上型、高性能、低成本的设计目标。整个RRU样机尺寸为18 cm×10 cm×2 cm，质量约500 g，量产成本千元以内。测试表明，该RRU下行误差向量幅度（Error Vector Magnitude，EVM）小于3%，优于3GPP要求的8%；10 MHz带宽时上行接收机灵敏度优于3GPP要求的-93.5 dBm。     

Periodic strategies in optimal execution with multiplicative price impact

We study the optimal execution problem with multiplicative price impact in algorithmic trading, when an agent holds an initial position of shares of a financial asset. The interselling decision times are modeled by the arrival times of a Poisson process. The criterion to be optimized consists in maximizing the expected net present value of the gains of the agent, and it is proved that an optimal strategy has a barrier form, depending only on the number of shares left and the level of the asset price.