(nl) vote/2024 - Add missing vote files (copy from en) to fix failing buildHEADmaster

4 files changed, 107 insertions, 0 deletions

diff --git a/dutch/vote/2024/vote_001_majority.src b/dutch/vote/2024/vote_001_majority.src
new file mode 100644
index 00000000000..d964c23575f
--- /dev/null
+++ b/dutch/vote/2024/vote_001_majority.src
@@ -0,0 +1,7 @@
+              <h3>Majority</h3>
+              <ul>
+                <li>Option1 passes Majority.
+  4.578 (293/64) &gt; 1</li>
+                <li>Option2 passes Majority.
+  4.242 (280/66) &gt; 1</li>
+              </ul>
diff --git a/dutch/vote/2024/vote_001_quorum.src b/dutch/vote/2024/vote_001_quorum.src
new file mode 100644
index 00000000000..18d00b6b2a3
--- /dev/null
+++ b/dutch/vote/2024/vote_001_quorum.src
@@ -0,0 +1,5 @@
+              <h3>Quorum</h3>
+              <ul>
+                <li>Option1 Reached quorum: 293 &gt; 47.6707457462121</li>
+                <li>Option2 Reached quorum: 280 &gt; 47.6707457462121</li>
+              </ul>
diff --git a/dutch/vote/2024/vote_001_quorum.txt b/dutch/vote/2024/vote_001_quorum.txt
new file mode 100644
index 00000000000..0ec81d6a7fd
--- /dev/null
+++ b/dutch/vote/2024/vote_001_quorum.txt
@@ -0,0 +1,4 @@
+ Current Developer Count = 1010
+ Q ( sqrt(#devel) / 2 ) = 15.8902485820707
+ K min(5, Q )           = 5
+ Quorum  (3 x Q )       = 47.6707457462121
diff --git a/dutch/vote/2024/vote_001_results.src b/dutch/vote/2024/vote_001_results.src
new file mode 100644
index 00000000000..7e6eaffbf77
--- /dev/null
+++ b/dutch/vote/2024/vote_001_results.src
@@ -0,0 +1,91 @@
+           <p class="center">
+             <a style="margin-left: auto; margin-right: auto;" href="vote_001_results.dot">
+               <img src="vote_001_results.png" alt="Graphical rendering of the results">
+               </a>
+           </p>
+             <p>
+               In the graph above, any pink colored nodes imply that
+               the option did not pass majority, the Blue is the
+               winner. The Octagon is used for the options that did
+               not beat the default.  
+           </p>
+           <ul>
+<li>Option 1 "Andreas Tille"</li>
+<li>Option 2 "Sruthi Chandran"</li>
+<li>Option 3 "None of the above"</li>
+           </ul>
+            <p>
+               In the following table, tally[row x][col y] represents
+               the votes that option x received over option y. A 
+               <a href="http://en.wikipedia.org/wiki/Schwartz_method">more
+                 detailed explanation of the beat matrix</a> may help in
+               understanding the table. For understanding the Condorcet method, the
+               <a href="http://en.wikipedia.org/wiki/Condorcet_method">Wikipedia
+                 entry</a> is fairly informative.
+           </p>
+           <table class="vote">
+             <caption class="center"><strong>The Beat Matrix</strong></caption>
+	     <tr><th>&nbsp;</th><th colspan="3" class="center">Option</th></tr>
+              <tr>
+                   <th>&nbsp;</th>
+                   <th>    1 </th>
+                   <th>    2 </th>
+                   <th>    3 </th>
+              </tr>
+                 <tr>
+                   <th>Option 1  </th>
+                   <td>&nbsp;</td>
+                   <td>  201 </td>
+                   <td>  293 </td>
+                 </tr>
+                 <tr>
+                   <th>Option 2  </th>
+                   <td>  135 </td>
+                   <td>&nbsp;</td>
+                   <td>  280 </td>
+                 </tr>
+                 <tr>
+                   <th>Option 3  </th>
+                   <td>   64 </td>
+                   <td>   66 </td>
+                   <td>&nbsp;</td>
+                 </tr>
+               </table>
+              <p>
+
+Looking at row 2, column 1, Sruthi Chandran<br/>
+received 135 votes over Andreas Tille<br/>
+<br/>
+Looking at row 1, column 2, Andreas Tille<br/>
+received 201 votes over Sruthi Chandran.<br/>
+              <h3>Pair-wise defeats</h3>
+              <ul>
+                <li>Option 1 defeats Option 2 by ( 201 -  135) =   66 votes.</li>
+                <li>Option 1 defeats Option 3 by ( 293 -   64) =  229 votes.</li>
+                <li>Option 2 defeats Option 3 by ( 280 -   66) =  214 votes.</li>
+              </ul>
+              <h3>The Schwartz Set contains</h3>
+              <ul>
+                <li>Option 1 "Andreas Tille"</li>
+              </ul>
+              <h3>The winners</h3>
+              <ul>
+                <li>Option 1 "Andreas Tille"</li>
+              </ul>
+              <p>
+               Debian uses the Condorcet method for voting.
+               Simplistically, plain Condorcets method
+               can be stated like so : <br/>
+               <q>Consider all possible two-way races between candidates.
+                  The Condorcet winner, if there is one, is the one
+                  candidate who can beat each other candidate in a two-way
+                  race with that candidate.</q>
+               The problem is that in complex elections, there may well
+               be a circular relationship in which A beats B, B beats C,
+               and C beats A. Most of the variations on Condorcet use
+               various means of resolving the tie. See
+               <a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
+               for details. Debian's variation is spelled out in the
+               <a href="$(HOME)/devel/constitution">constitution</a>,
+               specifically,  A.5.
+              </p>