# Ω 2

Personal Blog
Crossposted from the AI Alignment Forum. May contain more technical jargon than usual.

In this post, I present a generalization of Nash equilibria to non-CDT agents. I will use this formulation to model mutual cooperation in a twin prisoners' dilemma, caused by the belief that the other player is similar to you, and not by mutual prediction. (This post came mostly out of a conversation with Sam Eisenstat, as well as contributions from Tsvi Benson-Tilsen and Jessica Taylor)

This post is sketchy. If someone would like to go through the work of making it more formal/correct, let me know. Also, let me know if this concept already exists.

Let be a finite collection of players. Let be a finite collection of moves available to . Let be a utility function for player .

Let be the simplex of all probability distributions over . Let denote the vector space of functions , with .

A vector given a distribution in and a vector we say that is unblocked from if there exists an , such that . i.e., it is possible to move in the direction of from , and stay in .

Given a strategy profile in , and a vector in , we say that improves for if

We call this limit the utility differential for at in the direction of .

i.e., improves for if is increased when is moved an infinitesimal amount in the direction of . (not that this is defined even when the vectors are not unblocked from the distributions)

A "counterfactual gradient" for player is a linear function from to , such that the function into the component is the identity. This represents how much player expects the probabilities of the other players to move when she moves her probabilities.

A "counterfactual system" for is a continuous function which takes is a strategy profile in , and outputs a counterfactual gradient. This represents the fact that a player's counterfactual gradient could be different depending on the strategy profile the game ends up in. We fix a counterfactual system for each player.

Claim: There exists a strategy profile in such that for all players , if is unblocked from , then does not improve .

I will call such a point an entangled equilibrium.

Proof Sketch: (Very sketchy, and I have not verified this. There is probably a better way. It might not be true.)

We will construct a continuous function from to itself. We do this by moving by adding the gradient of function from to to , assuming all other players probabilities change according to the linear function . If adding this gradient would take the point out of the simplex , you hit a boundary after moving some proportion of the gradient. Then, now that you are on the boundary, you use move by times the gradient of the same function restricted to the boundary, and repeat.

This function has a fixed point, by Brouwer. For each player, this fixed point must have 0 gradient, or be on the boundary, pointing outward. If it is on a boundary, it has the same property when restricted to that boundary.

If there was an unblocked direction a player could move that would improve its utility, then the gradient would be nonzero. If the player is on a boundary, the gradient is pointing outward, and there is an unblocked direction that would be an improvement, there will be such a direction that stays on that boundary, and the gradient restricted to that boundary would be nonzero.

Example 1

Consider a twin prisoners' dilemma game. Two players can either cooperate or defect. They get 0 utility for being exploited, 3 for exploiting, 2 for mutual cooperation, and 1 for mutual defection.

Both players believe that the other is using a decision procedure that is entangled with their own, but they are not completely sure.

Formally, both players think that when they increase their probability by , the other player increases by , regardless of where the probabilities start.

Thus , where is the vector ( cooperates)-( defects) in , and is the analogous vector for player 2. Similarly, .

Since both players always think that increasing their probability of cooperation increases utility, the only equilibrium is when both players cooperate with probability 1.

Example 2

Now let look at a case where the gradients are a function of the distributions. Again, both players believe that the other is using a decision procedure that is entangled with their own, but they are not completely sure.

Formally, player 1 thinks that when they increase (or decrease) their probably of cooperation by , the other player will increase (or decrease) their probability by , where is one minus the square of the difference between their two probabilities.

Player 2 on the other hand, thinks the other player will increase (or decrease) their probability by , where is one minus the absolute value of the difference between their two probabilities.

Thus , where is the vector ( cooperates)-( defects) in , and is the analogous vector for player 2. Similarly, .

Thus, if player 1 cooperates with probability , and player 2 cooperates with probability , then player 1 expects to lose gain utility by increasing his probability by . This function is only 0 if . Thus the only entangled equilibria with mixed strategies for player 1 have . Similarly, the only entangled equilibria with mixed strategies for player 2 have . Thus, there are no mixed strategies for both players in equilibria.

The only pure equilibrium is

If , then must be nonpositive, so must be at least . None of these points are equilibria for player 2.

If , then must be nonnegative, so must be at least . This is in equilibrium if .

If , then must be at least , This in in equilibrium if .

If q=1, then must be at least , and there is no equilibrium.

Thus, there are three entangled equilibria (1,1), (1,1/2), (1/,0).

Pingbacks