Sciweavers

67 search results - page 5 / 14
» A Computational Study of the Kemeny Rule for Preference Aggr...
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
14 years 22 days ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2004
ACM
112views ECommerce» more  SIGECOM 2004»
14 years 27 days ago
Self-interested automated mechanism design and implications for optimal combinatorial auctions
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
14 years 8 months ago
Parallel Algorithms for Computing Temporal Aggregates
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advan...
Jose Alvin G. Gendrano, Bruce C. Huang, Jim M. Rod...
GROUP
2009
ACM
14 years 2 months ago
Two peers are better than one: aggregating peer reviews for computing assignments is surprisingly accurate
Scientific peer review, open source software development, wikis, and other domains use distributed review to improve quality of created content by providing feedback to the work...
Ken Reily, Pam Ludford Finnerty, Loren G. Terveen
SIGECOM
2003
ACM
141views ECommerce» more  SIGECOM 2003»
14 years 22 days ago
Automated mechanism design for a self-interested designer
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm