We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
jr.sagepub.com/cgi/content/abstract/26/3/255 The online version of this article can be found at: Published by: http://www.sagepublications.com On behalf of: Multimedia Archives can...
Vikrant Sharma, Michael A. Savchenko, Emilio Frazz...
Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class ...
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
This letter presents a new method to directly analyze and optimize symbol error rate (SER) performance of minimum decoding complexity (MDC) ABBA space-time block codes based on a t...