资源分类
》 资源 》论文》Multigoal Committee Selection

Multigoal Committee Selection

2019-09-29 | |  71 |   54 |   0
Abstract We study the problem of computing committees that perform well according to several different criteria, which are expressed as committee scoring rules. We analyze the computational complexity of computing such committees and provide an experimental evaluation of the compromise levels that can be achieved between several well-known rules, including k-Borda, SNTV, Bloc, and the Chamberlin–Courant rule

上一篇：Multi-Population Congestion Games With Incomplete Information

下一篇：Neural Networks for Predicting Human Interactions in Repeated Games

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...