1260 search results - page 36 / 252 » Bipolar Preference Problems |
AAAI
2004
13 years 11 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
AAAI
2004
13 years 11 months ago
2004
We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single cons...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alter...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
We present Stretch `n' Shrink, a query design framework that explicitly takes into account user preferences about the desired answer size, and subsequently modifies the query...
AUSDM
2007
Springer
14 years 4 months ago
2007
Springer
Recommender systems are important to help users select relevant and personalised information over massive amounts of data available. We propose an unified framework called Prefer...