Linear Programming for Computing Equilibria Under Truncation Selection and Designing Defensive Strategies Against Malicious Opponents

Abstract

Linear programming and polyhedral representation conversion methods have been widely applied to game theory to compute equilibria. Here, we introduce new applications of these methods to two game-theoretic scenarios in which players aim to secure sufficiently large payoffs rather than maximum payoffs. The first scenario concerns truncation selection, a variant of the replicator equation in evolutionary game theory where players with fitnesses above a threshold survive and reproduce while the remainder are culled. We use linear programming to find the sets of equilibria of this dynamical system and show how they change as the threshold varies. The second scenario considers opponents who are not fully rational but display partial malice: they require a minimum guaranteed payoff before acting to minimize their opponent’s payoff. For such cases, we show how generalized maximin procedures can be computed with linear programming to yield improved defensive strategies against such players beyond the classical maximin approach. For both scenarios, we provide detailed computational procedures and illustrate the results with numerical examples.

1. Introduction

Game theory plays an important role in mathematically modeling the behavior and decision-making of players whether, or not they are human (Myerson, 1991). This feature allows the theory to have applications in fields such as social sciences, economics, biology, and computer science. In particular, many studies have focused on two-player games, which are an essential foundation of many models of interactions between individuals. As the size of players’ strategy sets increases, however, analyzing (say, finding the Nash equilibria) the multi-variable polynomial payoff expressions becomes computationally complex (Etessami & Yannakakis, 2010; Papadimitriou, 2007). In such situations, support enumeration is a standard approach to finding Nash equilibria (Dickhaut & Kaplan, 1993; Porter et al., 2008; Von Stengel, 2021). Linear programming can be used as an auxiliary tool for support enumeration and has been well applied to game theory (Lucchetti, 2006; Parrilo, 2006; Thie & Keough, 2011), often to compute minimax/maximin strategies, Nash equilibria, correlated equilibria, and related solution concepts. In this study, we convert problems into linear programs (or, more fundamentally, polyhedral conversion problems) and apply them to two additional scenarios: truncation selection and opponents that show a degree of irrationality or malice. We focus on these two scenarios because they both require consideration of worst-case scenarios, and they can be naturally expressed in linear algebraic language and converted to linear programs.

Before addressing irrational or malicious opponents, we begin with a discussion of rationality. In classical game theory, particularly for finite normal-form games, stable outcomes of games are predicted by Nash equilibria (Nash, 1950) (and its variants), which rely on at least two assumptions: that payoff matrices accurately and quantitatively reflect what matters to each player, and that all players aim to maximize their payoffs. In practice, however, players cannot always assume that their opponents are rational and must instead make decisions based on payoffs for all possible scenarios. For example, players may encounter opponents that are satisficers (Simon, 1955), irrational (Htun, 2005), unfamiliar with the game (Burton-Chellew et al., 2016), prone to making errors (Selten & Bielefeld, 1988), or malicious (Moscibroda et al., 2009). Another typical reason for the assumption of rationality to fail is that, in practice, payoff matrices usually only reflect the material payoffs of players, failing to capture players’ complicated underlying emotions. In the case of maliciousness, players may attempt to decrease their opponent’s payoff on purpose rather than maximize their own payoff. Such behavior can be explained by social norms that promote costly punishment (Henrich et al., 2006), a component of relational utility in a player’s payoffs (Su & Morsky, 2024), or the game being a sub-game of a larger game where opponents’ payoffs negatively affect one another. Players may also encounter games with incomplete information, such as Bayesian games (Harsanyi, 1968), where analyzing an opponent’s behavior with certainty is impossible. In controlling industrial scenarios, we may only seek satisfactory outcomes rather than optimal ones, especially if the optimization is difficult. In such situations, players may wish to guarantee themselves a minimum payoff (Bruyere et al., 2014)—i.e., control for worst-case scenarios (Dave & Malikopoulos, 2024).

