资源分类
》 资源 》论文》Preference Restrictions in Computational Social Choice: Recent Progress

Preference Restrictions in Computational Social Choice: Recent Progress

2019-11-25 | |  49 |   36 |   0
Abstract The goal of this short paper is to provide an overview of recent progress in understanding and exploiting useful properties of restricted preference domains, such as, e.g., the domains of singlepeaked, single-crossing and 1-Euclidean preferences.

上一篇：Ontology-Mediated Query Answering: Harnessing Knowledge to Get More From Data

下一篇：Boolean Satisfiability and Beyond: Algorithms, Analysis, and AI Applications

用户评价
全部评价

热门资源

  • 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...