Motivation Model in Community-Built System - Community-Built Databases: Research and Development - page 197

and the total maximal motivation function. The editor's interest is satisfied by
placing in the repository a properly solved task of a significantly high level of
complexity. The creator's interests involve attaining high quality of task while
minimizing time costs, which also depends on the level of complexity of the task.
The decision-making process can be described by a binary argument, y i

1 if creator c z chooses task r i
0 otherwise

y i ¼

;

y i Þ¼ as

E C

Then, the goal function has the following structure: Fð þ s

Z ¼

max
Y

,

y i g ;

i ; j and

where Y is waging coefficient.

Both elements of the goal function depend on the same argument Q

¼f i ¼ 1 2

; ...

j ¼ 1 2

; ...

a

; ;

ð r i Þ . The

E is a monotonous increasing function of argument Q C

element

z in
dependence on kind of creator is monotonously decreasing or increasing func-
tion of the same argument Q

s ð r i Þ , while s

.
7. Editor goal function of repository filling
The editor goal function reflects the influence of each task on the accumulation
of knowledge in the repository

ð r i Þ

. The current state of knowledge in the
repository is characterized by two parameters: domain ontology graph G D and
the level of its coverage with properly solved tasks, topical for the editor - graph
G P . Each solved task r i ensures a proper accrual of knowledge in the repository
G

ðD W Þ

G P G D , meaning G D

. We assume that tasks with a
higher complexity level provide a greater increase of knowledge than tasks with
a low complexity level.

ð r i Þ D W ð r i Þ¼ \ G ð r i Þ

Let us consider:
G D

W D K D

¼f g - domain ontology graph, C ¼ð c 1 ; c 2 ; ... c z ; ...Þ -creatorscoming

;

to choose and solve tasks, t ð c Þ¼ð t 1 ð c 1 Þ ; t 2 ð c 2 Þ ; ... ; t z ð c z Þ ; ...Þ - stochastic process

R

of creators arrival, ¼ f r i cðÞ g ; r i 2 R c z 2 C - set of tasks chosen by creators

;

according to their goal function.

y i Þ¼ as

E C

Z

Fð þ s ¼ max

Y

;

i ;

j :

i ¼

; ... ;

1 ; 2 j ¼ 1 ; 2 ; ...

ontology subgraph, G P - summary
graph of ontologies of tasks placed in the repository in the interval

G ð r i ð c z ÞÞ ¼ f W i ; K i g

- solved task r i ð

c z Þ

t ½ 0 T 0 :

;

G P ¼ Gr 1 ð ð c 1 Þ Þ[ Gr 2 ð ð c 2 Þ Þ[[ Gr i ð ð c z Þ Þ[ ;

t 1 ; t 2 ; ... ; t j ; ...2½

T 0

where 0 ;