Sciweavers

116 search results - page 20 / 24
» Anonymity-Proof Voting Rules
Sort
View
ESAW
2008
Springer
13 years 9 months ago
Peer Pressure as a Driver of Adaptation in Agent Societies
We consider a resource access control scenario in an open multi-agent system. We specify a mutable set of rules to determine how resource allocation is decided, and minimally assum...
Hugo Carr, Jeremy V. Pitt, Alexander Artikis
TSMC
2008
198views more  TSMC 2008»
13 years 7 months ago
Representation Plurality and Fusion for 3-D Face Recognition
In this paper, we present an extensive study of 3-D face recognition algorithms and examine the benefits of various score-, rank-, and decision-level fusion rules. We investigate f...
Berk Gökberk, Helin Dutagaci, A. Ulas, Lale A...
ATAL
2008
Springer
13 years 9 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
ICML
2003
IEEE
14 years 8 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington