资源分类
》 资源 》论文》Goal-Based Collective Decisions: Axiomatics and Computational Complexity

Goal-Based Collective Decisions: Axiomatics and Computational Complexity

2019-11-05 | |  58 |   47 |   0
Abstract We study agents expressing propositional goals over a set of binary issues to reach a collective decision. We adapt properties and rules from the literature on Social Choice Theory to our setting, providing an axiomatic characterisation of a majority rule for goal-based voting. We study the computational complexity of finding the outcome of our rules (i.e., winner determination), showing that it ranges from Nondeterministic Polynomial Time (NP) to Probabilistic Polynomial Time (PP).

上一篇：Dynamically Forming a Group of Human Forecasters and Machine Forecaster for Forecasting Economic Indicators

下一篇：Deontic Sensors

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...