Sciweavers

667 search results - page 35 / 134
» Making decisions based on the preferences of multiple agents
Sort
View
IJAR
2010
120views more  IJAR 2010»
13 years 7 months ago
Comparison of tightly and loosely coupled decision paradigms in multiagent expedition
Frameworks for cooperative multiagent decision making may be divided into those where each agent is assigned a single variable (SVFs) and those where each agent carries an interna...
Yang Xiang, Franklin Hanshar
AAAI
2006
13 years 10 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
MFCS
2009
Springer
14 years 1 months ago
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
Nadja Betzler, Britta Dorn
JCSS
2010
112views more  JCSS 2010»
13 years 7 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
IJCAI
2003
13 years 10 months ago
A New Look at the Semantics and Optimization Methods of CP-Networks
Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. CP-nets were designed to make the preference elicitation proces...
Ronen I. Brafman, Yannis Dimopoulos