Constrained minimization of Manhattan distance for voting on budgets

The following paper describes a voting algorithm suitable for assigning a limited resource (e.g. budget) to a set of candidates.

• Recent versions:
  • Most recent version 2024-11-11 09:20 UTC (with Octave implementation)
  • Previous version 2024-11-10 12:35 UTC with unclear row-wise substraction
• Old version with equivalent but numerically differently calculated tie-breaker:
  • Old version 2024-11-09 15:15 UTC (with Octave implementation)
• Old versions with broken tie-breaking:
  • Old version 2024-11-07 17:25 UTC (with Octave implementation)
  • Old version 2024-11-06 10:10 UTC (with Octave implementation)
  • First version 2024-11-04 10:00 UTC (with Octave implementation)

Zurück zur Hauptseite

Kontakt