Risk-averse or security strategies to handle such scenarios have been well studied (Binmore, 1992; Holler, 1990, 1992; Holler & Høst, 2019). A classic example is the maximin strategy, where a player assumes the worst-case scenario will happen and chooses a strategy that maximizes their payoff under that assumption. However, players may seek a balance between securing a lower-bound payoff and exploiting an opponent’s partial rationality. A safe equilibrium formalizes this trade-off by each player assigning probabilities over maximin and Nash equilibrium strategies (Ganzfried, 2023). When a player is willing to accept a worst-case payoff below the maximin value, they can respond more flexibly to educated beliefs about opponents’ behaviors. This flexibility may lead to higher payoffs, particularly when combined with methods in behavioral game theory (Fudenberg & Liang, 2019; Wright & Leyton-Brown, 2014). In this paper, we design a model to capture the behavior of partially malicious players: players who aim to increase their payoffs when they are low but become malicious once they exceed a certain payoff threshold. While a fully malicious player reduces the problem to a classic zero-sum game, our framework generalizes this case to opponents exhibiting partial malice. We demonstrate how a rational player can enhance their payoff from the maximin payoff if the opponent follows such a decision rule, and how such players would compute their ideal strategies. We analyze strategies for both rational players facing partially malicious opponents and malicious players seeking to minimize their opponents’ payoffs under this decision rule.

The population-level dynamics of avoiding worst-case outcomes can be modeled by truncation selection, an evolutionary algorithm in which only players with fitnesses (i.e., average payoffs) above a specified threshold survive and reproduce (Ficici, 2006; Ficici et al., 2005; Ficici & Pollack, 2000, 2007; D. B. Fogel et al., 1997; G. B. Fogel et al., 1998; G. B. Fogel & Fogel, 2011; Jebari & Madiafi, 2013; Morsky & Bauch, 2016, 2019). Thresholds may be fixed or dynamic and can depend on variables such as time, which is relevant for reproduction timing (Morsky et al., 2020). Truncation selection emphasizes adequacy: as long as a player’s fitness exceeds the threshold, they propagate at an equal rate. This approach has applications in computer science and mathematical biology, including genetic algorithms (Jebari & Madiafi, 2013) and as an alternative to the replicator equation (Morsky & Bauch, 2016). Truncation selection can exhibit markedly different dynamics than the replicator equation (D. B. Fogel et al., 1997), where population change depends on deviations from the average fitness (Cressman & Tao, 2014). Truncation selection can be classified into two different methods: independent truncation selection, where the threshold is a fixed value; and dependent truncation selection, where a fixed proportion of the population survives, making the threshold contingent upon the population’s fitness distribution (Morsky & Bauch, 2016, 2019). In this paper, we emphasize the role of linear programming and the concept of safe strategies in analyzing independent truncation, since the threshold condition can be naturally expressed by linear program constraints. In reformulating independent truncation selection as linear programs and polyhedral conversion problems, we offer a computationally efficient and analytically transparent framework for studying it.

2. Results

2.1. Games with Malicious Players

We begin with a scenario where the column player is rational and the row player is partially malicious, given a specified risk aversion threshold ${\theta }_{\mathrm{row}}\in (0,1)$. The definitions of the matrices can be found in Section 4. Knowing that her opponent is malicious, it would be intuitive for the column player to adopt a maximin strategy as a defensive measure. However, due to the minimum payoff requirement, the row player’s strategy space may be restricted. So, even if the column player exposes herself to risk by playing a strategy not in the set of maximin strategies, the row player might be unable to fully exploit the worst case. Since the column player can threaten the loss of his minimum requirement. This creates the potential for the column player to secure a payoff at least as high as the maximin value through a computation method that leverages the row player’s restricted strategy space.

To begin the analysis, consider the row player’s strategy space as a convex hull of probability vectors. The vertices of this space can be obtained by solving a polyhedral representation conversion problem (see Appendix B for a review):

