Sciweavers

166 search results - page 18 / 34
» When Is Uncertainty About Uncertainty Worth Characterizing
Sort
View
ATAL
2006
Springer
15 years 4 months ago
Information-theoretic approaches to branching in search
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
Andrew Gilpin, Tuomas Sandholm
88
Voted
IJCAI
2007
15 years 2 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
CI
2002
92views more  CI 2002»
15 years 15 days ago
Model Selection in an Information Economy: Choosing What to Learn
As online markets for the exchange of goods and services become more common, the study of markets composed at least in part of autonomous agents has taken on increasing importance...
Christopher H. Brooks, Robert S. Gazzale, Rajarshi...
CHI
2011
ACM
14 years 4 months ago
Should I open this email?: inbox-level cues, curiosity and attention to email
The quantity of email people receive each day can be overwhelming. Previous research suggests that when handling email, individuals prioritize certain messages for attention over ...
Jaclyn Wainer, Laura Dabbish, Robert Kraut
ATAL
2001
Springer
15 years 4 months ago
Optimal Negotiation Strategies for Agents with Incomplete Information
This paper analyzes the process of automated negotiation between two competitive agents that have firm deadlines and incomplete information about their opponent. Generally speaking...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....