资源分类
》 资源 》论文》Fully Proportional Representation as Resource Allocation: Approximability Results

Fully Proportional Representation as Resource Allocation: Approximability Results

2019-11-11 | |  78 |   42 |   0
Abstract We study the complexity of (approximate) winner determination under Monroe’s and ChamberlinCourant’s multiwinner voting rules, where we focus on the total (dis)satisfaction of the voters (the utilitarian case) or the (dis)satisfaction of the worstoff voter (the egalitarian case). We show good approximation algorithms for the satisfaction-based utilitarian cases, and inapproximability results for the remaining settings.

上一篇：Efficiently Solving Joint Activity Based Security Games

下一篇：Bimodal Switching for Online Planning in Multiagent Settings? Ekhlas Sonu and Prashant Doshi

用户评价
全部评价

热门资源

  • Learning to learn...

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

  • A Mathematical Mo...

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

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Rating-Boosted La...

    The performance of a recommendation system reli...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...