$$\begin{array}{cc}\hfill & \mathrm{convert}\mathrm{from}\mathrm{H}-\mathrm{to}\mathrm{V}-\mathrm{representation}:\hfill \\ \hfill & 1={\mathbf{1}}^T\mathit{x}\hfill \\ \hfill & \mathbf{0}\le \mathit{I}\mathit{x}\hfill \\ \hfill & \varphi \mathbf{1}\le \mathit{A}\mathit{x}\hfill \end{array}$$

(1)

This polyhedral conversion problem yields the vertices of the restricted strategy space for the malicious player. Let these resulting vertices (strategies) be ${\mathit{p}}_0,{\mathit{p}}_1,\dots ,{\mathit{p}}_k$. By the fundamental idea of linear programming, one of these strategies yields the worst payoff the row player can make the column player accept. Therefore, the column player’s payoff is ${\pi }_{\mathrm{col}}=min({\mathit{p}}_0^T\mathit{B}\mathit{q},{\mathit{p}}_1^T\mathit{B}\mathit{q},\dots ,{\mathit{p}}_k^T\mathit{B}\mathit{q})$ with $\mathit{q}$ denoting her strategy.

Selecting the column player’s optimal strategy in this scenario is equivalent to solving a generalized maximin problem. To see this, define ${\mathit{P}}_{\varphi }=[{\mathit{p}}_0,{\mathit{p}}_1,\dots ,{\mathit{p}}_k]$. Then, the following maximin problem is equivalent to maximizing $v_{\mathrm{col}}$:

$$\begin{array}{cc}\mathrm{maximize}:& v_{\mathrm{col}}\hfill \\ \mathrm{subject}\mathrm{to}:& {\mathit{P}}_{\varphi }^T\mathit{B}\mathit{q}\ge v_{\mathrm{col}}\mathbf{1}\mathrm{and}{\mathbf{1}}^T\mathit{q}=1,\\ \hfill & \mathit{q}\ge 0.\hfill \end{array}$$

(2)

Each entry of ${\mathit{P}}_{\varphi }^T\mathit{B}\mathit{q}$ is the column player’s payoff against a row player’s vertex strategy. By maximizing the minimum value, we obtain a defensive strategy robust against the row player’s restricted strategy set. One can see that this linear program as a generalization of maximin problems, where our opponent’s mixed strategies are limited in the convex hull of columns of the ${\mathit{P}}_{\varphi }$ matrix. When the row player is unrestricted in his strategy, $\mathit{P}$ reduces to the identity matrix (since all pure strategies are available), and this problem recovers the maximin strategy. Depending on how severely the row player’s strategy space is restricted by his minimum requirement, this optimization may or may not yield a different strategy for the column player, but her payoff will always be at least as high as the classical maximin value.

We end the analysis by giving a numerical example for the game:

$$G=(\mathit{A},\mathit{B})=\left[\begin{array}{ccc}(-62,13)& (44,-33)& (62,-63)\\ (-42,-76)& (4,-90)& (62,34)\\ (24,-30)& (-77,-63)& (-68,-39)\\ (28,85)& (80,-33)& (53,-24)\end{array}\right],$$

(3)

where the row player is partially malicious with a risk aversion threshold of $0.22$ (and thus his minimum requirement is approximately $-53.89$), and the column player is rational. A maximin strategy for the column player is ${[0.61,0,0.39]}^T$ and the corresponding worst-case payoff is $-33.48$. However, since the row player’s strategy set is restricted, the generalized maximin procedure yields an enhanced column strategy $\mathit{q}\approx {[0.54,0,0.46]}^T$ and the worst payoff the opponent can enforce is ${\pi }_{\mathrm{col}}\approx -31.73$.

Now consider how the row player computes his strategy. When he plays strategy $\mathit{p}$, the possible payoffs available to the column player are ${\mathit{B}}^T\mathit{p}$. Since the column player is rational, she will choose her best response to these, so his goal is to minimize her best possible payoff while satisfying his own minimum payoff constraint, which can be represented by the following optimization problem:

