800 search results - page 58 / 160 » On the Complexity of Parity Games |
ICASSP
2009
IEEE
13 years 7 months ago
2009
IEEE
The clipping of log-likelihood ratios (LLRs) in soft demodulators for multiple-input multiple-output (MIMO) systems with bitinterleaved coded modulation (BICM) was recently observ...
ATAL
2006
Springer
14 years 29 days ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
LICS
2008
IEEE
14 years 3 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
SIGECOM
2006
ACM
14 years 3 months ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...