800 search results - page 70 / 160 » On the Complexity of Parity Games |
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract- Interactive combat games are useful as testbeds for learning systems employing evolutionary computation. Of particular value are games that can be modified to accommodate...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...