Академический Документы
Профессиональный Документы
Культура Документы
KEYWORDS
Production Planning; Shapley Value; Linear Programming; CVaR; Data.
INTRODUCTION
202
Proceedings of The Fourth International Conference on Informatics & Applications, Takamatsu, Japan, 2015
period production planning is presented, starting with a summary on coalitional game theory, analyzing the correlation between cooperative games and production planning and as
well, presents an optimization model to calculate the Shapley values. Section 4 provides
a numerical example and Section 5 concludes
the paper with pointers to future work.
2
(1)
(2)
(3)
where
k() =
and
2erf 1 (2 1)
2
erf(z) =
(4)
CV aR (X) =
dFx (z)
(7)
where
{
Fx (z)
0
Fx (z)
1 ,
for z V aR (X)
for z V aR (X)
(8)
CVaR (X) is not equal to an average of outcomes greater than VaR (X).
3 A PROPOSAL FOR MULTI-PERIOD
PRODUCTION PLANNING PROBLEM
3.1 Coalitional Games with Transferable
Utility (TU)
A coalitional game with a finite set of players
is a pair (, v) where = {1, 2, , n} is the
set of players and v : 2N R a real-valued
(also called characteristic function) mapping,
with v() = 0. Any nonempty subset of [8]
(including itself and all the one-element subsets) is called a coalition. The characteristic
function v(H), the worth of coalition H, represents the total amount of transferable utility
that members of H could earn without any help
from the players outside of H, i.e., the maximum sum utility payoffs that the members of
coalition H can guarantee themselves against
the best offensive threat by the complementary
coalition \H.
Definition 3.1 (, v) is said to be superadditive if S, T
v(S T ) v(S) + v(T ), where S T = (9)
x2
dt.
(5)
203
Proceedings of The Fourth International Conference on Informatics & Applications, Takamatsu, Japan, 2015
H{i}
where, denotes the set of players, H represents the coalition under study and i a player.
Usually, finding the characteristic function
v(H) is a complex work, particularly in
nperson games, since the amount of coalitions players in the game have to build increases exponentially according to the number
of players, i.e., 2n 1. Because of its importance in terms of applications, this function has
been an important topic for research and thus,
a lot of algorithms to support its computation
have been suggested.
In this paper, we defined CVaR as the characteristic function and its computation is described next.
Let D = d1 + d2 + + dn be the cumulative demand and , the degree of significance.
Eq.(11) defines CVaR as follows.
v(H) = CV aRH (1 ) =
di +
+
iH jH
iH
ij
(z1 )
(11)
1 (z1 )
where,
V aRD (1 )
z1 =
12
..
.
12
22
12
2
1 + 12
..
.
12
Game Theory
ij
Here, is the standard normal density, denotes the cumulative function and ij are the
elements of the variance-covariance matrix
shown in (13) .
12
2
1 + 22
..
.
(12)
iH jH
2
1
12
= .
..
di
iH
22
+ +
n2
(13)
i
Player
S
Coalition
Characteristic
v
function
i
Shapley value
(1 ): confidence level
The
realization
values
Production
planning
Period
Set of periods
- CVaR(1)
individual
risk
is
the
set
204
Proceedings of The Fourth International Conference on Informatics & Applications, Takamatsu, Japan, 2015
xt
t=1
dt
(14)
t=1
For i = 1 :
x1 = 1 S0
(15)
For i 2 :
xi = i + i1 + di1
Min
(21)
T
+
T
s.t. A Mv + s s = A MA
(, v) = v()
(16)
That is,
x1 = 1 S0
x2 = 2 + 1 + d1
..
..
..
.
.
.
x = +
n
n
n1 + dn1
0 s+ , 0 s
where the objective function indicates the error to be minimized;
+ +
+ T
sets
s+ =[s+
and
1 , s2 , s3 , . . . , sn ]
T
s =[s1 , s2 , s3 , . . . , sn ] denote the slack
variables added to the model; A is a matrix
obtained according to the formation of the
players coalitions; v is a column matrix whose
elements are the real values v(H) and M =
(diag M,s ) obtained through (22) as follows:
(17)
(18)
where,
x1
1 0
1 1
0
1
..
..
.
.
0
0
x2
X = x3 , Q =
.
.
.
xn
1
2
= 3
..
.
n
0 0
0 0
1 0
..
..
.
.
0 0
and
..
.
0
0
0
..
.
...
S0
d1
d = d2 (19)
..
.
dn
1
{2 Cs1 }1
(22)
1
In Eq. (22), M,s denotes a set of weights,
as defined previously indicates the set of players and s indicates the number of elements in
the coalition being estimated (s H). To understand the representation of these matrices,
attempt to the following example.
Example 3.1 Let (, v) be a 3-person game
with = {1, 2, 3} the finite set of players. So,
M,s =
1 (, v)
= 2 (, v) ,
3 (, v)
v({1})
v({2})
v({3})
v=
v({1, 2})
v({1, 3})
v({2, 3})
(23)
205
Proceedings of The Fourth International Conference on Informatics & Applications, Takamatsu, Japan, 2015
and
1 0 0 1 1 0
AT = 0 1 0 1 0 1
0 0 1 0 1 1
(24)
NUMERICAL EXAMPLE
9
9
=
9
9
9
9
18
18
18
18
9
18
27
27
27
9
18
27
36
36
9
18
27
36
45
v(H)
0
17.995
17.308
33.848
27.992
41.879
33.879
49.586
43.155
56.616
49.986
43.285
56.519
60.829
73.917
68.967
Coalitions
v{123}
v{124}
v{125}
v{134}
v{135}
v{145}
v{234}
v{235}
v{245}
v{345}
v{1234}
v{1235}
v{1245}
v{1345}
v{2345}
v{12345}
v(H)
65.916
54.519
71.983
75.922
88.853
83.502
76.345
86.640
83.546
101.230
91.793
104.518
98.622
115.933
107.230
131.297
x1 = 17.58 10 = 7.58
(25)
Coalitions
v{}
v{1}
v{2}
v{3}
v{4}
v{5}
v{12}
v{13}
v{14}
v{15}
v{23}
v{24}
v{25}
v{34}
v{35}
v{45}
0.614
2.948
8.877
6.970
1
17.58
14.02
16.97
10
2
15.13
14.51
14.51
14.51
3
32.47
31.98
26.05
31.86
4
26.38
28.71
25.76
28.83
Proceedings of The Fourth International Conference on Informatics & Applications, Takamatsu, Japan, 2015
42.07 (case 1)
48 (case 2)
46 (case 3)
The slack variables obtained for the optimization problem in all cases are:
+
+
+
+
s+
1 = s2 = s3 = s4 = s5 = 0.614 and s1 =
s3 = 0 (main case).
+
+
+
+
s
1 = s4 = s5 = 2.948, s3 = 0.121 and s1 =
s+
2 = s3 = 0 (case 1).
+
+
+
s+
3 = 5.807, s5 = 8.877 and s1 = s3 = s4
= 0 (case 2).
+
+
+
s
1 = s5 = 6.970, s4 = 3.068 and s3 = s3
= 0 (case 3).
+
s+
1 = s2 = 0 (case 1, 2 and 3).
s
2
s
4
s
5
s+
6
s
6
Cases
1
2
3
Production volume x
Period 1 Period 2 Period 3
4.02
10.49
23.47
6.97
7.54
17.54
0
14.51
23.35
Period 4
16.73
19.71
16.97
Coalitions
v{}
v{1}
v{2}
v{3}
v{4}
v{5}
v{12}
v{13}
v{14}
v{15}
v{23}
v{24}
v{25}
v{34}
v{35}
v{45}
v(H)
0
16.188
14.751
30.719
24.377
37.838
29.838
45.158
38.373
51.503
44.565
37.569
50.523
54.312
67.153
61.514
Coalitions v(H)
v{123}
59.153
v{124}
48.523
v{125}
64.752
v{134}
68.255
v{135}
80.874
v{145}
75.024
v{234}
67.677
v{235}
78.357
v{245}
74.154
v{345}
91.005
v{1234}
81.894
v{1235}
94.455
v{1245}
88.082
v{1345}
104.644
v{2345}
97.005
v{12345} 117.893
207
Proceedings of The Fourth International Conference on Informatics & Applications, Takamatsu, Japan, 2015
makers can evaluate their strategies while performing several cases which imply analyzing
the constraints in the optimization model. Further studies on the consistency of the proposed
model when dealing with uncertainty data is
still a question without answer which, implies
a direction to be considered for extending this
work.
REFERENCES
[1] T. S. Coleman, A Practical Guide to Risk Management, The Research Foundation of CFA Institute,
2011
[2] S. Sarykalin, G. Serraino and S. Uryasev,
Value-at-Risk vs. Conditional Value-at-Risk
in Risk Management and Optimization, Tutorials in Operations Research, INFORMS,
pp. 270-294, 2008. Retrieved April 2015 from
http://dx.doi.org/10.1287/educ.1080.0052
[3] B. Abbasi and S. Z. Hosseinifard, Tail conditional
expectation for multivariate distributions: A game
theory approach, Statistics and Probability Letters,
vol. 83, no. 10, pp. 2228-2235, 2013.
[4] N. Ueno, K. Okuhara, H. Ishii, H. Shibuki and
T. Kuramoto,Multi-item Production Planning and
Management System Based on Unfulfilled Order
Rate in Supply Chain, Journal of the Operations
Research Society of Japan, vol. 50, no. 3 201-218,
2007.
[5] C. Marrison, The Fundamentals of Risk Measurement, McGrawHill, New York, 2002
[6] R. T. Rockafellar and S. Uryasev, Conditional
value-at-Risk for general loss distributions,Journal
of Banking and Finance, no. 26, pp. 1443-1471,
2002.
[7] A. O. N. Rene, K. Okuhara and E. Domoto Allocation of Weights by Linear Solvable Process in a
Decision Game, International Journal of Innovative Computing, Information and Control, vol. 8, no.
3, pp. 907-914, 2014.
[8] G. Owen, Game Theory, Second edition Academic Press, Inc., 1982.
[9] L. S. Shapley, A value for n-person games, In: A.
E. Roth, (Ed.), The Shapley value: essays in honor
of Lloyd S. Shapley, Cambridge University Press,
Cambridge, New York, 1988.
208