# US 2004/0083078 A1 · Method and system for using cooperative game theory to resolve statistical and other joint effects

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0083078 A1
- Document ID: US20040083078A1
- Status: Published application
- Kind: A1
- Application number: 10/685,006
- Filed: 2003-10-14
- Published: 2004-04-29
- Earliest claimed: 2001-04-06
- Inventors: Barry E. Feldman
- Web page: https://patentgrep.com/patent/US20040083078A1

## CPC

- G06F 17/18: for evaluating statistical data {, e.g. average values, frequency distributions, probability functions, regression analysis (forecasting specially adapted for a specific administrative, business or logistic context G06Q10/04)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method and system for cooperative resolution of statistical and other joint effects. The method and system include constructing controlled allocation games. Allocation patterns in a control game are used to determine value allocations in an allocation game. The method and system also includes approximating value functions for large cooperative games. The method and system may be used to construct statistical cooperative games and use cooperative game theory to resolve statistical joint effects in a variety of situations. The methods may be applicable to other types of joint effects problems such as those found in engineering, finance and other disciplines.

## Claims

### Claim 1

A method for allocating value among players in a cooperative allocation game in order to resolve joint effects in an allocation problem, comprising:
identifying a control game and its players;
identifying an allocation game and its players;
establishing a control relationship between players or coalitions in the control game and players or coalitions in the allocation game;
selecting a set of coalitions in the control game;
determining a set of worths for the selected set coalitions in the control game;
evaluating one or more control functions using the determined set of worths to determine a set of values for the one or more control functions in the control game;
selecting a set of coalitions in the allocation game;
determining a set of worths for the selected set of coalitions in the allocation game; and
combining the determined set of values for the one or more control functions in the control game with the determined set of worths for the selected set of coalitions in the allocation game to determine allocations to players in the allocation game.

### Claim 2 (depends on 1)

The method of claim 1 further comprising a computer readable medium having storing therein instructions for causing a processor to execute the steps of the method.

### Claim 3 (depends on 1)

The method of claim 1 wherein the allocation game and control game include the same set of players.

### Claim 4 (depends on 1)

The method of claim 1 wherein the established control relationship between players in the control game and the allocation game is a default identity relationship.

### Claim 5 (depends on 1)

The method of claim 1 wherein:
one of the one or more control functions is a value function of the control game;
a weighted value is used as a value function of the allocation game, or
a player's value in the control game is used as the player's weight in the allocation game.

### Claim 6 (depends on 5)

The method of claim 5 wherein the weighted value is a weighted Shapley value.

### Claim 7 (depends on 1)

The method of claim 1 wherein:
the one or more control functions are ordered worth products of coalitions in the control game;
the set of worths of the selected coalitions in the allocation game are used to determine marginal contributions of individual players;
ordered worth products are used to weight players' marginal contributions in the allocation game, or
a value allocated to an individual player in the allocation game is determined by the weighted marginal contributions.

### Claim 8 (depends on 7)

The method of claim 7 wherein a player's allocation is an Integrated Proportional Control (IPC) value for an allocation game v and a control game w that is determined by:
36 IPC i ⁡ ( v , w ) = R ⁡ ( N , w ) ⁢ ∑ r ∈ R Ω ⁡ ( N ) ⁢ OWP ⁡ ( w , r ) - 1 ⁢ ( v ⁡ ( S r ⁡ ( i ) r ) - v ⁡ ( S r ⁡ ( i ) r ⁢ \ ⁢ i ) ) ,
where R(N, w) is a ratio potential of a grand coalition for the control game w, OWP(w,r)−1 is an inverse of an Ordered Worth Product for an ordering r in the control game w, RΩ(N) is a set of all permutations of orderings of players in N, Sr(i)r is a coalition formed by player i and all players before player i in the ordering r and v(Sr(i)r) is a worth of the coalition Sr(i)r.

### Claim 9 (depends on 1)

The method of claim 1 wherein the control game is a statistical cooperative game and an explanatory power is used as a performance measure in the statistical cooperative game.

### Claim 10 (depends on 1)

The method of claim 1 wherein the allocation game is a statistical cooperative game and total effects is used as a performance measure in the statistical cooperative game.

### Claim 11 (depends on 1)

The method of claim 1 wherein a manager performance attribution problem is used to generate both the allocation and control games.

### Claim 12 (depends on 1)

The method of claim 1 further comprising:
approximating values in large cooperative controlled allocation games wherein coalitions selected in a control game and in an allocation game are identified by a collection of player orderings for players in the control game and a collection of player orderings for the allocation game.

### Claim 13

A method for approximating a value function for players in a cooperative game based on a large number of players representing an allocation problem, comprising:
selecting a measure of precision;
determining a desired precision for approximated player values;
selecting a collection of orderings from a set of possible permutations of player orderings;
computing at least one intermediate value function based on coalitional worths generated for each selected ordering;
computing, periodically, a precision of approximations of values for players to determine if more player orderings should be generated to obtain a more precise estimate of values for players; and
computing a final value approximation for determining allocations to players when a desired degree of precision is reached or a selected computational limit is exceeded.

### Claim 14 (depends on 13)

The method of claim 13 further comprising a computer readable medium having storing therein instructions for causing a processor to execute the steps of the method.

### Claim 15 (depends on 13)

The method of claim 13 wherein:
a collection of player orderings is randomly generated with all players having equal probability of appearing at any position in an ordering;
an intermediate value function generated based on each player ordering is the marginal contribution of each player; or
at least one player's average marginal contribution is determined, or
allocations to players are based on average marginal contributions.

### Claim 16 (depends on 13)

The method of claim 13 wherein:
an approximation of a weighted value is computed;
a collection of player orderings is randomly generated with a probability of a player appearing at a particular point in an ordering proportional to a ratio of its weight to a sum of weights of players not already ordered;
an intermediate value function generated based on each player ordering is a marginal contribution of each player;
at least one player's average marginal contribution is determined; or
at least one player's value is based on its average marginal contribution.

### Claim 17 (depends on 13)

The method of Claim 13 wherein: an approximation of a powerpoint is computed.

### Claim 18 (depends on 13)

The method of claim 13 wherein:
a standard error is a selected measure of precision; and
squared values of intermediate value functions used to compute estimated values are also computed and the estimated values squared or their sums are saved, or
sums of squared intermediate value functions and sums of intermediate value functions are used to compute sample standard errors of estimated values for players.

### Claim 19

A method for approximating the proportional value for players in a cooperative game based on a large number of players comprising:
selecting a collection of orderings from a set of possible permutations of player orderings;
computing weighted marginal contributions for at least one ordering of players and one player in that ordering; and
determining allocations to players in the cooperative game.

### Claim 20 (depends on 19)

The method of claim 19 further comprising a computer readable medium having stored therein instructions for causing a processor to execute the steps of the method.

### Claim 21 (depends on 19)

The method of claim 19 wherein the computing step includes computing weighted marginal contributions WMir(v) for each player i and ordering r in the cooperative game v with:
37 WM i r ⁡ ( v ) = M i r ⁡ ( v ) OWP ⁡ ( r , v ) ,
wherein the weighted marginal contributions WMir(v) are intermediate value functions used to approximate a proportional value, Mir(v) are marginal contributions for each ordering r and OWP(r, v) is an Ordered Worth Product for an ordering r in the cooperative game v.

### Claim 22 (depends on 19)

The method of claim 19 wherein the determining step includes: determining a summation of weighted marginal contributions SWMi(v) for a player i in a cooperative game v with:
38 SWM i ⁡ ( v ) = ∑ r ∈ R * ⁡ ( N ) ⁢ WM i r ⁡ ( v ) ;
wherein the summation is over all orderings r in a selected collection of orderings R*(N) and WMir(v) are weighted marginal contributions for player i and ordering r.

### Claim 23 (depends on 19)

The method of claim 19 wherein the determining step includes: determining an estimated proportional value EstPVi of a player i in a cooperative game v including N players with:
39 EstPV i ⁡ ( v ) = SWM i ⁡ ( v ) ∑ j ∈ N ⁢ SWM j ⁡ ( v ) ⁢ v ⁡ ( N ) ,
wherein EstPVi is a proportional share of a worth of a grand coalition according to weighted marginal contributions SWMi(v) and a summation of weighted marginal contributions SWMj(v) for an ordering j.

### Claim 24 (depends on 23)

The method of claim 23 wherein the control game and allocation game have a same set of players and one collection of player orderings is used for both the control game and allocation game.

### Claim at position 25

25 A method for decomposing joint effects in a statistical model comprising:
constructing a statistical cooperative game to represent joint effects; and
applying a cooperative solution function to determine a suitable decomposition.

### Claim 26 (depends on 25)

The method of claim 25 further comprising a computer readable medium having storing therein instructions for causing a processor to execute the steps of the method.

### Claim 27

A method for combining a variance decomposition of the returns of financial instrument with a factor or style analysis model of a financial instrument based on a set of benchmarks comprising computing a variance ratio for a benchmark i according to the formula:
40 Variance ⁢ ⁢ Ratio i = f i b i ,
wherein fi is an allocation to benchmark i of a normalized or unnormalized variance decomposition of the returns of the financial instrument and bi is an allocation to benchmark i of a normalized or unnormalized variance decomposition of the returns of the passive model of the financial instrument based on the factor or style analysis.

### Claim 28 (depends on 27)

The method of claim 27 further comprising a computer readable medium having storing therein instructions for causing a processor to execute the steps of the method.

### Claim 29

A cooperative game resolution system, comprising in combination:
a plurality of software modules stored as data bits in memory on one or more computers with one or more processors, the plurality of software modules including:
one or more software modules for constructing a controlled allocation game, wherein allocation patterns in a control game are used to determine value allocations in an allocation game; or
one or more software modules for approximating value functions for large cooperative games, wherein value functions are approximated to a desired level or precision using a collection of orderings from a set of possible permutations of player orderings in a the large cooperative game.
