Finding similar regions in many strings
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient approximation algorithms for the Hamming center problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Distinguishing string selection problems
Information and Computation
Sum of us: strategyproof selection from the selectors
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Approximate Mechanism Design without Money
ACM Transactions on Economics and Computation
| Hi-index | 0.00 |
Voting has been a very popular method for preference aggregation in multiagent environments. It is often the case that a set of agents with different preferences need to make a choice among a set of alternatives, where the alternatives could be various entities such as potential committee members, or joint plans of action. A standard methodology for this scenario is to have each agent express his preferences and then select an alternative according to some voting protocol. Several decision making applications in AI have followed this approach including problems in collaborative filtering [10] and planning [3, 4].