We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
It is well known that traditional educational techniques can be complemented by simulation to achieve a more effective learning experience. One would expect the same phenomenon to...
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
We investigate the behavior of two users and one jammer in an additive white Gaussian noise (AWGN) channel with and without fading when they participate in a noncooperative zero-su...
We provide an epistemic analysis of arbitrary strategic games based on possibility correspondences. Such an analysis calls for the use of transfinite iterations of the correspond...