510 search results - page 40 / 102 » How Should We Solve Search Problems Privately |
AAAI
2010
13 years 9 months ago
2010
In many multiagent settings, a decision must be made based on the preferences of multiple agents, and agents may lie about their preferences if this is to their benefit. In mechan...
ATAL
2003
Springer
14 years 24 days ago
2003
Springer
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
AAAI
2007
13 years 10 months ago
2007
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
AAAI
2007
13 years 10 months ago
2007
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
VLDB
2000
ACM
13 years 11 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...