— Security breaches and attacks are critical problems in today’s networking. A key-point is that the security of each host depends not only on the protection strategies it choo...
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
Learning to act in a multiagent environment is a difficult problem since the normal definition of an optimal policy no longer applies. The optimal policy at any moment depends on ...
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...