Sciweavers

281 search results - page 8 / 57
» A revealed preference approach to computational complexity i...
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
14 years 1 months 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
JCP
2008
125views more  JCP 2008»
13 years 7 months ago
Comparative Analysis of Resource Discovery Approaches in Grid Computing
Grid technologies enable the sharing of a wide variety of distributed resources. To utilize these resources, effective Resource Management systems are needed. Resource Management s...
Anju Sharma, Seema Bawa
AI
2008
Springer
13 years 8 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
JAIR
2006
101views more  JAIR 2006»
13 years 7 months ago
Resource Allocation Among Agents with MDP-Induced Preferences
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
Dmitri A. Dolgov, Edmund H. Durfee
STACS
2012
Springer
12 years 3 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen