800 search results - page 74 / 160 » On the Complexity of Parity Games |
COCO
1991
Springer
14 years 21 days ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
TARK
2007
Springer
14 years 3 months ago
2007
Springer
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
LWA
2007
13 years 10 months ago
2007
Serious games that should adapt training to the individual might benefit from methods that are developed for intelligent tutoring systems. One method, model tracing, might be used...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
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 de...
CIAC
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...