Results 1  10
of
275,048
Strategyproof voting rules over multiissue domains with restricted preferences
 IN SUBMISSION
, 2009
"... In this paper, we characterize strategyproof voting rules when the set of alternatives has a multiissue structure, and the voters ’ preferences are represented by acyclic CPnets that follow a common order over issues. We show that if the preference domain is lexicographic, then a voting rule sati ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
In this paper, we characterize strategyproof voting rules when the set of alternatives has a multiissue structure, and the voters ’ preferences are represented by acyclic CPnets that follow a common order over issues. We show that if the preference domain is lexicographic, then a voting rule
StrategyProofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions
 J. Econ. Theory
, 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract

Cited by 542 (0 self)
 Add to MetaCart
Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 707 (18 self)
 Add to MetaCart
search strategies, each of which is a query expansion for a given domain. For this task, we compare the performance of RankBoost to the individual search strategies. The second experiment is a collaborativefiltering task for making movie recommendations. Here, we present results comparing Rank
STRATEGYPROOF PREFERENCE RULES
"... By virtue of the Kemeny distance strategyproofness of preference rules is defined. It is shown that a preference rule, which assigns a complete relation to every profile of complete relations is nonimposed and strategyproof if and only if it is pairwise voting in committees. So, nonimposedness a ..."
Abstract
 Add to MetaCart
By virtue of the Kemeny distance strategyproofness of preference rules is defined. It is shown that a preference rule, which assigns a complete relation to every profile of complete relations is nonimposed and strategyproof if and only if it is pairwise voting in committees. So, non
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Strategyproof Partitioning ∗
, 2011
"... We consider the problem of choosing a partition of a set of objects by a set of agents. The private information of each agent is a strict ordering over the set of partitions of the objects. A social choice function chooses a partition given the reported preferences of the agents. We impose a natural ..."
Abstract
 Add to MetaCart
natural restriction on the allowable set of strict orderings over the set of partitions, which we call an intermediate domain. Our main result is a complete characterization of strategyproof and topsonly social choice functions in the intermediate domain. We also show that a social choice function
Strategyproof Voting for Multiple Public Goods
, 2011
"... In a voting model where the set of feasible alternatives is a subset of a product set A = A1 × ·· · × Am of m finite categories, we characterize the set of all strategyproof social choice functions for three different types of preference domains over A, namely for the domains of additive, complete ..."
Abstract
 Add to MetaCart
In a voting model where the set of feasible alternatives is a subset of a product set A = A1 × ·· · × Am of m finite categories, we characterize the set of all strategyproof social choice functions for three different types of preference domains over A, namely for the domains of additive
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
 MACHINE LEARNING
, 1999
"... Methods for voting classification algorithms, such as Bagging and AdaBoost, have been shown to be very successful in improving the accuracy of certain classifiers for artificial and realworld datasets. We review these algorithms and describe a large empirical study comparing several variants in co ..."
Abstract

Cited by 695 (2 self)
 Add to MetaCart
Methods for voting classification algorithms, such as Bagging and AdaBoost, have been shown to be very successful in improving the accuracy of certain classifiers for artificial and realworld datasets. We review these algorithms and describe a large empirical study comparing several variants
Domain names  Implementation and Specification
 RFC883, USC/Information Sciences Institute
, 1983
"... This RFC describes the details of the domain system and protocol, and assumes that the reader is familiar with the concepts discussed in a companion RFC, "Domain Names Concepts and Facilities " [RFC1034]. The domain system is a mixture of functions and data types which are an official pr ..."
Abstract

Cited by 715 (9 self)
 Add to MetaCart
This RFC describes the details of the domain system and protocol, and assumes that the reader is familiar with the concepts discussed in a companion RFC, "Domain Names Concepts and Facilities " [RFC1034]. The domain system is a mixture of functions and data types which are an official
Time Discounting and Time Preference: A Critical Review
 Journal of Economic Literature
, 2002
"... www.people.cornell.edu/pages/edo1/. ..."
Results 1  10
of
275,048