The digital divide between large enterprises and SMEs (Small and Medium-sized Enterprises) within industrial clusters poses a significant challenge to achieving collective digital transformation, exacerbated by the quasi-public goods, attributes of digital inclusion ecosystems, and the prevalence of free-riding behavior. This paper investigates whether platform enterprises, as core actors occupying structural holes in cluster networks, can foster the co-construction of a digitally inclusive ecosystem. We developed a complex network public goods game model, incorporating performance feedback into a modified Fermi learning to capture firms’ adaptive decision-making based on historical and social aspirations. The model simulates strategic interactions on both small-world and scale-free networks, characteristic of industrial clusters. Numerical simulations reveal that: (1) The core driver of co-construction is the investment return coefficient; (2) Performance feedback amplifies individual rationality, accelerating the formation or collapse of cooperation depending on the investment return coefficient; (3) Platform empowerment—specifically, selectively connecting and incentivizing cooperative firms—effectively promotes ecosystem co-construction, with this strategy proving most impactful when investment returns are moderate. Furthermore, while this selective empowerment strategy benefits the cluster overall, its effect on the platform’s own revenue is network-dependent, showing a more pronounced decline in small-world structures. This study provides a novel analytical framework for understanding strategic interactions in digital inclusion and offers practical insights for policymakers and platform leaders in orchestrating collaborative digital transformation.

We propose a one-shot, non-cooperative mechanism that implements the core in a large class of public goods games. Players simultaneously choose conditional commitment functions, which are binding unilateral commitments that condition a player’s contribution on the contributions of others. We prove that the set of strong Nash equilibrium outcomes of this mechanism coincides exactly with the core of the underlying cooperative game. We further show that these core outcomes can be found via simple individual learning dynamics.

This paper examines stochastic cooperation in markets with two sellers who exhibit one-sided dependency. The independent seller’s pricing influences the dependent seller’s demand, but not vice versa. We study the one-dimensional hybrid game class whose parameter is the exogenously given probability of cooperation. In each game of this class, both sellers simultaneously choose prices that determine their endogenous threats, i.e., conflict profits. The sellers are aware of the cooperation probability but cannot condition prices on whether or not there is cooperation. We characterize the equilibrium prices and the sellers’ expected profits. Our main result shows that the independent seller earns higher expected profits when cooperation is more likely. In contrast, the dependent seller earns lower expected profits when the likelihood of cooperation is below a threshold that we characterize explicitly, and higher profits are earned thereafter. These findings suggest that, within our framework, antitrust concerns may be mitigated. Since dependent sellers can incur losses from cooperation, collusion attempts become less viable in markets with one-sided dependency.

We investigate power indices for simple games with precoalitions which distribute power among players in an external and an internal step. We extend an existing approach which uses the Public Good index both on the external level in the quotient game as well as on the internal level for measuring the leverage of players to threaten their peers through departing the precoalition. We replace the Public Good index in that model by five other efficient power indices, i.e., the Shapley–Shubik index, the Deegan–Packel index, the Johnston index and two indices based on null player free winning coalitions. Axiomatizations of the novel power indices with threat partitions are presented. We also propose a slight modification to the existing framework for threat power indices which guarantees that null players are always assigned zero power. Numerical results for all power indices combined with different threat partitions are presented and discussed.

In this paper, we investigate the classical Axelrod model of cultural dissemination under an adaptive network framework. Unlike the original model, we place agents on a complex network, where they cut connections with any agent that does not share at least one cultural trait. This rewiring process alters the network topology, and key parameters—such as the number of traits, the neighborhood search range, and the degree-based preferential attachment exponent—also influence the distribution of cultural traits. Unlike conventional Axelrod models, our approach introduces a dynamic network structure where the rewiring mechanism allows agents to actively modify their social connections based on cultural similarity. This adaptation leads to network fragmentation or consolidation depending on the interaction among model parameters, offering a framework to study cultural homogeneity and diversity. The results show that, while long-range reconnections can promote more homogeneous clusters in certain conditions, variations in the local search radius and preferential attachment can lead to rich and sometimes counterintuitive dynamics. Extensive simulations demonstrate that this adaptive mechanism can either increase or decrease cultural diversity, depending on the interplay of network structure and cultural dissemination parameters. These findings have practical implications for understanding opinion dynamics and cultural polarization in social networks, particularly in digital environments where rewiring mechanisms are analogous to recommendation systems or user-driven connection adjustments.

A simple hypergraph H with vertex set X and edge set E is representable by Von Neumann–Morgenstern (VNM)-stable sets—or VNM—if there exists an irreflexive simple digraph D with vertex set X such that each edge of H is a VNM-stable set of D. It is shown that a simple hypergraph H is VNM if and only if each edge of H is a maximal clique of the conjugation graph of H. A related algorithm that identifies finite VNM hypergraphs is also provided.

We present a simple model where, before competing in prices, firms announce which prices they intend to choose. Deviating from these announcements involves a cost. We show that sharing pricing intentions results in prices being set above their competitive levels. All equilibria result in prices that are higher than in the absence of announcements. When the deviation cost of not sticking to the price announcement is high, the unique equilibrium market outcome is asymmetric, as with price leadership. When this cost is low, a symmetric equilibrium exists with even higher prices. Product differentiation is a key ingredient to these results.

Recent work by Kleshnina et al. has presented a Stackelberg evolutionary game model in which the Stackelberg equilibrium strategy for the leading player corresponds to the optimal cancer treatment. We present an approach that is able to quickly and accurately solve the model presented in that work.

We start from the fundamental premise that any physical interaction can be interpreted as a game. To demonstrate this, we draw upon the free energy principle and the theory of quantum reference frames. In this way, we place the game-theoretic Nash Equilibrium in a new light in so far as the incompleteness and undecidability of the concept, as well as the nature of strategies in general, can be seen as the consequences of certain no-go theorems. We show that games of the generic imitation type follow a circularity of idealization that includes the good regulator theorem, generalized synchrony, and undecidability of the Turing test. We discuss Bayesian games in the light of Bell non-locality and establish the basics of quantum games, which we relate to local operations and classical communication protocols. In this light, we also review the rationality of gaming strategies from the players’ point of view.