Affiliation:
1. Rensselaer Polytechnic Institute
Abstract
In this note, we discuss several settings in which algorithms can provide good outcomes when given only ordinal information. We focus especially on voting mechanisms in settings with spacial preferences, and on the notion of distortion.
Publisher
Association for Computing Machinery (ACM)
Reference16 articles.
1. Anshelevich E. and Sekar S. 2015. Blind greedy and random: Ordinal approximation algorithms for graph problems. In arXiv:1512.05504 preprint. Anshelevich E. and Sekar S. 2015. Blind greedy and random: Ordinal approximation algorithms for graph problems. In arXiv:1512.05504 preprint .
2. Optimal social choice functions
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献