$$\begin{array}{cc}\mathrm{minimize}:& v_{\mathrm{col}}\hfill \\ \mathrm{subject}\mathrm{to}:& {\mathit{B}}^T\mathit{p}\le v_{\mathrm{col}}\mathbf{1},\mathrm{and}{\mathit{A}}^T\mathit{p}\ge {\varphi }_{\mathrm{row}}\mathbf{1},\mathrm{and}{\mathbf{1}}^T\mathit{p}=1,\\ \hfill & \mathit{p}\ge 0.\hfill \end{array}$$

(4)

This is a generalized minimax problem, which extends the standard formulation with additional constraints from the minimum payoff requirement. Solving this program yields a strategy that simultaneously satisfies this constraint and minimizes the column player’s best response payoff. This upper bound is theoretically the same value as the rational player’s enhanced payoff derived earlier, agreeing with the famous minimax theorem (Simons, 1995). For the row player in the example game above, a generalized minimax strategy is approximately ${[0.10,0.13,0.77,0]}^T$, and the corresponding best possible payoff for the column player under this strategy is again $-31.73$, which is in agreement with the minimax theorem.

2.2. Independent Truncation Selection

We begin by analyzing results of an agent-based numerical simulation of a Hawk-Dove game, using a similar but simplified setup as D. B. Fogel et al. (1997); G. B. Fogel et al. (1998); Morsky and Bauch (2016). Assuming a large number of competitions between players, we use expected payoffs instead of stochastic ones, which are the fitnesses; implications of this modeling choice are discussed in more depth in Appendix C. Payoffs for the two types of players, hawks and doves, are determined by the row payoff matrix taken from Morsky and Bauch (2016):

$$\mathit{A}=\left[\begin{array}{cc}-25& 45\\ 5& 15\end{array}\right]$$

(5)

with the first strategy representing hawks and the second doves. Figure 1 shows the equilibrium frequency of hawks as a function of $\varphi$. Consider the shape of the distribution of data samples. The upper bounds of the data have two distinct linear boundaries separated by a turning point. To explain this observation, consider the payoff matrix shifted by the payoff threshold: ${\mathit{A}}^{\prime }=[a_{ij}-\varphi ]$. If a population state $\mathit{x}$ satisfies ${\mathit{A}}^{\prime }\mathit{x}\ge \mathbf{0}$, then both hawks and doves will have payoffs above $\varphi$. This is connected to computing the column maximin value of $\mathit{A}$, which is 15. Thus, for all $\varphi >15$, there exists no state $\mathit{x}$ such that hawks and doves both have fitnesses above $\varphi$. Conversely, for $\varphi <-25$, the fitnesses of both hawks and doves will be greater than $\varphi$ for every state $\mathit{x}$.

Although extending the horizontal axis of Figure 1 beyond $[-25,15]$ is unnecessary for this model, it can be necessary when there is significant variance in payoffs, as in the models of D. B. Fogel et al. (1997); G. B. Fogel et al. (1998); Morsky and Bauch (2016). Because outliers are possible, and thus the boundary is different. For $\varphi <-25$, culling and extinction are rare, but not impossible for stochastic payoffs. For $\varphi >15$, primarily populations with states equal to a column maximin strategy (which is exactly ${\mathit{e}}_2$ in this case) can avoid extinction. Increasing $\varphi$ shrinks this range linearly into a single point. The turning point is when $det\left({\mathit{A}}^{\prime }\right)=0$, which is at the threshold $\varphi =10$. We care about the determinant because it would be possible for non-trivial states to exist, making the fitnesses of all players meet the threshold. For $\varphi <10$, we can explain the linear boundary by computing the range of safe spaces where we expect no extinctions. This is relatively easy for $2\times 2$ games, because the set of safe spaces is a subset of the probability hyperplane with dimension 2 (a line segment). The comparison to the original result in Morsky and Bauch (2016) is included in Appendix C where we show that the difference between our result and theirs is due to low population sizes and stochastic payoffs with non-negligible variances. As the population size increases, their results converge to ours.

