Log In Sign Up

Online Selection of Diverse Committees

by   Virginie Do, et al.

Citizens' assemblies need to represent subpopulations according to their proportions in the general population. These large committees are often constructed in an online fashion by contacting people, asking for the demographic features of the volunteers, and deciding to include them or not. This raises a trade-off between the number of people contacted (and the incurring cost) and the representativeness of the committee. We study three methods, theoretically and experimentally: a greedy algorithm that includes volunteers as long as proportionality is not violated; a non-adaptive method that includes a volunteer with a probability depending only on their features, assuming that the joint feature distribution in the volunteer pool is known; and a reinforcement learning based approach when this distribution is not known a priori but learnt online.


page 1

page 2

page 3

page 4


The Role of Exploration for Task Transfer in Reinforcement Learning

The exploration–exploitation trade-off in reinforcement learning (RL) is...

A stabilizing reinforcement learning approach for sampled systems with partially unknown models

Reinforcement learning is commonly associated with training of reward-ma...

Neural Greedy Pursuit for Feature Selection

We propose a greedy algorithm to select N important features among P inp...

Learning to Ask Medical Questions using Reinforcement Learning

We propose a novel reinforcement learning-based approach for adaptive an...

Communication Communities in MOOCs

Massive Open Online Courses (MOOCs) bring together thousands of people f...

Have I done enough planning or should I plan more?

People's decisions about how to allocate their limited computational res...