Differences

This shows you the differences between two versions of the page.

--- euroliquid:basis [2012/08/04 03:05] – [How to smooth networks greediness] robotica
+++ euroliquid:basis [2013/07/21 19:11] (current) – external edit 127.0.0.1
@@ Line 4: / Line 4: @@
 Our society can also be seen as a network where the computers are the people, the ethernet cables / wifi are the trust relations and the servers are the representers.
+===== Converging Theories =====
+==== Penrose method ====
+//The Penrose method (or square-root method) is a method devised in 1946 by Professor Lionel Penrose for allocating the voting weights of delegations (possibly a single representative) in decision-making bodies proportional to the square root of the population represented by this delegation. //
+[[http://en.wikipedia.org/wiki/Penrose_method]]
 ==== Metcalfe's law ====
@@ Line 36: / Line 47: @@
-==== How to smooth networks greediness ====
+===== How to smooth networks greediness =====
 According to the theoretical behaviours of networks, larger groups will dominate the entire network, because of their huge "gravity" and marginal utility.
@@ Line 43: / Line 54: @@
 Let's immagine a non weighted liquidfeedback system where the 30.000 pirates of germany and the 10.000 pirates of the rest of the world can vote togheter. Of course germany would dominate the world!
+==== Solution ====
-The solution to balance the groups, avoiding greedy behaviours, is to smooth the power by the inverse function of the square: **the square root**.
+The solution to balance the groups, avoiding greedy behaviours, is to smooth the power by using the inverse function of the square: **the square root**.