4457 search results - page 622 / 892 » Tests of Machine Intelligence |
118
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
158
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
142
click to vote
CIA
2006
Springer
15 years 8 months ago
2006
Springer
In multi-issue negotiations, issues may be negotiated independently or not. In the latter case, the utility associated with one issue depends on the value of another. These issue d...
146
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
152
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Many day-to-day tasks require negotiation, mostly under conditions of incomplete information. In particular, the opponent's exact tradeoff between different offers is usually ...