we nominate some money-candidates (for instance 7)

each one can vote one of the others (voting-time is 5 days) .

ring-voting is canceled (in the example beneath a ring-voting would be if F vote B or D) .

voting:

A → C : A - C

B → D : B - D | A - C

C → G : A - C - G | B - D

D → F : B - D - F | A - C - G

E → A : E - A - C - G | B - D - F

F → G : B - D - F - G - C - A - E

G : the last one don’t need to vote .

so we get a tree of importance:

G (6 points)

- C (2 points)
- A (1 point)
- E

- A (1 point)
- F (2 points)
- D (1 point)
- B

- D (1 point)

so we get 12 points .

given a cwb-fund of 12,000 (super currency) each point is 1,000 .

now we can book the money .

I ‘m sorry sigi but I don’t understand how to read the model, I mean I ‘m not able to find the logic of the process in your model … so can you help me with “ordinary words” to define :

- the different signs you use to write the process

- the different steps of the building tree process

Thanks --SylvieBourguet

well, a picture is worth 1000 words . let’s look at the

tree-picture of WikiFolks .

say, we want to distribute a budget of 79000 (taken from our cooperation fund) to the 40 peoples in that tree, given the tree as a distribution-structure . to get the points for a person, we count its connections to the outside of the tree . the center (SB) has 39 connections, because there are 40 persons in the tree . so it receive 39 points . the subcenters are MM (16 points), CD (14 points), SI (6 points) . then there are AN, KD, LK, KA (in each case 1 point) . the rest has no connections to the outside (no points) . because there are 79000 currency-units and 79 points, each point is worth 1000 units .

the tree structure is formed by voting . suppose first CN votes KD, then KD votes CD, then CD votes SB .

then the structure is CN - KD - CD - SB . suppose then MW votes KA, KA votes SI, SI votes SB .

then the structure is CN - KD - CD - SB - SI - KA - MW

and so on . couldn’t show that, because it’s no more linear, but we can look at the picture .

hope, this could help you . if there are still questions: all the better . glad to see you here

OK … to verify if I understand your explanations :

I can write what you say like :

CN → KD : CN - KD

KD → CD : CN - KD - CD

CD → SB : CN - KD - CD - SB

MW → KA : MW - KA | CN - KD - CD - SB

KA → SI : MW - KA - SI | CN - KD - CD - SB

SI → SB : CN - KD - CD - SB - SI - KA - MW

I imagine the tree can look like this :

CN---KD---CD---SB | | SI---KA---MW

So, if I count connections (points) to the outside of the tree, I find for each persons :

SB = 6 points

SI = 2 points

KA = 1 point

MW = 0 point

CD = 2 points

KD = 1 point

CN = 0 point

hey, who is saying, our english isn’t perfect .

we can perfectly make us understood in that language

thank you sigi for your support

it’s me who has to thank you!

allow me to give you some whuffy

(sort of donation (comes from an idea of cory doctorow (out and down in the magic kingdom)))

CwbJournal & CwbTotal

back to CommunityWikiBankIII