Re: [Gendispatch] New Version Notification for draft-knodel-nomcom-gender-representation-00.txt

[Eric Rescorla <[e-mail]>]

This seems like an improvement conceptually, but I'm less sure about your
code.

If everyone listed PNTS, won't it just never terminate?

-Ekr


On Wed, Nov 22, 2023 at 4:57 PM Martin Thomson <[e-mail]> wrote:

> On Thu, Nov 23, 2023, at 07:05, Eric Rescorla wrote:
> > Just so I understand what you are proposing in practice. Suppose we have
> four
> > values: A, B, C, and PNTS, then the selection algorithm would be:
> >
> > exclude = None
> > while selected_total < 10 {
> >   candidate = draw_random()
> >   if selected(gender(x)) == 8 {
> >      exclude = gender(x)
> >   }
> >   if exclude != None {
> >     if exclude == gender(x)  {
> >        skip;
> >     }
> >     // This avoids giving pnts a preference
> >     if gender(x) == pnts {
> >        skip;
> >     }
> >
> >    select x;
> > }
>
> I know how to do code review!  (You missed a closing brace.)
>
> A perhaps better approach is to count PNTS toward all genders, which is
> probably more robust.  Otherwise, an all-male NomCom can be selected.  With
> a limit of eight, if two male volunteers select PNTS, the count won't reach
> that limit, as long as the two male PNTS options aren't the last two
> selected (which is a bit weird).
>
> while selected.len < 10 {
>   candidate = draw();
>   // insert affiliation check here
>   if candidate.gender == PNTS {
>     if genders[A] == limit || genders[B] == limit || genders[B] == limit {
>

ITYM genders[C] for the last clause.



>       skip;
>     }
>     genders[A]++; genders[B]++; genders[C]++;
>   } else {
>     if genders[candidate.gender] == limit {
>       skip;
>     }
>     genders[candidate.gender]++;
>   }
>   select candidate;
> }
>