27.06.2013 Views

Proceedings of the 3rd European Conference on Intellectual Capital

Proceedings of the 3rd European Conference on Intellectual Capital

Proceedings of the 3rd European Conference on Intellectual Capital

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Klaus Bruno Schebesch<br />

for clients to invest into predicti<strong>on</strong> markets (by now a widely debated topic <str<strong>on</strong>g>of</str<strong>on</strong>g> experimental ec<strong>on</strong>omics,<br />

see Predicti<strong>on</strong> Markets (2009)).<br />

5. Trust-based cascaded opini<strong>on</strong> formati<strong>on</strong><br />

A highly stylized but very robust producer-c<strong>on</strong>sumer opini<strong>on</strong> formati<strong>on</strong> process is presented, which<br />

mimics opini<strong>on</strong>s with regard to a large list <str<strong>on</strong>g>of</str<strong>on</strong>g> opti<strong>on</strong>s. As with future applicati<strong>on</strong>s <str<strong>on</strong>g>of</str<strong>on</strong>g> smart textiles from<br />

secti<strong>on</strong> 2, such opti<strong>on</strong>s do not interrelate at early time steps. As time evolves, we assume that trust<br />

increases between agents, albeit with different rates in different c<strong>on</strong>texts. For simplicity, dynamic<br />

effects <str<strong>on</strong>g>of</str<strong>on</strong>g> forgetting and unlearning are neglected here. As in secti<strong>on</strong> 3 we start out an opini<strong>on</strong><br />

formati<strong>on</strong> process X ( i,<br />

t)<br />

> 0 over discrete time t = 0, 1,...,<br />

T,<br />

which we term opini<strong>on</strong> formati<strong>on</strong> <str<strong>on</strong>g>of</str<strong>on</strong>g><br />

c<strong>on</strong>sumers. Next, we adjoin a sec<strong>on</strong>d process Y ( i,<br />

t)<br />

> 0,<br />

called opini<strong>on</strong> formati<strong>on</strong> <str<strong>on</strong>g>of</str<strong>on</strong>g> producers,<br />

which functi<strong>on</strong>s according to <str<strong>on</strong>g>the</str<strong>on</strong>g> same dynamic equati<strong>on</strong>s as process X . For simplicity we assume a<br />

unidirecti<strong>on</strong>al dependence X ( Y ), which reflects a trust increase with those c<strong>on</strong>sumers which form<br />

opini<strong>on</strong>s in <str<strong>on</strong>g>the</str<strong>on</strong>g> vicinity <str<strong>on</strong>g>of</str<strong>on</strong>g> those evolved by <str<strong>on</strong>g>the</str<strong>on</strong>g> producers. The difference to <str<strong>on</strong>g>the</str<strong>on</strong>g> basic process described<br />

in secti<strong>on</strong> 3 is how we determine <str<strong>on</strong>g>the</str<strong>on</strong>g> dynamic neigborhood <str<strong>on</strong>g>of</str<strong>on</strong>g> every agent. The index set<br />

{ k( i)}<br />

<str<strong>on</strong>g>of</str<strong>on</strong>g> every c<strong>on</strong>sumer i = 1,<br />

2 X is now computed using a trust-based radius<br />

(instead <str<strong>on</strong>g>of</str<strong>on</strong>g> c<strong>on</strong>stant radius w > 0 ), which partially depends <strong>on</strong> <str<strong>on</strong>g>the</str<strong>on</strong>g> match with <str<strong>on</strong>g>the</str<strong>on</strong>g> opini<strong>on</strong>s evolved<br />

by <str<strong>on</strong>g>the</str<strong>on</strong>g> producers j = 1,<br />

2,...,<br />

N and which evolves according to<br />

N ,..., 0 ) , ( > t i W<br />

Y<br />

NY<br />

XY∑<br />

j = 1<br />

( || X ( i,<br />

t)<br />

−Y<br />

( j,<br />

t)<br />

|| < W )<br />

W ( i,<br />

t + 1)<br />

= W ( i,<br />

t)<br />

+ W + W u<br />

, with 1 >> W ( i,<br />

0)<br />

> 0,<br />

X<br />

with u(.) <str<strong>on</strong>g>the</str<strong>on</strong>g> unit functi<strong>on</strong>, which returns 1 if <str<strong>on</strong>g>the</str<strong>on</strong>g> argument is true and 0 o<str<strong>on</strong>g>the</str<strong>on</strong>g>rwise, and with <str<strong>on</strong>g>the</str<strong>on</strong>g><br />

parameters selected to be W X = 0.<br />

5 and W XY = 0.<br />

075.<br />

The index set { h( j)} <str<strong>on</strong>g>of</str<strong>on</strong>g> every producer j is<br />

updated by a trust-based radius V ( j,<br />

t)<br />

> 0,<br />

which simply increases with time, namely<br />

V ( j,<br />

t + 1)<br />

= V ( j,<br />

t)<br />

+ V , with 1 >> V ( j,<br />

0)<br />

> 0,<br />

and with parameter V = 1.<br />

5.<br />

Y<br />

If as assumed in <str<strong>on</strong>g>the</str<strong>on</strong>g> sequel, <str<strong>on</strong>g>the</str<strong>on</strong>g> starting opini<strong>on</strong>s <str<strong>on</strong>g>of</str<strong>on</strong>g> <str<strong>on</strong>g>the</str<strong>on</strong>g> producers are a true<br />

N N > )} 0 , ( { j Y<br />

X<br />

Y<br />

{ X ( i,<br />

0)},<br />

subset <str<strong>on</strong>g>of</str<strong>on</strong>g> <str<strong>on</strong>g>the</str<strong>on</strong>g> starting opini<strong>on</strong>s <str<strong>on</strong>g>of</str<strong>on</strong>g> <str<strong>on</strong>g>the</str<strong>on</strong>g> c<strong>on</strong>sumers reflecting more focused informati<strong>on</strong> <str<strong>on</strong>g>of</str<strong>on</strong>g> <str<strong>on</strong>g>the</str<strong>on</strong>g><br />

producers. Figure 6 depicts an example <str<strong>on</strong>g>of</str<strong>on</strong>g> a cascaded opini<strong>on</strong> formati<strong>on</strong> process, where <str<strong>on</strong>g>the</str<strong>on</strong>g> out-<br />

Figure 6: An opini<strong>on</strong> formati<strong>on</strong> process with a starting number <str<strong>on</strong>g>of</str<strong>on</strong>g> opini<strong>on</strong>s <str<strong>on</strong>g>of</str<strong>on</strong>g> producers N Y = 15<br />

(some are place in close vicinity to o<str<strong>on</strong>g>the</str<strong>on</strong>g>rs) and a starting number N X = 50 <str<strong>on</strong>g>of</str<strong>on</strong>g> c<strong>on</strong>sumer<br />

opini<strong>on</strong>s, c<strong>on</strong>sumer opini<strong>on</strong>s are c<strong>on</strong>verging towards “creative” soluti<strong>on</strong>s represented by<br />

higher ranking opini<strong>on</strong>s <strong>on</strong> <str<strong>on</strong>g>the</str<strong>on</strong>g> scale. Less creative soluti<strong>on</strong>s (9 <strong>on</strong> <str<strong>on</strong>g>the</str<strong>on</strong>g> producers side) are<br />

aband<strong>on</strong>ed<br />

407<br />

XY<br />

Y

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!