### Table 1: Algorithm: Shapley.

2000

"... In PAGE 6: ....1.1 Shapley The first algorithm for finding a SG solution was given by Shapley [18] as a result of his proof of the existence of equilibria in zero-sum SGs. The algorithm is shown in Table1 . The algorithm uses a temporal differencing technique to backup values of next states into a simple matrix game, BZD7B4CE B5.... ..."

Cited by 17

### Table 1: Algorithm: Shapley.

2000

"... In PAGE 6: ....1.1 Shapley The first algorithm for finding a SG solution was given by Shapley [18] as a result of his proof of the existence of equilibria in zero-sum SGs. The algorithm is shown in Table1 . The algorithm uses a temporal differencing technique to backup values of next states into a simple matrix game, Gs(V ).... ..."

Cited by 17

### TABLE III SHAPLEY VALUES FOR THE FEATURES IN CASE I

### Table 2. Characteristic functions and Shapley values

"... In PAGE 10: ... Table2 implies a ranking regarding the suitability of the various ownership structures with respect to the specific investments.4 The ranking of maximum possible investment outlays by party 1 for the various ownership structures is: III lt; I lt; II.... ..."

### Table 1.1 Shapley values and interaction indices for various operators

### Table 1: Algorithm: Shapley.

2000

"... In PAGE 6: ....1.1 Shapley The first algorithm for finding a SG solution was given by Shapley [18] as a result of his proof of the existence of equilibria in zero-sum SGs. The algorithm is shown in Table1 . The algorithm uses a temporal differencing technique... ..."

Cited by 17

### Table 1: The Shapley Game.

"... In PAGE 2: ... We as- sume (as in many previous work) that payoffs are bounded, R(a; b) 2 [0; rmax], for real rmax. Table1 shows an ex- ample matrix game for two agents, the Shapley game, with rmax = 1. Each agent has 3 available actions.... ..."

### Table 1. Algorithm: Shapley.

2000

Cited by 17

### Table 1. Algorithm: Shapley.

2000

Cited by 17