{
  "id": "non-zero-sum-game",
  "title": "Non-zero-sum Game",
  "lang": "en",
  "source_lang": "en",
  "summary": "A non-zero-sum game is a strategic interaction in which gains and losses need not cancel, allowing shared benefits, shared losses, or mixtures of cooperation and conflict.",
  "category": "mathematics",
  "subcategory": "applied",
  "type": "concept",
  "aliases": [
    "Nonzero-sum game"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/non-zero-sum-game/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/non-zero-sum-game/",
      "json": "https://aiwiki.page/zh/non-zero-sum-game.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A non-zero-sum game is a game in game theory in which one participant’s gain need not be exactly offset by losses to others. Players may benefit together, lose together, or disagree over how to divide benefits that their interaction creates. In its usual substantive sense, the term describes games whose total payoff can vary with the players’ choices, rather than interactions concerned only with distributing a fixed total. Non-zero-sum games can therefore involve both common interests and conflicts of interest; they are not necessarily cooperative or mutually beneficial."
    },
    {
      "heading": "Definition and mathematical formulation",
      "text": "A game in strategic, or normal, form consists of a set of players \\(N=\\{1,\\ldots,n\\}\\), a strategy set \\(S_i\\) for each player \\(i\\), and a payoff function\n\n\\[u_i:S_1\\times\\cdots\\times S_n\\rightarrow\\mathbb{R}.\\]\n\nA strategy profile \\(s=(s_1,\\ldots,s_n)\\) specifies a choice for every player. The payoff \\(u_i(s)\\) represents how player \\(i\\) evaluates the resulting outcome; it need not be a monetary payment.\n\nIn a zero-sum game,\n\n\\[\\sum_{i=1}^{n}u_i(s)=0\\]\n\nfor every strategy profile. More generally, a constant-sum game satisfies\n\n\\[\\sum_{i=1}^{n}u_i(s)=c\\]\n\nfor some fixed constant \\(c\\). Subtracting constants from the players’ payoffs can normalize a constant-sum game to zero-sum form without changing their strategic incentives.\n\nThis creates a terminological distinction:\n\n- Literally non-zero-sum: the payoff sum is not identically zero. Under this definition, a constant-sum game with a nonzero total qualifies.\n- Variable-sum: the payoff sum changes across strategy profiles. This is usually the intended meaning when non-zero-sum interaction is contrasted with competition over a fixed total.\n\nFor a variable-sum game, there are profiles \\(s\\) and \\(t\\) such that\n\n\\[\\sum_i u_i(s)\\ne\\sum_i u_i(t).\\]\n\nThe broader term general-sum game is also common, especially in technical work. It typically indicates that no zero-sum restriction is imposed, rather than requiring that every game under consideration have a variable total."
    },
    {
      "heading": "Example: the prisoner’s dilemma",
      "text": "The prisoner’s dilemma illustrates why opportunities for mutual benefit do not guarantee that players will realize them. Each of two players chooses either to cooperate or to defect. An illustrative payoff matrix is:\n\nPlayer 1 / Player 2 | Cooperate | Defect\nCooperate | \\(3,3\\) | \\(0,5\\)\nDefect | \\(5,0\\) | \\(1,1\\)\n\nEach ordered pair gives Player 1’s payoff followed by Player 2’s.\n\nThe combined payoff is \\(6\\) under mutual cooperation, \\(5\\) when only one player cooperates, and \\(2\\) under mutual defection. The game is therefore variable-sum.\n\nNevertheless, defection gives either player a higher payoff regardless of the other player’s choice:\n\n- Against cooperation, defection yields \\(5\\) rather than \\(3\\).\n- Against defection, defection yields \\(1\\) rather than \\(0\\).\n\nDefection is thus a strictly dominant strategy for each player. Mutual defection is the game’s unique Nash equilibrium, even though both players receive higher payoffs under mutual cooperation.\n\nThe example separates two questions: whether a mutually beneficial outcome exists, and whether the incentives make that outcome stable."
    },
    {
      "heading": "Equilibrium and collective benefit",
      "text": "Nash equilibrium\n\nA Nash equilibrium is a strategy profile at which no player can improve their payoff by changing their own strategy alone. Formally, \\(s^*\\) is an equilibrium if, for every player \\(i\\),\n\n\\[u_i(s_i^*,s_{-i}^*)\\geq u_i(s_i,s_{-i}^*) \\quad\\text{for every }s_i\\in S_i,\\]\n\nwhere \\(s_{-i}^*\\) denotes the strategies of all other players.\n\nA finite game need not have an equilibrium in pure strategies, but it has at least one equilibrium in mixed strategies, in which players randomize over available actions. Payoffs are then evaluated using expected values.\n\nUnlike the two-player zero-sum setting, a general-sum game can have multiple equilibria with different payoff distributions and different levels of collective benefit. Equilibrium alone does not imply fairness, efficiency, or maximum total payoff.\n\nPareto efficiency\n\nAn outcome is Pareto efficient if no feasible alternative makes at least one player better off without making another worse off. An outcome Pareto dominates another if everyone is at least as well off and someone is strictly better off.\n\nIn the illustrative prisoner’s dilemma, mutual cooperation Pareto dominates mutual defection. The equilibrium is therefore Pareto inefficient.\n\nPareto efficiency does not determine how benefits should be distributed. Several efficient outcomes can favor different players. Nor is it identical to maximizing the sum of payoffs: such maximization requires accepting a particular way of comparing and aggregating players’ payoffs.\n\nCoordination and distribution\n\nNon-zero-sum games often combine two distinct problems:\n\n- Coordination: choosing compatible actions that produce benefits.\n- Distribution: deciding who receives those benefits or bears the costs.\n\nFor example, two organizations may both gain from adopting compatible technical standards while preferring different standards. Their common interest in compatibility does not remove their disagreement over which standard to adopt."
    },
    {
      "heading": "Main forms",
      "text": "Non-zero-sum games encompass several different incentive structures.\n\nCommon-interest games. Players have identical payoff functions, or at least agree on the ranking of outcomes. Strategic difficulties can still arise from uncertainty, communication failures, or coordination problems.\n\nCoordination games. Players benefit from choosing mutually compatible strategies. Multiple equilibria may exist, including equilibria that differ in their benefits or risks.\n\nSocial dilemmas. Individually attractive choices can produce outcomes that are worse for the group. The prisoner’s dilemma, public-goods problems, and some shared-resource problems belong to this broad family.\n\nBargaining games. Players can obtain gains from agreement but have conflicting preferences over their division. Their alternatives to agreement, information, and ability to commit affect the outcome.\n\nThese categories overlap. A game may simultaneously involve coordination, bargaining, and incentives to exploit others’ contributions.\n\nThe distinction between zero-sum and non-zero-sum games is also separate from the distinction between cooperative and noncooperative game theory. Noncooperative analysis models players’ individual strategic choices, including decisions to negotiate, cooperate, or enter contracts. Cooperative game theory instead commonly studies what coalitions can achieve and how their benefits may be allocated."
    },
    {
      "heading": "Repetition, information, and institutions",
      "text": "The incentives in an isolated encounter can differ from those in a repeated game. When players interact over time, present actions can affect future rewards, punishments, or willingness to cooperate.\n\nFor example, consider an indefinitely repeated version of the illustrative prisoner’s dilemma. Suppose future payoffs are discounted by \\(\\delta\\), with \\(0\\leq\\delta<1\\), actions are perfectly observed, and each player cooperates until any defection, after which both defect forever.\n\nContinued cooperation gives a player\n\n\\[\\frac{3}{1-\\delta}.\\]\n\nDefecting once against a cooperative opponent and then receiving mutual-defection payoffs gives\n\n\\[5+\\frac{\\delta}{1-\\delta}.\\]\n\nCooperation is preferable when\n\n\\[\\frac{3}{1-\\delta}\\geq 5+\\frac{\\delta}{1-\\delta},\\]\n\nwhich simplifies to \\(\\delta\\geq\\tfrac12\\). Under these assumptions, the specified strategies can sustain cooperation as a subgame-perfect equilibrium. This does not establish that cooperation must occur: other equilibria remain possible, and different monitoring or timing assumptions change the analysis.\n\nInstitutions can also alter the game. Contracts, verification, penalties, subsidies, and communication may change available actions, information, or payoffs. Mechanism design studies how rules can be constructed so that individual incentives support specified objectives."
    },
    {
      "heading": "Applications",
      "text": "In economics, non-zero-sum models describe bargaining, contracting, production, public goods, and competition among firms. A transaction can create benefits for both parties while leaving a conflict over price. Competition can likewise affect both how much value is created and how it is distributed.\n\nEnvironmental and shared-resource models examine interactions in which private choices affect collective outcomes. For example, the benefits of resource conservation may be widely shared while its immediate costs fall on particular participants.\n\nIn computer science and artificial intelligence, general-sum games model interactions among agents with partly aligned objectives, such as network users, automated negotiators, or learning systems. Improving one agent’s policy may change the incentives and learning environment faced by others.\n\nThese applications require specifying the relevant players, choices, information, and payoffs. Calling an interaction non-zero-sum does not by itself identify an equilibrium or explain how cooperation can be achieved."
    },
    {
      "heading": "Historical development",
      "text": "The contrast between fixed-total competition and interactions with broader possibilities became central to modern game theory. John von Neumann proved the minimax theorem for finite two-player zero-sum games in 1928. His 1944 book with Oskar Morgenstern, Theory of Games and Economic Behavior, established a major framework for strategic and cooperative analysis.\n\nJohn Nash’s work in 1950–1951 extended equilibrium analysis to general noncooperative games, including games without zero-sum payoffs. Later research developed bargaining theory, repeated-game analysis, information economics, and institutional approaches to cooperation and conflict."
    },
    {
      "heading": "Interpretive limitations",
      "text": "Payoff totals depend on representation. Expected-utility preferences are unchanged by a player-specific positive affine transformation,\n\n\\[u_i'(s)=a_i u_i(s)+b_i, \\qquad a_i>0.\\]\n\nThese transformations preserve strategic incentives and Nash equilibria, but different scale factors can change whether displayed payoff sums are constant. A game may therefore be strategically equivalent to a zero-sum game even when its written payoffs do not sum to zero. Claims about “total welfare” require additional assumptions about measurement and interpersonal comparison.\n\nMutual benefit requires a comparison point. An outcome is beneficial relative to some alternative, such as nonparticipation, a previous arrangement, or another feasible outcome. “Positive-sum” does not identify that baseline by itself.\n\nThe boundary of the model matters. Gains to the modeled players may impose costs on excluded parties. A profitable agreement between two firms, for example, need not benefit consumers. Adding affected parties can change the assessment of the interaction.\n\nNon-zero-sum does not mean conflict-free. Players may agree that a larger surplus is possible while disagreeing sharply over its division, the risks involved, or who must act first. The existence of potential gains is distinct from the existence of incentives, information, and enforceable arrangements capable of realizing them."
    }
  ],
  "links": [
    "game-theory",
    "zero-sum-game",
    "prisoners-dilemma",
    "matrix",
    "nash-equilibrium",
    "mixed-strategy",
    "expected-value",
    "pareto-efficiency",
    "repeated-game",
    "mechanism-design",
    "economics",
    "computer-science",
    "artificial-intelligence",
    "john-von-neumann"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}