Generalized decision method for proposals

Right now we only have binary decisions for proposals, however, there are decisions that may be needed which go beyond this. For example

1. Set the parameter value to one among N values
2. Pick M candidates to accept among N alternatives that applied

We should extend the proposal engine to account for these two decision forms as well. One decision method, which also subsumes normal binary decisions, as well as the two above, is the following:

There are N => 2 alternatives, there will be exactly N > M >= 1 winners, and each decision-maker has to provide a ranked list of M >= K >= 1 alternatives. There are many ways to decide the winners, see

• https://en.wikipedia.org/wiki/Condorcet_method
• https://en.wikipedia.org/wiki/Instant-runoff_voting

The proposal execution code only receives the identifiers for the M winning alternatives, and may do anything with this.

If we support this, we may, in the end, drop the normal binary vote, as it is just a special case. of N=2 and M=K=1.

┆Issue is synchronized with this Asana task by Unito

Start by locating the proposal engine and its proposal execution code, then trace how binary decisions are represented and passed to execution. Define the supported ranked-alternative inputs and winner identifiers, including the stated N, M, and K constraints, and confirm binary voting remains representable as the special case. Done means the engine supports the requested decision forms and execution receives the winning identifiers.