The multi-population replicator dynamics is a dynamic approach to coevolving populations and multi-player games and is related to Cross learning. In general, not every equilibrium is a Nash equilibrium of the underlying game, and the convergence is not guaranteed. In particular, no interior equilibrium can be asymptotically stable in the multi-population replicator dynamics, e.g. resulting in cyclic orbits around a single interior Nash equilibrium. We introduce a new notion of equilibria of replicator dynamics, called mutation limits, based on a naturally arising, simple form of mutation, which is invariant under the specific choice of mutation parameters. We prove the existence of mutation limits for a large class of games, and consider a particularly interesting subclass called attracting mutation limits. Attracting mutation limits are approximated in every (mutation-)perturbed replicator dynamics, hence they offer an approximate dynamic solution to the underlying game even if the original dynamic is not convergent. Thus, mutation stabilizes the system in certain cases and makes attracting mutation limits near attainable. Hence, attracting mutation limits are relevant as a dynamic solution concept of games. We observe that they have some similarity to Q-learning in multi-agent reinforcement learning. Attracting mutation limits do not exist in all games, however, raising the question of their characterization.
9 October 2019 in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
We model a mobile population interacting over an underlying spatial structure using a Markov movement model. Interactions take the form of public goods games, and can feature an arbitrary group size. Individuals choose strategically to remain at their current location or to move to a neighbouring location, depending upon their exploration strategy and the current composition of their group. This builds upon previous work where the underlying structure was a complete graph (i.e. there was effectively no structure). Here, we consider alternative network structures and a wider variety of, mainly larger, populations. Previously, we had found when cooperation could evolve, depending upon the values of a range of population parameters. In our current work, we see that the complete graph considered before promotes stability, with populations of cooperators or defectors being relatively hard to replace. By contrast, the star graph promotes instability, and often neither type of population can resist replacement. We discuss potential reasons for this in terms of network topology.
This article contributes to the literature on representation by examining how the ideological polarisation of the electorate affects parties’ programmatic positions in multiparty systems. The main argument is that parties face incentives to adopt more extreme positions when the electorate becomes more ideologically polarised and the share of non-moderate voters is higher. The reason is that by adopting moderate positions parties will prompt their non-moderate core constituents to sit out the election. This risk is conditioned by voters’ propensity to abstain. A higher (lower) propensity to abstain means that parties alienate a larger (smaller) share of their core constituents when adopting a moderate position. Parties therefore respond to greater voter polarisation by adopting more extreme positions, but the effect declines as voters’ propensity to abstain decreases. An empirical analysis of parties’ programmatic positions in 11 Western European countries between 1977 and 2016 strongly supports this expectation.
Background: Accurately predicting difficult airways is essential to ensuring patient safety in anesthesiology and emergency medicine. However, traditional assessment tools often lack sufficient sensitivity and specificity, particularly in high-pressure or resource-limited settings. Artificial intelligence (AI) and machine learning (ML) have emerged as promising tools for enhancing airway assessment. Objective: This review evaluates the performance of AI- and ML-based models for predicting difficult airways and compares them with traditional clinical methods. The review also analyzes the models’ methodological robustness, clinical applicability, and ethical considerations. Methods: A comprehensive literature search was conducted across PubMed, Web of Science, and Scopus to identify studies published between 2020 and 2025 that employed AI/ML models to predict difficult airways. Both original research and review articles were included. Key metrics, such as the area under the curve (AUC), sensitivity, and specificity, were extracted and compared. A qualitative analysis was performed to focus on dataset characteristics, validation strategies, model interpretability, and clinical relevance. Results: AI models demonstrated superior performance compared to traditional assessment tools. The MixMatch semi-supervised deep learning (DL) model achieved the highest performance (area under the curve [AUC] of 0.9435, sensitivity of 89.58%, and specificity of 90.13%). Models that used facial imaging combined with deep learning consistently outperformed those that relied solely on clinical parameters. However, methodological heterogeneity, a lack of standardized evaluation metrics, and limited population diversity impeded cross-study comparability. Few studies incorporated interpretability frameworks or addressed ethical challenges related to data privacy and algorithmic bias. Conclusions: AI and ML models have the potential to transform the assessment of difficult airways by improving diagnostic accuracy and enabling real-time clinical decision support.
This book presents a summary of the application and instrumentation of cell electrophoresis. The method of making cell purification and characterization possible according to the cellular negative surface charge density is discussed, and ideas for future developments are explained. The negative electrostatic forces at cell surfaces provide information about cell-cell interaction, blood vessel sealing, cytokine actions, cell transformation, ion transport phenomena, and other biological phenomena. Recalculations of the physical principles of cell electrophoresis reveal possibilities for removing disruptive factors caused by electrical current, heat, and sedimentation. The introduction of computer technology, the performance of simultaneous two-parameter measurements, and the application of cell-friendly but current-inert buffer systems render the method more reliable and efficient.
The multi-population replicator dynamics (RD) can be considered a dynamic approach to the study of multi-player games, where it was shown to be related to Cross' learning, as well as of systems of coevolving populations. However, not all of its equilibria are Nash equilibria (NE) of the underlying game, and neither convergence to an NE nor convergence in general are guaranteed. Although interior equilibria are guaranteed to be NE, no interior equilibrium can be asymptotically stable in the multi-population RD, resulting, e.g., in cyclic orbits around a single interior NE. We introduce a new notion of equilibria of RD, called mutation limits, which is based on the inclusion of a naturally arising, simple form of mutation, but is invariant under the specific choice of mutation parameters. We prove the existence of such mutation limits for a large range of games, and consider a subclass of particular interest, that of attracting mutation limits. Attracting mutation limits are approximated by asymptotically stable equilibria of the (mutation-)perturbed RD, and hence, offer an approximate dynamic solution of the underlying game, especially if the original dynamic has no asymptotically stable equilibria. In this sense, mutation stabilises the system in certain cases and makes attracting mutation limits near-attainable. Furthermore, the relevance of attracting mutation limits as a game theoretic equilibrium concept is emphasised by a similarity of (mutation-)perturbed RD to the Q-learning algorithm in the context of multi-agent reinforcement learning. In contrast to the guaranteed existence of mutation limits, attracting mutation limits do not exist in all games, raising the question of their characterization.