It is demonstrated that span-L functions can be computed in polynomial time if and only if P (#P) and all the classes of the polynometric-time hierarchy are included in P.Expand

It is shown that variations of the allowed packet trajectory lead to nonequivalent characterizations, which are able to provide polynomial time algorithms for testing stability under the \NTGLIS (Nearest To Go-Longest In System) protocol.Expand

It is shown that deciding the existence of a Nash equilibrium in a strategic game is NP-complete when the number of players is large and the number and size of strategies for each player is constant, while the problem is Σ$^{p}_{\rm 2}$- complete when the Number of Players is a constant and the size of the sets of strategies is exponential.Expand

It is demonstrated that span-L-functions can be computed in polynomial time if and only if P=NP=PH=P( Hash P), i.e if the class P(Hash P) and all the classes of thePolynomial-time hierarchy are contained in P.Expand

In this paper, new insights are given into the structure of the Nash equilibria for different ranges of $\alpha$ and the range for which the price of anarchy is constant is enlarged.Expand

It is shown that universal stability of digraphs, in the case in which packets follow directed paths without repeating vertices, can be decided in polynomial time, and is equivalent to \NTGLIS-stability, in all the cases.Expand

The problem of deciding stability of a given network under a fixed protocol can be solved in polynomial time and a characterization of the networks that are stable under fifo and lis in the failure model is provided.Expand

This paper proposes three ways of representing a game with different degrees of succinctness for the components of the game and shows that when the number of moves of each player is large and the player function and the utilities are represented succinctly the considered problems are PSPACE-complete.Expand

By imposing appropriate bounds on the number of functional oracle queries made in this computation model, this work obtains new characterizations of the NC and AC hierarchies and solves open questions of Wilson.Expand

It is shown that the first two problems can be efficiently parallelized, allowing logarithmic time Parallel RAM algorithms and even constant time unbounded fan-in circuits with threshold gates, however, lower bounds imply that they cannot be solved in constant time by a PRAM algorithm.Expand