We can obtain the convex hull of vertices by finding the two extreme points of the line segment using the following linear program (note that for higher dimensions, this must be converted to a polyhedral representation conversion problem):

$$\begin{array}{cc}\mathrm{minimize}:& {\mathit{e}}_1^T\mathit{x}\hfill \\ \mathrm{subject}\mathrm{to}:& {\mathit{A}}^{\prime }\mathit{x}\ge 0\mathrm{and}{\mathbf{1}}^T\mathit{x}=1,\\ \hfill & \mathit{x}\ge 0.\hfill \end{array}$$

(6)

The linear objective function is just a vector in the standard basis of ${\mathbb{R}}^2$, meaning that we are minimizing an entry in $\mathit{x}$. Doing this for both entries allows us to obtain the convex hull. When $\varphi <10$, the extreme states tell us that hawks become extinct before (since the first row of ${\mathit{A}}^{\prime }\mathit{x}$ is zero). When $\varphi >10$, doves go extinct before hawks for a similar reason (the second row of ${\mathit{A}}^{\prime }\mathit{x}$ is zero). The two slopes in Figure 1 are given by the following two relations:

$$\left(\left[\begin{array}{cc}-25& 45\\ 5& 15\end{array}\right]-\varphi \left[\begin{array}{cc}1& 1\\ 1& 1\end{array}\right]\right)\left[\begin{array}{c}{x}_1\\ x_2\end{array}\right]=\{\begin{array}{c}\hfill \left[\begin{array}{c}0\\ {\pi }_2\end{array}\right],\mathrm{if}\varphi <10,\\ \hfill \left[\begin{array}{c}{\pi }_1\\ 0\end{array}\right],\mathrm{if}\varphi >10,\end{array}$$

(7)

where the unspecified fitnesses (denoted by ${\pi }_1$ and ${\pi }_2$ for hawks and doves, respectively) are non-negative. Solving these equations yields the slopes of the two upper boundaries: $-1/70$ and $-1/10$.

By the above arguments, we conclude that no culling occurs for $\varphi$ below the minimum possible payoff, and only rare players survive for $\varphi$ above the column maximin value. This analysis provides a direct way to compute a naive safe space, assuming full support (about which we will elaborate below).

For higher-dimensional games, the computation of safe spaces is more complex. It is possible that a player type goes extinct, irreversibly reducing the game to a lower-dimensional sub-game for which there may be a different safe space. We adopt the game-theoretic notion of a strategy being in the support to express the surviving strategies in such a scenario. Then, given a specified threshold payoff, we compute safe spaces for all possible supports and take the union to find the set of all safe strategies.

To see this procedure, consider a $3\times 3$ game with the following payoff matrix:

$$\mathit{A}=\left[\begin{array}{ccc}64& -58& 50\\ -34& 51& -66\\ 75& -1& 11\end{array}\right].$$

(8)

This game has the pure Nash equilibria $({\mathit{e}}_1,{\mathit{e}}_3)$, $({\mathit{e}}_3,{\mathit{e}}_1)$, and $({\mathit{e}}_2,{\mathit{e}}_2)$, and the mixed Nash equilibria $({\mathit{p}}_1,{\mathit{q}}_1)$ and $({\mathit{p}}_2,{\mathit{q}}_2)$ where ${\mathit{p}}_1={\mathit{q}}_1={[0,77/129,52/129]}^T$ and ${\mathit{p}}_2={\mathit{q}}_2={[39/50,0,11/50]}^T$. And it has the maximin value of approximately $6.24$. The numerical results for the safe spaces of this game are generated by the following procedure and plotted in Figure 2 and Figure 3, where the first plot is the safe space only considering the full support, and the second plot is the safe space where all supports are considered. Since the vertices of the safe spaces are three-dimensional probability vectors, there are only two degrees of freedom. Thus, we only need to choose two components to record and the remaining axis to record the thresholds. In our plot, the x-axis is the first coordinate of the vertices, the y-axis is the second, and the z-axis is the axis of thresholds. For different threshold values, we can compute the vertices of the safe spaces. This can be done by solving the conversion problem stated earlier and then recording the values for each vertex and plotting the three axes.

Given a payoff matrix $\mathit{A}$, our results are generated in the following way. First, we compute the column maximin value of the row payoff matrix. Since the vector of fitnesses for each player type are convex combinations of the columns of the row payoff matrix where the coefficients are the frequencies of each player type. We are looking for the maximum possible value of the minimum entry in the fitness vector under all possible convex column combinations. This is exactly the column maximin value. This maximin value is the maximum threshold given that a full-support safe space exists. Note that the maximin value may vary if the support is changed due to the irreversibility in truncation selection. Following this, we generate a set of thresholds to observe, ranging from the minimum of the payoff matrix to its maximum. When a threshold is less than or equal to the minimum, no culling happens, and when greater than the maximin value, no non-empty safe space exists for full support with respect to the maximin value.

3. Discussion

We have applied the concept of safe spaces, linear programming, and polyhedral representation conversion to two subjects of game theory: partially malicious players and independent truncation selection. Our aim was to develop methods that allow players to manage worst-case scenarios numerically.

Regarding partially malicious players, we constructed a simple model for players who are partially malicious. Such players only become malicious after securing a specified minimum payoff. If we require defensive plays against such players, we may use a generalized maximin procedure. In the case where both players have set their risk thresholds sufficiently low, both will have non-empty safe strategy sets, and thus the game could be formulated as a bilinear game (Garg et al., 2011). Future studies could develop and refine our decision rule, and the impetus for maliciousness could be directly modeled, such as by including relational utility. Additionally, truncation selection and the generalized maximin methods presented here may be used to address problems in control theory (Li et al., 2024; Liu & Zhu, 2023).

With respect to truncation selection, we showed that the equilibria are convex subsets of the probability space for each support. As the selection threshold varies linearly, the vertices of safe spaces also change linearly. When the threshold is exactly equal to the maximin value, the safe space converges to the set of maximin strategies. When the threshold is above the maximin value, extinction happens, and the game is irreversibly reduced. In general, the states do not converge to one of the Nash equilibria of the underlying game. These findings hold under the assumption of large populations, though prior work has shown how small populations can exhibit unexpected behaviors (D. B. Fogel et al., 1997; G. B. Fogel et al., 1998; G. B. Fogel & Fogel, 2011). Using the polyhedral conversion approach, we can compute the set of safe spaces analytically or less computationally intensively (with respect to the population size) than with stochastic simulations. Additionally, these methods are simpler than analyzing differential algebraic equations, which have been used to model truncation selection (Morsky & Bauch, 2016). However, our methods can still be computationally expensive for strategy spaces of high dimension. The computational complexity of polyhedral conversion algorithms depends on several factors (Bremner et al., 2009; Fukuda & Prodon, 1995): size of intermediate polytopes (sensitive to the ordering of half-spaces), dimension, number of half-spaces, and vertices. And, there exists a class of polytopes for which the double description method is exponential (Bremner et al., 2009). Nonetheless, we recommend the methods stated above for practical problems of relatively low dimension, while conducting simulations may be more practical for games of high dimension.

More broadly, our paper provides two additional scenarios in game theory requiring dense computations that benefit from linear programming and polyhedral conversion. This reinforces the value of expressing game-theoretic concepts in linear algebraic language and converting problems into feasible problems that these algorithms can solve.

4. Materials and Methods

4.1. Risk Aversion and Partially Malicious Players

We begin by defining some basic game-theoretic concepts in linear algebraic terms, since this is a useful formulation for linear and polyhedron conversion problems (which are detailed in Appendix A and Appendix B). A finite two-player normal-form game can be represented by a payoff table where the rows and columns represent the players’ pure strategies, and each entry contains a tuple of payoffs to the row and column players, respectively. For example:

$$\begin{array}{ccccc}& & L& R& \\ \begin{array}{c}U\\ D\end{array}& [& \begin{array}{c}(a_{\mathrm{row}},a_{\mathrm{col}})\\ (c_{\mathrm{row}},c_{\mathrm{col}})\end{array}& \begin{array}{c}(b_{\mathrm{row}},b_{\mathrm{col}})\\ (d_{\mathrm{row}},d_{\mathrm{col}})\end{array}& ]\end{array}.$$

(9)

We separate this table into two matrices: the row payoff matrix $\mathit{A}$, containing the first entries of each tuple; and the column payoff matrix $\mathit{B}$, containing the second entries. A mixed strategy for the row (column) player is a probability vector whose dimension equals the number of rows (columns) of the payoff table. If the row player adopts strategy $\mathit{p}$, her possible payoffs against a pure strategy playing column player is the portfolio $\mathit{a}=\left({\mathit{A}}^T\right)\mathit{p}$. Similarly, if the column player adopts strategy $\mathit{q}$, her portfolio is $\mathit{b}=\mathit{B}\mathit{q}$.

Players generally aim to maximize their payoffs, typically assuming that their opponents are rational. When this assumption fails (e.g., when opponents behave maliciously), a player’s degree of risk aversion becomes a key factor in strategy selection. Risk aversion can be measured in a variety of ways (Meyer & Meyer, 2006; Pratt, 1964). Here, we measure the risk aversion of a player’s strategy when facing an opponent whose behavior cannot be trusted to be fully rational in the following way. Consider a column player who is unsure of the rationality of their opponent (or indeed if they are malicious). The worst payoff to this player over all possible outcomes is $min\left(\mathit{B}\right)$. Let $v_{\mathrm{col}}$ denote their maximin value—their highest guaranteed payoff against any opponent. When $v_{\mathrm{col}}>min\left(\mathit{B}\right)$, we define the column player’s risk aversion for employing strategy $\mathit{q}$ as follows:

$$r_{\mathrm{col}}(\mathit{b},\mathit{B})={\displaystyle \frac{min\left(\mathit{b}\right)-min\left(\mathit{B}\right)}{v_{\mathrm{col}}-min\left(\mathit{B}\right)}},$$

(10)

where $\mathit{b}$ is the portfolio for strategy $\mathit{q}$. This equation maps $\mathit{b}$ to a real value, rescaling the payoff of the portfolio between the worst-case payoff ($r_{\mathrm{col}}=0$) and the maximin guarantee ($r_{\mathrm{col}}=1$) with intermediate values corresponding to partial risk aversion. We characterize a player by specifying a threshold value of her risk aversion ${\theta }_{\mathrm{col}}$, where she will restrict herself to strategies with risk aversion that meet or exceed it. Note that this measure is meaningful only when $min\left(\mathit{B}\right)<v_{\mathrm{col}}$, since no improvement over the worst outcome is possible otherwise.

For our model of partially malicious behavior, the objective of a partially malicious player is twofold. They prioritize obtaining a payoff that satisfies their basic needs, a minimum value they require. Once that payoff is secured, they act maliciously by minimizing their opponent’s payoff. We proceed by assuming that the column player is partially malicious. Such a player’s decision-making can be determined by the following function that takes both players’ payoffs along with a specified minimum payoff threshold and maps them to a value:

$$U({\pi }_{\mathrm{row}},{\pi }_{\mathrm{col}},{\varphi }_{\mathrm{col}})=\left\{\begin{array}{c}-\infty ,\mathrm{if}{\pi }_{\mathrm{col}}<{\varphi }_{\mathrm{col}},\hfill \\ g\left({\pi }_{\mathrm{row}}\right),\mathrm{if}{\pi }_{\mathrm{col}}\ge {\varphi }_{\mathrm{col}}.\hfill \end{array}\right.$$

(11)

${\varphi }_{\mathrm{col}}$ is the minimum payoff the column player is satisfied with, and ${\pi }_{\mathrm{row}}$ and ${\pi }_{\mathrm{col}}$ are the payoffs of the row and column player, respectively. The function $g\left(\pi \right)$ is strictly decreasing in ${\pi }_{\mathrm{row}}$, ensuring malicious behavior. For simplicity, we set $g\left(\pi \right)=-\pi$. We emphasize that, although this resembles a typical utility function, it does not satisfy the continuity axiom of expected utility maximization (John von Neumann, 1944). The negative infinity simply reflects the player’s priority of achieving the minimum required payoff before optimizing their malicious objective. In practice, a sufficiently low real value, smaller than the minimum value of g in the game, can be used to maintain consistency with the framework of expected utility.

4.2. Truncation Selection

Independent truncation selection models the evolution of the state of a population with a mixture of players who play pure strategies of a symmetric game (Morsky & Bauch, 2016). The population state $\mathit{x}$ is a vector whose entries are the proportions of the population of each strategy. The evolutionary process begins by specifying a selection pressure, a fixed threshold payoff for survival. Players compete against one another, earning payoffs from each encounter with an opponent. This process can be implemented by simulating round-robin tournaments with stochastic payoffs (D. B. Fogel et al., 1997; G. B. Fogel & Fogel, 2011), which generates a distribution of the payoffs averaged over the competitions. Payoffs may also be represented by distributions and studied with continuous dynamical systems (Morsky & Bauch, 2016). Regardless of how payoffs are particularly earned, at the end of the competition, players with averaged payoffs below the threshold are culled and do not reproduce. The remaining players each reproduce at the same rate so as to replace the culled players. In this way, players need to only have adequate payoffs that meet the threshold and receive no further benefit for exceeding it.

Our model of truncation selection assumes a large number of interactions between players. Thus, the payoff variance is negligible, and players effectively earn their fitnesses (i.e., their payoffs averaged over all interactions), the entries of the row payoff matrix $\mathit{A}$ (see Appendix C for further details). In our agent-based simulations, we initialize a population of N players of randomly determined pure strategies. In each round of the game, players earn the average payoff from each interaction and those with payoffs below the threshold $\varphi$ are culled. The remaining population reproduces to maintain the population size, rounding to the nearest whole number. This evolution is iterated until equilibria or extinction. Note that one round may be all that is required to reach an equilibrium.

Approaching this problem analytically, note that if the culling threshold payoff $\varphi$ is less than or equal to the column maximin value of $\mathit{A}$, then there exists a set of states where all player types meet or exceed the threshold. Thus, the population remains unchanged, and thus we treat such states as equilibria. We call the set of such equilibria the safe space. The set of equilibria for a given support typically forms a convex subset of the strategy simplex, and the overall safe space is the union of safe spaces for each support (note that the union of equilibria across supports is not convex in general). Assuming a full-support state (for other supports, one simply crosses out the corresponding rows and columns that are not in support), we can compute these equilibria via the following polyhedral conversion problem:

$$\begin{array}{c}\hfill \mathrm{convert}\mathrm{from}\mathrm{H}-\mathrm{to}\mathrm{V}-\mathrm{representation}:\\ \hfill 1={\mathbf{1}}^T\mathit{x}\\ \hfill \mathbf{0}\le \mathit{I}\mathit{x}\\ \hfill \varphi \mathbf{1}\le \mathit{A}\mathit{x}\end{array}$$

(12)

The first two constraints restrict the solution space inside the probability simplex, while the last enforces the equilibrium condition (i.e., that the payoffs of all player-types meet or exceed $\varphi$).

When $\varphi$ is less than or equal to the column maximin value of $\mathit{A}$, the vertices in V-representation form a convex subset of the probability simplex. When the $\varphi$ is exactly the column maximin value of $\mathit{A}$, the V-representation is exactly the set of maximin strategies (typically single points, but can be a convex set in general). When $\varphi$ is above the column maximin value of $\mathit{A}$, the polyhedron is the empty set. Thus, all states will have at least one player type go extinct, reducing the game to a sub-game. States outside of a non-empty safe space may evolve toward this space, toward a reduced game, or toward complete extinction of all player types.