We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
The sound reaching the acoustic sensor in a realistic environment contains not only the part arriving directly from the sound source but also a number of environmental re ections....
Adam O'Donovan, Ramani Duraiswami, Dmitry N. Zotki...
Background: While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives...
Eduardo Corel, Florian Pitschi, Ivan Laprevotte, G...
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...