Transportation is a crucial component of supply chain management, responsible for delivering goods and services to customers. This paper explores the application of game theory concepts, precisely the Shapley value, to cost allocation in transportation operations involving drones and trucks. Our focus is on shortest-path games in which agents own nodes in a network and seek to transport items between nodes at the lowest possible cost. We provide a comprehensive literature review of the Shapley value and its use in shortest-path games, with particular emphasis on transportation networks. Our proposed model includes sets of customers, drones, and trucks and uses binary decision variables to indicate whether a drone or truck serves a given customer. The objective is to minimize the total cost of serving all customers while adhering to capacity and synchronization constraints. We use the Shapley value to determine the contribution and cost-sharing of each drone and truck in serving the customers. Through a combination of denitions, theorems, and examples, we explore the formal meaning of the Shapley value and its relationship to shortest-path games in transportation networks. We highlight exceptional cases and considerations that must be taken into account when applying the Shapley value in such scenarios.

The hybrid in-band on-channel (IBOC) transmission system as a digital audio radio scheme could transmit analog FM and digital audio simultaneously. In IBOC systems, broadcasters transmit signals within the allocated channel bands, so the bandwidth allocated for digital audio transmission is a big challenge. In view of the above, the use of cooperative game theory, supported by the use of the bankruptcy game and Shapley's value, is proposed as a strategy to optimize the bandwidth allocation at each node or station, according to the demand in the service, the number of stations and the radio channel conditions in the FM band. The paper proposes a scenario under saturated traffic conditions, in order to evaluate the degree of optimization that the Shapley value can perform under clearly established traffic and channel conditions. The evaluation process yielded a quite favorable result, where it is observed that the use of cooperative game theory supported by the Shapley value can be considered as an excellent alternative when performing bandwidth optimization processes for digital broadcasting over IBOC in FM and with the possibility of being implemented in other digital radio broadcasting systems.

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and Shapley-Shubik indices for weighted voting games we present a framework for fast algorithms for the three most common power indices with precoalitions, i.e. the Owen index, the Banzhaf-Owen index and the Symmetric Coalitional Banzhaf index, and point out why our new algorithms are applicable for large numbers of players. We discuss implementations of our algorithms for the three power indices with precoalitions in C++ and review computing times as well as storage requirements.

Attackers are perpetually modifying their tactics to avoid detection and frequently leverage legitimate credentials with trusted tools already deployed in a network environment, making it difficult for organizations to proactively identify critical security risks. Network traffic analysis products have emerged in response to attackers’ relentless innovation, offering organizations a realistic path forward for combatting creative attackers. Additionally, thanks to the widespread adoption of cloud computing, Device Operators (DevOps) processes, and the Internet of Things (IoT), maintaining effective network visibility has become a highly complex and overwhelming process. What makes network traffic analysis technology particularly meaningful is its ability to combine its core capabilities to deliver malicious intent detection. In this paper, we propose a novel darknet traffic analysis and network management framework to real-time automating the malicious intent detection process, using a weight agnostic neural networks architecture. It is an effective and accurate computational intelligent forensics tool for network traffic analysis, the demystification of malware traffic, and encrypted traffic identification in real-time. Based on Weight Agnostic Neural Networks (WANNs) methodology, we propose an automated searching neural net architectures strategy that can perform various tasks such as identify zero-day attacks. By automating the malicious intent detection process from the darknet, the advanced proposed solution is reducing the skills and effort barrier that prevents many organizations from effectively protecting their most critical assets.

COVID-19 vaccine hesitancy is considered responsible for the lower rate of acceptance of vaccines in many parts of the world. However, sources of this hesitancy are rooted in many social, political, and economic factors. This paper strives to find the most important variables in predicting the COVID-19 vaccination uptake. We introduce an explainable machine learning (ML) framework to understand the COVID-19 vaccination uptake around the world. To predict vaccination uptake, we have trained a random forest (RF) regression model using a number of sociodemographic and socioeconomic data. The traditional decision tree (DT) regression model is also implemented as the baseline model. We found that the RF model performed better than the DT model since RF is more robust to handle nonlinearity and multi-collinearity. Also, we have presented feature importance based on impurity measure, permutation, and Shapley values to provide the most significant unbiased features. It is found that electrification coverage and Gross Domestic Product are the strongest predictors for higher vaccination uptake, whereas the Fragile state index (FI) contributed to lower vaccination uptake. These findings suggest addressing issues that are found responsible for lower vaccination uptake to combat any future public health crisis.

We derive a concentration inequality for the uncertainty in the mean computed by stratified random sampling, and provide an online sampling method based on this inequality. Our concentration inequality is versatile and considers a range of factors including: the data ranges, weights, sizes of the strata, the number of samples taken, the estimated sample variances, and whether strata are sampled with or without replacement. Sequentially choosing samples to minimize this inequality leads to a online method for choosing samples from a stratified population. We evaluate and compare the effectiveness of our method against others for synthetic data sets, and also in approximating the Shapley value of cooperative games. Results show that our method is competitive with the performance of Neyman sampling with perfect variance information, even without having prior information on strata variances. We also provide a multidimensional extension of our inequality and discuss future applications.